Problem difficulty for tabu search in job-shop scheduling

Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from similar models developed for SAT and other NP-complete problems. We show that the mean distance between random local optima and the nearest optimal solution is highly correlated with the cost of locating optimal solutions to typical, random JSPs. Additionally, this model accounts for the cost of locating sub-optimal solutions, and provides an explanation for differences in the relative difficulty of square versus rectangular JSPs. We also identify two important limitations of our model. First, model accuracy is inversely correlated with problem difficulty, and is exceptionally poor for rare, very high-cost problem instances. Second, the model is significantly less accurate for structured, non-random JSPs. Our results are also likely to be useful in future research on difficulty models of local search in SAT, as local search cost in both SAT and the JSP is largely dictated by the same search space features. Similarly, our research represents the first attempt to quantitatively model the cost of tabu search for any NP-complete problem, and may possibly be leveraged in an effort to understand tabu search in problems other than job-shop scheduling.

[1]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[2]  Tad Hogg,et al.  Phase Transitions and the Search Problem , 1996, Artif. Intell..

[3]  Holger H. Hoos,et al.  Stochastic Local Search-Methods , 1998 .

[4]  Paul R. Cohen,et al.  Empirical methods for artificial intelligence , 1995, IEEE Expert.

[5]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[6]  Jean-Paul Watson,et al.  Toward an Understanding of Local Search Cost in Job-Shop Scheduling , 2001 .

[7]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[8]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[9]  Andrew J. Parkes,et al.  Clustering at the Phase Transition , 1997, AAAI/IAAI.

[10]  Josh. Singer Why solutions can be hard to find : a featural theory of cost for a local search algorithm on random satisfiability instances , 2001 .

[11]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[12]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[13]  J. Wesley Barnes,et al.  New Tabu Search Results for the Job Shop Scheduling Problem , 1996 .

[14]  Christian M. Reidys,et al.  Combinatorial Landscapes , 2002, SIAM Rev..

[15]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[16]  Toby Walsh,et al.  Local Search and the Number of Solutions , 1996, CP.

[17]  Holger H. Hoos,et al.  Stochastic local search - methods, models, applications , 1998, DISKI.

[18]  Jeremy Frank,et al.  When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..

[19]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[20]  Christian Bierwirth,et al.  A search space analysis of the Job Shop Scheduling Problem , 1999, Ann. Oper. Res..

[21]  Toby Walsh,et al.  Easy Problems are Sometimes Hard , 1994, Artif. Intell..

[22]  Erwin Pesch,et al.  The disjunctive graph machine representation of the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[23]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[24]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[25]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems: analysis, algorithms, and new applications , 1999 .

[26]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[27]  J. Christopher Beck,et al.  Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics , 2000, Artif. Intell..

[28]  Rémi Monasson,et al.  Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.

[29]  Barbara M. Smith,et al.  Sparse Constraint Graphs and Exceptionally Hard Problems , 1995, IJCAI.

[30]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[31]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[32]  Alan Smaill,et al.  Backbone Fragility and the Local Search Cost Peak , 2000, J. Artif. Intell. Res..

[33]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[34]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[35]  Toby Walsh,et al.  Backbones in Optimization and Approximation , 2001, IJCAI.

[36]  Bart Selman,et al.  Generating Satisfiable Problem Instances , 2000, AAAI/IAAI.

[37]  R. Lyman Ott.,et al.  An introduction to statistical methods and data analysis , 1977 .