Exploiting the power of local search in a branch and bound algorithm for job shop scheduling

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 324-332

  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

ITERATED LOCAL SEARCH ALGORITHMS; JOB SHOP SCHEDULING; PERFORMANCE GAINS; VARIABLE-SELECTION HEURISTICS;

ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PERFORMANCE; RANDOM PROCESSES;

SCHEDULING;

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

References (26)

1. Adams, J.; Balas, E.; and Zawack, D. 1988. The shifting bottleneck procedure for job shop scheduling. Management Science 34(3):391-401.
2. Brinkkötter, W., and Brucker, P. 2001. Solving open instances for the job-shop problem by parallel head-tail adjustments. Journal of Scheduling 4:53-64.
3. Brucker, P.; Jurisch, B.; and 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.
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. Büdenbender, K.; Grünen, T.; and Sebastian, H.-J. 2000. A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem. Transportation Science 34(4):364-380.
6. Dilkina, B.; Duan, L.; and Havens, W. 2005. Extending Systematic Local Search for Job Shop Scheduling Problems. In Eleventh International Conference on Principles and Practice of Constraint Programming.
7. Fang, H., and Ruml, W. 2004. Complete local search for propositional satisfiability. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI-04), 161-166.
8. 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.
9. Focacci, F.; Laburthe, F.; and Lodi, A. 2003. Local search and constraint programming. In Glover, F., and Kochen-berger, G. A., eds., Handbook of Metaheuristics. Boston, MA: Kluwer. 369-404.
10. Ginsberg, M. L., and McAllester, D. A. 1994. GSAT and Dynamic Backtracking. In Torasso, P.; Doyle, J.; and Sandewall, E., eds., Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, 226-237. Morgan Kaufmann.
11. Ginsberg, M. L. 1993. Dynamic backtracking. Journal of Artificial Intelligence Research 1:25-46.
12. Gomes, C. 2003. Complete randomized backtrack search. In Milano, M., ed., Constraint and Integer Programming: Toward a Unified Methodology. Boston, MA: Kluwer. 233-283.
13. Harvey, W. D., and Ginsberg, M. L. 1995. Limited discrepancy search. In Mellish, C. S., ed., Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95); Vol. 1, 607-615. Montréal, Québec, Canada: Morgan Kaufmann, 1995.
14. Kamarainen, O., and Sakkout, H. E. 2002. Local probing applied to scheduling. In Principles and Practice of Constraint Programming, 155-171.
15. 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.
16. Nareyek, A.; Smith, S.; and Ohler, C. 2003. Integrating local search advice into a refinment search solver (or not). In Proceedings of the CP-03 Workshop on Cooperative Constraint Problem Solvers, 29-43.
17. Nowicki, E., and Smutnicki, C. 2001. Some new ideas in TS for job shop scheduling. Technical Report 50/2001, University of Wroclaw.
18. Prestwich, S. 2002. Combining the scalability of local search with the pruning techniques of systematic search. Annals of Operations Research 115:51-72.
19. Roy, B., and Sussmann, B. 1964. Les problèmes dordonnancement avec contraintes disjunctives. Note D.S. no. 9 bis, SEMA, Paris, France, Décembre.
20. Streeter, M. J., and Smith, S. F. 2005. Characterizing the distribution of low-makespan schedules in the job shop scheduling problem. In Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 61-70.
21. Taillard, E. 1994. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6:108-117.
22. van Laarhoven, P.; Aarts, E.; and Lenstra, J. 1992. Job shop scheduling by simulated annealing. Operations Research 40(1):113-125.
23. Walsh, T. 1997. Depth-bounded discrepancy search. In IJCAI, 1388-1395.
24. Watson, J.-P.; Howe, A. E.; and Whitley, L. D. 2003a. An analysis of iterated local search for job shop scheduling. In Proceedings of the Fifth Metaheuristics International Conference.
25. Watson, J.-P.; Whitley, L. D.; and Howe, A. E. 2003b. A dynamic model of tabu search for the job shop scheduling problem. In Multidisciplinary International Conference on Scheduling.
26. Zhang, J., and Zhang, H. 1996. Combining local search and backtracking techniques for constraint satisfaction. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI 1996), 369-374.