バッファを考慮にいれたジョブショップスケジューリング : 第3報,混合整数計画による最適化(機械要素,潤滑,工作,生産管理)

概要

論文の詳細を見る
This study deals with a job shop scheduling problem with buffers in addition to general production devices. In conventional scheduling problems, a buffer, or a store device is modeled as a production resource playing different roles from a production device such as a machine tool and a robot. In a proposed scheduling problem, the store device and the production device' are identified with the same production resource. Therefore a simple formulation for the scheduling problem is derived. The new job shop scheduling problem is formulated as a mixed integer programming problem in the present paper, and an optimal solution is solved under several production conditions. As one of results, it confirms that the limitation of the buffer capacity is effective at controlling the amount of works in the process. The proposed formulation involves choosing a suitable production equipment among plural resources. The same scheduling problem is adopted when a proxy is available for the production instead of the bottle-necked resource.
2008-06-25