Problem difficulty for tabu search in job-shop scheduling

Artificial Intelligence

Volumn 143, Issue 2, 2003, Pages 189-217

  Watson, Jean Paul ^a   Beck, J Christopher ^b   Howe, Adele E ^a   Whitley, L Darrell ^a  

^a Colorado State University   (United States)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPERATIONS RESEARCH; PROBLEM SOLVING; SCHEDULING;

JOB SHOP SCHEDULING;

ARTIFICIAL INTELLIGENCE;

EID: 0037302910     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00363-6     Document Type: Article

References (36)

1. Achlioptas D., Gomes C., Kautz H., Selman B. Generating satisfiable problem instances. Ford K. Proc. AAAI-2000, Austin, TX. 2000;256-261 AAAI/MIT Press, Cambridge, MA.
2. Balas E., Vazacopoulos A. Guided local search with shifting bottleneck for job-shop scheduling. Management Sci. 44:(2):1998;262-275.
3. Barnes J.W., Chambers J.B. Solving the job shop scheduling problem with tabu search. IIE Trans. 27:1995;257-263.
4. Beasley J.E. OR-library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41:(11):1990;1069-1072.
5. Beck J.C., Fox M.S. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence. 117:(2):2000;31-81.
6. Blażewicz J., Domschke W., Pesch E. The job shop scheduling problem: Conventional and new solution techniques. European J. Oper. Res. 93:1996;1-33.
7. Blażewicz J., Pesch E., Sterna M. The disjunctive graph machine representation of the job shop scheduling problem. European J. Oper. Res. 127:2000;317-331.
8. Boese K.D., Kahng A.B., Muddu S. A new adaptive multi-start technique for combinatorial optimization. Oper. Res. Lett. 16:1994;101-113.
9. J.B. Chambers, J.W. Barnes, New tabu search results for the job shop scheduling problem, Technical Report ORP96-10, Graduate Program in Operations Research and Industrial Engineering, The University of Texas at Austin, 1996.
10. Clark D.A., Frank J., Gent I.P., MacIntyre E., Tomov N., Walsh T. Local search and the number of solutions. Proceedings of the Second International Conference on Principles and Practices of Constraint Programming (CP-96), Cambridge, MA. 1996;119-133.
11. Cohen P.R. Empirical Methods for Artificial Intelligence. 1995;MIT Press, Cambridge, MA.
12. Fisher H., Thompson G.L. Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules. 1963;Prentice-Hall, Englewood Cliffs, NJ. Chapter 15, pp. 225-251.
13. Frank J., Cheeseman P., Stutz J. When gravity fails: Local search topology. J. Artificial Intelligence Res. 7:1997;249-281.
14. Garey M.R., Johnson D.S., Sethi R. The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1:(2):1976;117-129.
15. Gent I.P., Walsh T. Easy problems are sometimes hard. Artificial Intelligence. 70:(1-2):1994;335-345.
16. Glover F., Laguna M. Tabu Search. 1997;Kluwer Academic, Boston, MA.
17. Hogg T., Huberman B.A., Williams C.P. Phase transitions and the search problem. Artificial Intelligence. 81:(1-2):1996;1-15.
18. H.H. Hoos, Stochastic local search - Methods, models, applications, PhD Thesis, Darmstadt University of Technology, 1998.
19. Jain A.S., Meeran S. Deterministic job-shop scheduling: Past, present and future. European J. Oper. Res. 113:1999;390-434.
20. Mattfeld D.C., Bierwirth C., Kopfer H. A search space analysis of the job shop scheduling problem. Ann. Oper. Res. 86:1999;441-453.
21. Monasson R., Zecchina R., Kirkpatrick S., Selman B., Troyansky L. Determining computational complexity for characteristic 'phase transitions'. Nature. 400:1998;133-137.
22. Nowicki E., Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Sci. 42:(6):1996;797-813.
23. Lyman Ott R. An Introduction to Statistical Methods and Data Analysis. 1993;Duxbury Press, Belmont, CA.
24. Parkes A.J. Clustering at the phase transition. Proc. AAAI-97, Providence, RI. 1997;340-345.
25. C.M. Riedys, P.F. Stadler, Combinatorial landscapes, Technical Report 01-03-014, The Santa Fe Institute, 2001.
26. J. Singer, Why solutions can be hard to find: A featural theory of cost for a local search algorithm on random satisfiability, PhD Thesis, University of Edinburgh, 2000.
27. Singer J., Gent I.P., Smaill A. Backbone fragility and the local search cost peak. J. Artificial Intelligence Res. 12:2000;235-270.
28. Slaney J., Walsh T. Backbones in optimization and approximation. Nebel B. Proc. IJCAI-01, Seattle, WA. 2001;254-259 Morgan Kaufmann, San Mateo, CA.
29. Smith B., Grant S. Sparse constraint graphs and exceptionally hard problems. Mellish C. Proc. IJCAI-95, Montreal, Quebec. 1995.
30. Storer R.H., Wu S.D., Vaccari R. New search spaces for sequencing problems with application to job shop scheduling. Management Sci. 38:1992;1495-1509.
31. T. Stützle, Local search algorithms for combinatorial problems - Analysis, improvements, and new applications, PhD Thesis, Darmstadt University of Technology, 1999.
32. Taillard E.D. Benchmarks for basic scheduling problems. European J. Oper. Res. 64:1993;278-285.
33. Taillard E.D. Parallel taboo search techniques for the job shop scheduling problem. ORSA J. Comput. 6:(2):1994;108-117.
34. Vaessens R.J.M., Aarts E.H.L., Lenstra J.K. Job shop scheduling by local search. INFORMS J. Comput. 8:(3):1996;302-317.
35. van Laarhoven P.J.M., Aarts E.H.L., Lenstra J.K. Job shop scheduling by simulated annealing. Oper. Res. 40:1992;113-125.
36. Watson J.-P., Beck J.C., Howe A.E., Whitley L.D. Toward an understanding of local search cost in job-shop scheduling. Cesta A. Proceedings of the Sixth European Conference on Planning. 2001;Springer, Berlin.