Hybrid Scatter Search for dynamic job shop problem

カテゴリ: 部門大会

論文No: SS7-7

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

発行日: 2015/08/27

タイトル(英語): Hybrid Scatter Search for dynamic job shop problem

著者名: Yedan Wu(Waseda University),Wei Weng(Waseda University),Shigeru Fujimura(Waseda University)

著者名(英語): Yedan Wu(Waseda University),Wei Weng(Waseda University),Shigeru Fujimura(Waseda University)

キーワード: job shop|dynamic|scatter search

要約(日本語): Job-shop Scheduling Problem (JSP) is one of the most well-known scheduling problems and one of the strongly NP-hard problems. Dynamic Job-shop Scheduling Problem (DJSP) includes machine breakdown and job arrival (event driven), which is much more complicated. To solve the problem, a new hybrid Scatter Search (SS) method is proposed, including modified variable neighborhood search (MVNS)for local search. The proposed method is compared with other algorithms such as MVNS, SS and FIFO.
The experimental simulation shows that the hybrid method is quite effective at solving the event driven job shop scheduling problem.

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