Combining constraint programming and local search for job-shop scheduling

INFORMS Journal on Computing

Volumn 23, Issue 1, 2011, Pages 1-14

  Beck, J Christopher ^a   Feng, T K ^b   Watson, Jean Paul ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Constraint programming; Hybrid algorithms; Scheduling; Tabu search

Indexed keywords

EID: 79952436408     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0388     Document Type: Article

References (36)

1. Balas, E., A. Vazacopoulos. 1998. Guided local search with shifting bottleneck for job shop scheduling. Management Sci. 44(2) 262-275. (Pubitemid 128596865)
2. Baptiste, P., C. Le Pape, W. Nuijten. 2001. Constraint-Based Scheduling. Kluwer Academic Publishers, Norwell, MA.
3. Beck, J. C. 2007. Solution-guided multi-point constructive search for job shop scheduling. J. Artificial Intelligence Res. 29(1) 49-77. (Pubitemid 47477589)
4. Beck, J. C., M. S. Fox. 2000. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence 117(1) 31-81. (Pubitemid 30552008)
5. Blazewicz, J., W. Domschke, E. Pesch. 1996. The job shop scheduling problem: Conventional and new solution techniques. Eur. J. Oper. Res. 93(1) 1-33. (Pubitemid 126389264)
6. Boyan, J., A. W. Moore. 2000. Learning evaluation functions to improve optimization by local search. J. Machine Learn. Res. 1(September) 77-112.
7. Carchrae, T., J. C. Beck. 2005. Applying machine learning to lowknowledge control of optimization algorithms. Comput. Intelligence 21(4) 372-387. (Pubitemid 43906942)
8. Cohen, P. R. 1995. Empirical Methods for Artificial Intelligence. MIT Press, Cambridge, MA.
9. Garey, M. R., D. S. Johnson, R. Sethi. 1976. The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2) 117-129.
10. Glover, F., M. Laguna, R. Martí. 2003. Scatter search and path relinking: Advances and applications. F. Glover, G. A. Kochenberger, eds. Handbook of Metaheuristics, Vol. 57. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1-35.
11. Gomes, C. P., C. Fernández, B. Selman, C. Bessiére. 2005. Statistical regimes across constrainedness regions. Constraints 10(4) 317-337. (Pubitemid 41521312)
12. Hooker, J. N. 1996. Testing heuristics: We have it all wrong. J. Heuristics 1 33-42.
13. Horvitz, E., Y. Ruan, C. P. Gomes, H. A. Kautz, B. Selman, D. M. Chickering. 2001. A Bayesian approach to tackling hard computational problems. Proc. 17th Conf. Uncertainty Artificial Intelligence-UAI-2001-, Morgan Kaufmann, San Francisco, 235-244.
14. Laborie, P. 2003. Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence 143(2) 151-188.
15. Lagoudakis, M. G., M. L. Littman. 2000. Algorithm selection using reinforcement learning. Proc. 17th Internat. Conf. Machine Learning, Morgan Kaufmann, San Francisco, 511-518.
16. Le Pape, C. 1994. Implementation of resource constraints in ILOG SCHEDULE: A library for the development of constraint-based scheduling systems. Intelligent Systems Engrg. 3(2) 55-66.
17. Leyton-Brown, K., E. Nudelman, Y. Shoham. 2002. Learning the empirical hardness of optimization problems: The case of combinatorial auctions. P. Van Hentenryck, ed. Proc. 8th Internat. Conf. Principles Practice Constraint Programming-CP 2002-. Lecture Notes in Computer Science, Vol. 2470. Springer, Berlin, 91-100.
18. Luby, M., A. Sinclair, D. Zuckerman. 1993. Optimal speedup of Las Vegas algorithms. Inform. Processing Lett. 47(4) 173-180.
19. Minton, S. 1996. Automatically configuring constraint satisfaction programs: A case study. Constraints 1(1-2) 7-43. (Pubitemid 126709714)
20. Nowicki, E., C. Smutnicki. 1996. A fast taboo search algorithm for the job shop problem. Management Sci. 42(6) 797-813. (Pubitemid 126577322)
21. Nowicki, E., C. Smutnicki. 2005. An advanced tabu algorithm for the job shop problem. J. Scheduling 8(2) 145-159. (Pubitemid 40536998)
22. Nuijten, W. P. M. 1994. Time and resource constrained scheduling: A constraint satisfaction approach. Ph.D. thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
23. R Development Core Team. 2009. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna. http://www.R-project.org.
24. Rice, J. R. 1976. The algorithm selection problem. Adv. Comput. 15 65-118.
25. Scheduler. 2007. ILOG Scheduler 6.5 user's manual and reference manual. IBM ILOG, Armonk, NY.
26. Smith, S. F., C.-C. Cheng. 1993. Slack-based heuristics for constraint satisfaction scheduling. Proc. 11th National Conf. Artificial Intelligence(AAAI-93), AAAI, Washington, DC, 139-144.
27. Sutton, R. S., A. G. Barto. 1998. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA.
28. Taillard, É. D. 1989. Parallel taboo search technique for the jobshop scheduling problem. Technical Report ORWP 89/11, DMA, Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland.
29. Taillard, É. D. 2008. Éric Taillard's page. http://mistic.heig-vd.ch/ staillard/problemes.dir/ordonnancement.dir/ ordonnancement.html.
30. Taillard, E. D. 1993. Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2) 278-285.
31. Watson, J.-P. 2003. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem. Ph.D. thesis, Department of Computer Science, Colorado State University, Fort Collins.
32. Watson, J.-P. 2005. On metaheuristic "failure modes": A case study in tabu search for job-shop scheduling. Proc. 6th Metaheuristics Internat. Conf., Vienna.
33. Watson, J.-P., J. C. Beck. 2008. A hybrid constraint programming/ local search approach to the job shop scheduling problem. L. Perron, M. A. Trick, eds. Proc. 5th Internat. Conf. Integration AI OR Techniques Constraint Programming Combin. Optim. Problems(CPAIOR'08). Lecture Notes in Computer Science, Vol. 5015. Springer, Berlin, 263-277. (Pubitemid 351777384)
34. Watson, J.-P., A. E. Howe, L. D. Whitley. 2006. Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem. Comput. Oper. Res. 33(9) 2623-2644. (Pubitemid 43102511)
35. Wu, H., P. van Beek. 2007. On universal restart strategies for backtracking search. C. Bessiene, ed. Proc. 13th Internat. Conf. Principles Practice Constraint Programming. Lecture Notes in Computer Science, Vol. 4741. Springer, Berlin, 681-695.
36. Zhang, C. Y., P. Li, Y. Rao, Z. Guan. 2008. A very fast TS/SA algorithm for the job shop scheduling problem. Comput. Oper. Res. 35(1) 282-294. (Pubitemid 46899361)