A hybrid algorithm for multi-objective job shop scheduling problem
In this study, we proposed a hybrid algorithm for solving the job shop scheduling problem with two objectives, i.e., to minimize the maximal completion time, the total flow time. The tabu search (TS) algorithm was used to conduct local search. Several initial approaches are presented to produce initial solution with high level of quality. The neighborhood structure based on critical block was introduced to reduce the searching space size. Experimental results based well-known benchmarks show the efficiency and effectiveness of the proposed algorithm.
Multi-objective Job shop scheduling problem Tabu search Critical block
Junqing Li Quanke Pan Shengxian Xie Kaizhou Gao Yuting Wang
School of Computer,Liaocheng University,Liaocheng,Shandong,252059,China
国际会议
2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)
四川绵阳
英文
3638-3642
2011-05-23（万方平台首次上网日期，不代表论文的发表时间）