Characterizing the distribution of low-makespan schedules in the job shop scheduling problem

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 61-70

  Streeter, Matthew J ^a   Smith, Stephen F ^b  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL RESULTS; BRANCH-AND-BOUND ALGORITHMS; JOB SHOP SCHEDULING PROBLEMS; LIMITING CASE; NEAR-OPTIMAL; SEARCH LANDSCAPES; SEARCH SPACES; SMALL REGION;

LANDFORMS; LINEAR PROGRAMMING; OPTIMIZATION;

SCHEDULING ALGORITHMS;

EID: 33746052341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Balas, E. 1969. Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Operations Research 17:1-10.
2. Beasley, J. 1990. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41(11): 1069-1072.
3. Boese, K. D.; Kahng, A. B. and Muddu, S. 1994. A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters 16:101-113.
4. Brucker, P.; Jurisch, B.; and Sievers, B. 1994. A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49(1-3):107-127.
5. Fisher, H and Thompson, G. L. 1963. Probabilistic learning combinations of local job-shop scheduling rules. In Muth, J. F., and Thompson, G. L eds., Industrial Scheduling. Englewood Cliffs, NJ: Prentice-Hall. 225-251.
6. Glover, F. and Laguna, M. 1997. Tabu Search. Boston, MA: Kluwer Academic Publishers.
7. Jain, A. and Meeran, S. 1998. A state-of-the- Art review of job-shop scheduling techniques. Technical report, Department of Applied Physics, Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland.
8. Jones, A. and Rabelo, L. C. 1998. Survey of job shop scheduling techniques. Technical report, National Institute of Standards and Technology, Gaithersburg, MD.
9. Kim, Y.H. and Moon, B.R. 2004. Investigation of the fitness landscapes in graph bipartitioning: An empirical study. Journal of Heuristics 10:111-133.
10. Lourcno, H., Martin, O. and Stiitzle, T. 2003. Iterated local search. In Glover, F., and Kochenberger, G., eds., Handbook of Metaheuristics. Boston, MA: Kluwer Academic Publishers.
11. Martin, O. C.; Monasson, R. and Zecchina, R. 2001. Statistical mechanics methods and phase transitions in combinatorial problems. Theoretical Computer Science 265(1- 2): 3-67.
12. Mattfeld, D. C.; Bierwirth, C. and Kopfer, H. 1999. A search space analysis of the job shop scheduling problem. Annals of Operations Research 86:441-453.
13. Mezard, M. and Parisi, G. 1986. A replica analysis of the traveling salesman problem. Journal de Physique 47:1285- 1296.
14. Monasson, R.; Zecchina, R.; Kirkpatrick, S.; Selman, B.; and Troyansky, L. 1999. Determining computational complexity from characteristic 'phase transitions'. Nature 400:133-137.
15. Nowicki, E. and Smutnicki, C. 1996. A fast taboo search algorithm for the job-shop problem. Management Science 42(6):797-813.
16. Nowicki, E. and Smutnicki, C. 2001. Some new ideas in TS for job shop scheduling. Technical Report 50/2001, University of Wroclaw.
17. Nowicki, E. and Smutnicki, C. 2002. Some new tools to solve the job shop problem. Technical Report 60/2002, University of Wroclaw.
18. Reeves, C. R. and Yamada, T. 1998. Genetic algorithms, path relinking, and the flowshop sequencing problem. Evolutionary Computation 6:45-60.
19. Roy, B. and Sussmann, B. 1964. Les problemes dordon- nancement avec contraintes disjonctives. Note D.S. no. 9 bis, SEMA, Paris, France, Decembre.
20. Slaney, J. and Walsh, T. 2001. Backbones in optimization and approximation. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI- 200J), 254-259.
21. Streeter, M. J. and Smith, S. F. 2005. Supplemental material for ICAPS 2005 paper 'Characterizing the distribution of low-makespan schedules in the job shop scheduling problem', http://www.cs.emu.edu/~matts/icaps-2005.
22. Taillard, E. 1994. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6:108-117.
23. van Laarhoven, P.; Aarts, E. and Lenstra, J. 1992. Job shop scheduling by simulated annealing. Operations Research 40(1): 113-125.
24. Watson, J.-P.; Beck, J. C.; Howe, A. E.; and Whitley, L. D. 2001. Toward an understanding of local search cost in job- shop scheduling. In Cesta, A., ed., Proceedings of the Sixth European Conference on Planning.
25. Watson, J.-P; Barbulescu, L.; Whitley, L. D. and Howe, A. 2002. Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance. INFORMS Journal on Computing 14(2):98-123.