Dynamic Local Focusing Approach for Job Shop Scheduling Problems

カテゴリ: 部門大会

論文No: GS9-4

グループ名: 【C】平成19年電気学会電子・情報・システム部門大会講演論文集

発行日: 2007/09/04

タイトル(英語): Dynamic Local Focusing Approach for Job Shop Scheduling Problems

著者名: 顧平 (早稲田大学),楼 雅潔(早稲田大学),張学睿 (早稲田大学),藤村 茂(早稲田大学)

著者名(英語): Ping Gu(Waseda University),Yajie Lou(Waseda University),Xuerui Zhang(Waseda University),Shigeru Fujimura(Waseda University)

キーワード: Decomposition approach|Focused cell|Longest active chain|Production scheduling problems

要約(日本語): Although divide and conquer has long been a common approach to handle computational complexity caused by large scale production scheduling problems, in order to extend the applicability of the decomposition approach, the entire problem should be decomposed on which criterion is always a problem. Also how to improve decomposition approach’s computational efficiency and resultant effectiveness is still a challenging task in this field.
For improving decomposition approach’s efficiency and decreasing computational complexity for job shop scheduling problems, a new dynamic local focusing approach which has a machine-based divided criterion focused on the longest active chain is proposed in this paper. Disliking the used decomposition procedure, the proposed one does not decompose a job shop into cells at the very beginning. It dynamically classifies the machines, which process operations on the identified longest active chain of the whole problem as one focused cell (decomposed sub-problem). The schedule is improved by redefining, adjusting and solving the focused cell schedule in this dynamic procedure. The proposed approach is tested on make-span minimum benchmark job shop scheduling problems. Test results show that the algorithm is capable of efficiently generating good schedules.

PDFファイルサイズ: 3,462 Kバイト