Extending systematic local search for job shop scheduling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3709 LNCS, Issue , 2005, Pages 762-766

  Dilkina, Bistra ^a   Duan, Lei ^a   Havens, William S ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646171328     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_60     Document Type: Conference Paper

References (8)

1. Faruk Geyik and Ismail Hakki Cedimoglu. The strategies and parameters of tabu search for job-shop scheduling. Journal of Intelligent Manufacturing, 15(4):439-448, 2004.
2. M. L. Ginsberg and D. A. McAllester. GSAT and Dynamic Backtracking. In P. Torasso, J. Doyle, and E. Sandewall, editors, The 4th International Conference on Principles of Knowledge Representation and Reasoning, pages 226-237. Morgan Kaufmann, 1994.
3. William S. Havens and Bistra N. Dilkina. A Hybrid Schema for Systematic Local Search. In Canadian Conference on Artifical Intelligence 2004, 2004.
4. Narendra Jussien and Olivier Lhomme. Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139(1):21-45, July 2002.
5. Peter J. M. Van Laarhoven, Emile H. L. Aarts, and Jan Karel Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research, 50(1):113-125, 1992.
6. I. Lynce and J. Marques-Silva. Complete unrestricted backtracking algorithms for satisfiability. In The 5th International Symposium on the Theory and Applications of Satisfiability Testing, 2002.
7. Eugeniusz Nowicki and Czeslaw Smutnicki. A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science, 42(6):797-813, 1996.
8. Ferdinando Pezzella and Emanuela Merelli. A tabu search method guided by shifting bottleneck for the job shop scheduling problem. European Journal of Operational Research, 120:297-310, 2000.