Improvements to Flexible Job Shop Scheduling with Overlapping in Operations Problem with Genetic Algorithm

カテゴリ: 部門大会

論文No: SS1-9

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

発行日: 2017/09/06

タイトル(英語): Improvements to Flexible Job Shop Scheduling with Overlapping in Operations Problem with Genetic Algorithm

著者名: He Yiyong(Waseda University),Weng Wei(Waseda University),Fujimura Shigeru(Waseda University)

著者名(英語): Yiyong He|Wei Weng|Shigeru Fujimura

キーワード: flexible job shop|scheduling|overlapping in operation|genetic algorithm

要約(日本語): Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. FJSP allows an operation to be processed by several different machines. FJSP with overlapping in operations means that an operation is divided into multiple sublots and each sublot is treated separately and transferred to the next processing stage once it is completed. In previous research, a genetic algorithm is proposed to solve this problem. In this study, we try to improve the procedure of previous research to achieve better results. The proposed improvements were tested on a set of benchmark problems and compared with the results obtained by previous research.

PDFファイルサイズ: 240 Kバイト