1A1 MULTIPLE EXCHANGES OF JOB ORDERS FOR LOCAL SEARCH OF NO-BUFFER JOB SHOP SCHEDULING PROBLEM(Technical session 1A: OS1: Practical scheduling approach(1))

スポンサーリンク

概要

• 論文の詳細を見る

• This paper describes a procedure for local modifications of a job shop schedule planned under a no-buffer constraint. The procedure is for correcting the infeasibility caused by exchanging two consecutive operations on the same ma-chine. An extended disjunctive graph, which has reverse conjunctive arcs connecting two consecutive operating processes, is introduced to identify the operations preventing the feasibility of such a schedule. An example of the modifications for a given job shop schedule is shown to discuss the advantages of the proposed procedure.

• 一般社団法人日本機械学会の論文
• 2011-07-02

著者

• Hino Rei

  Graduate School of Engineering Nagoya University

• Hayasaka Takehiro

  Department of Mechanical Science and Engineering Nagoya University

• HAYASAKA Takehiro

  Department of Mechanical Science and Engineering Graduate School of Engineering Nagoya University

関連論文

• 1A1 MULTIPLE EXCHANGES OF JOB ORDERS FOR LOCAL SEARCH OF NO-BUFFER JOB SHOP SCHEDULING PROBLEM(Technical session 1A: OS1: Practical scheduling approach(1))
• Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem

スポンサーリンク