A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

作者：Zhang ChaoYong^*; Li PeiGen; Guan ZaiLin; Rao YunQing

来源：Computers & Operations Research, 2007, 34(11): 3229-3242.

DOI：10.1016/j.cor.2005.12.002

• job shop scheduling problem
• makespan
• heuristic
• tabu search

Tabu search (TS) algorithms are among the most effective approaches for solving the job shop scheduling problem (JSP) which is one of the most difficult NP-complete problems. However, neighborhood structures and move evaluation strategies play the central role in the effectiveness and efficiency of the tabu search for the JSP. In this paper, a new enhanced neighborhood structure is proposed and applied to solving the job shop scheduling problem by TS approach. Using this new neighborhood structure combined with the appropriate move evaluation strategy and parameters, we tested the TS approach on a set of standard benchmark instances and found a large number of better upper bounds among the unsolved instances. The computational results show that for the rectangular problem our approach dominates all others in terms of both solution quality and performance.

• 出版日期2007-11
• 单位华中科技大学