拡張LCOによるジョブショップ・スケジューリング問題解法の安定性検討

カテゴリ: 部門大会

論文No: GS12-2

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

発行日: 2008/08/20

タイトル(英語): Examination of The Stable Performance to The Solution by Extended Local Clustering Organization (LCO) for Job-shop Scheduling Problem

著者名: 今野陽子 (公立はこだて未来大学),鈴木 恵二(北海道大学)

著者名(英語): Yohko Konno(Future University-Hakodate),Keiji Suzuki(Hokkaido University)

キーワード: ジョブショップ|スケジューリング|局所クラスタリング組織化法|最適化|局所探索アルゴリズム|Job-shop|Schedulin|Local Clustering Organization|Optimization|Local SearchAlgorithm

要約(日本語): This paper describes a development approach of the general purpose solution algorithm to large scale problems using “Local Clustering Organization (LCO)” as the new solution for Job-shop scheduling problem. In the study of traditional LCO, although the effectiveness of the local clustering based on the scheduling evaluation is proposed, for Improvement of the performance of the solution, in this study, the process to the optimization by LCO is analyzed, and the solution which introduced the simultaneous solution of the multiplex gene based on machine-based division as expressional technique of a scheduling solution is proposed. The result verified by applying the proposal solution on the various scales of problems proved the excellent performance, to conduce to minimize the make-span and improve on the stable performance.

PDFファイルサイズ: 4,792 Kバイト