How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines

Journal of Artificial Intelligence Research

Volumn 26, Issue , 2006, Pages 247-287

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

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; OPERATIONS RESEARCH; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING;

BACKBONE SIZE; JOB SHOP SCHEDULING; NEAR-OPTIMAL SCHEDULES;

RESOURCE ALLOCATION;

EID: 33749000606     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2013     Document Type: Article

References (43)

1. 2 - O(k). Journal of the AMS, 17, 947-973.
2. Balas, E. (1969). Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Operations Research, 17, 1-10.
3. Beasley, J. E. (1990). OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069-1072.
4. Beck, J. C., &: Jackson, W. K. (1997). Constrainedness and the phase transition in job shop scheduling. Tech. rep. CMPT97-21, School of Computing Science, Simon Fraser University.
5. Boese, K. D., Kahng, A. B., & Muddu, S. (1994). A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters, 16, 101-113.
6. Brucker, P., Jurisch, B., &: Sievers, B. (1992). Job-shop (C-codes). European Journal of Operational Research, 57, 132-133. Code available at http://Optimierung. mathematik.uni-kl.de/ORSEP/contents.html.
7. Brucker, P., Jurisch, B., &: Sievers, B. (1994). A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49(1-3), 107-127.
8. Cheeseman, P., Kanefsky, B., & Taylor, W. M. (1991). Where the really hard problems are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91, Sidney, Australia, pp. 331-337.
9. Fisher, H., & Thompson, G. L. (1963). Probabilistic learning combinations of local job-shop scheduling rules. In Muth, J. F., & Thompson, G. L. (Eds.), Industrial Scheduling, pp. 225-251. Prentice-Hall, Englewood Cliffs, NJ.
10. Framinan, J. M., Gupta, J. N. D., & Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 55(12), 1243-1255.
11. French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Wiley, New York.
12. Glover, F., & Laguna, M. (1997). Tabu Search. Kluwer Academic Publishers, Boston, MA.
13. Hejazi, S. R., & Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research, 43(14), 2895-2929.
14. Hoos, H. H., & Stützte, T. (2000). SATLIB: An online resource for research on SAT. In Gent, I. P., v. Maaren, H., & Walsh, T. (Eds.), Proceedings of SAT 2000, pp. 283-292. SATLIB is available online at www.satlib.org.
15. Jain, A., &: Meeran, S. (1998). A state-of-the-art review of job-shop scheduling techniques. Tech. rep., Department of Applied Physics, Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland.
16. Jones, A., & Rabelo, L. C. (1998). Survey of job shop scheduling techniques. Tech. rep., National Institute of Standards and Technology, Gaithersburg, MD.
17. Kim, Y.-H., & Moon, B.-R. (2004). Investigation of the fitness landscapes in graph bipartitioning: An empirical study. Journal of Heuristics, 10, 111-133.
18. Lourenco, H., Martin, O., & Stützte, T. (2003). Iterated local search. In Glover, F., & Kochenberger, G. (Eds.), Handbook of Metaheuristics. Kluwer Academic Publishers, Boston, MA.
19. Mammen, D. L., &: Hogg, T. (1997). A new look at the easy-hard-easy pattern of combinatorial search difficulty. Journal of Artificial Intelligence Research, 7, 47-66.
20. Martin, O. C., Otto, S. W., & Felten, E. W. (1991). Large-step Markov chains for the traveling salesman problem. Complex Systems, 5, 299-326.
21. Martin, O. C., Monasson, R., & Zecchina, R. (2001). Statistical mechanics methods and phase transitions in combinatorial problems. Theoretical Computer Science, 265(1-2), 3-67.
22. Mattfeld, D. C. (1996). Evolutionary Search and the Job Shop: Investigations on Genetic Algorithms for Production Scheduling. Physica-Verlag, Heidelberg.
23. Mattfeld, D. C., Bierwirth, C., & Kopfer, H. (1999). A search space analysis of the job shop scheduling problem. Annals of Operations Research, 86, 441-453.
24. Mézard, M., & Parisi, G. (1986). A replica analysis of the traveling salesman problem. Journal de Physique, 47, 1285-1296.
25. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., & Troyansky, L. (1999). Determining computational complexity from characteristic 'phase transitions'. Nature, 400, 133-137.
26. Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job-shop problem. Management Science, 42(6), 797-813.
27. Nowicki, E., & Smutnicki, C. (2001). Some new ideas in TS for job shop scheduling. Tech. rep. 50/2001, University of Wroclaw.
28. Nowicki, E., &: Smutnicki, C. (2005). An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8, 145-159.
29. Reeves, C. R., & Yamada, T. (1998). Genetic algorithms, path relinking, and the flowshop sequencing problem. Evolutionary Computation, 6, 45-60.
30. Roy, B., & Sussmann, B. (1964). Les problèmes dordonnancement avec contraintes disjunctives. Note D.S. no. 9 bis, SEMA, Paris, France, Décembre.
31. Selman, B., Kautz, H., & Cohen, B. (1994). Noise strategies for local search. In Proceedings of AAAI-94, pp. 337-343.
32. Slaney, J., & Walsh, T. (2001). Backbones in optimization and approximation. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-2001), pp. 254-259.
33. Spencer, J. (2005). Modern probabilistic methods in combinatorics, http://www.cs.nyu. edu/cs/faculty/spencer/papers/stirlingtalk.pdf.
34. Streeter, M. J., & Smith, S. F. (2005a). Characterizing the distribution of low-makespan schedules in the job shop scheduling problem. In Biundo, S., Myers, K., & Rajan, K. (Eds.), Proceedings of ICAPS 2005, pp. 61-70.
35. Streeter, M. J., & Smith, S. F. (2005b). Supplemental material for ICAPS 2005 paper 'Characterizing the distribution of low-makespan schedules in the job shop scheduling problem', http://www.cs.cmu.edu/~matts/icaps_2005.
36. Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285.
37. Taillard, E. (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing, 6, 108-117.
38. van Laarhoven, P., Aarts, E., & Lenstra, J. (1992). Job shop scheduling by simulated annealing. Operations Research, 40(1), 113-125.
39. Watson, J.-P., Barbulescu, L., Whitley, L. D., & 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.
40. Watson, J.-P., Beck, J. C., Howe, A. E., & 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.
41. Yokoo, M. (1997). Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs. In Principles and Practice of Constraint Programming, pp. 356-370.
42. Zhang, W. (2004). Configuartion landscape analysis and backbone guided local search: Part I: Satisfiability and maximum satisfiability. Artificial Intelligence, 158(1), 1-26.
43. th International Joint Conference on Artificial Intelligence, pp. 343-350.