A Hybrid Shifting Bottleneck Algorithm for the Job Shop Scheduling Problem
A hybrid shifting bottleneck algorithm for the job shop scheduling problem is presented, which comprises two parts: a shifting bottleneck algorithm to find a feasible solution for the problem quickly, and a simplified simulated annealing algorithm which can improve the solution by neighborhood-searching. Introducing the simulated annealing algorithm into the shifting bottleneck algorithm can remarkably upgrade its searching ability, which often leads to an optimal solution for a job shop scheduling problem more easily. The connection of the two parts among the proposed algorithm is simple and effective. The approach is tested on a set of standard instances taken from literatures and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.
Lianghui Zhao Feiqi Deng
Institute of Systems Engineering South China University of Tech.Guangzhou, 510640,P.R China
国际会议
青岛
英文
2006-07-21（万方平台首次上网日期，不代表论文的发表时间）