Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem

スポンサーリンク

概要

• 論文の詳細を見る

• This paper describes a procedure for local modifications of a job shop schedule planned under a no-buffer constraint. The modifications are to correct the infeasibility caused by exchanging two consecutive operations on the same machine. An extended disjunctive graph, which has reverse conjunctive arcs connecting two consecutive processes, is introduced to identify the operations preventing the feasibility of such a schedule. By exchanging the operating order of these operations, the obtained infeasible schedule can be corrected to a feasible schedule. An example of the modifications for a given job shop schedule is shown to discuss the advantages of the proposed procedure.

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

著者

• Hino Rei

  Department Of Mechanical Engineering Kobe University

• HAYASAKA Takehiro

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

関連論文

• Job Shop Scheduling Focusing on Role of Buffer
• Decentralized Job Shop Scheduling by Recursive Propagation Method
• 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

スポンサーリンク