Scheduling abstractions for local search

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

Volumn 3011, Issue , 2004, Pages 319-334

  Van Hentenryck, Pascal ^a   Michel, Laurent ^b  

^a BROWN UNIVERSITY   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; JOB SHOP SCHEDULING; LOCAL SEARCH (OPTIMIZATION); OBJECT ORIENTED PROGRAMMING; OPTIMIZATION; SCHEDULING;

COMPUTATION STEPS; COMPUTATIONAL MODEL; CONSTRAINT-BASED; CONTROL STRUCTURE; HIGH-LEVEL MODELING; OBJECTIVE FUNCTIONS; PRECEDENCE GRAPH; TOTAL-WEIGHTED TARDINESS;

SCHEDULING ALGORITHMS;

EID: 26444520724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_22     Document Type: Article

References (21)

1. A. Cesta, A. Oddi, and S. F. Smith. Iterative flattening: A scalable method for solving multi-capacity scheduling problems. In AAAI/IAAI, pages 742-747, 2000.
2. L. Di Gaspero and A. Schaerf. Optimization Software Class Libraries, chapter Writing Local Search Algorithms Using EasyLocal++. Kluwer, 2002.
3. W. Kreipl. A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling, 3:125-138, 2000.
4. P. Laborie. Algorithms for propagating resource constraints in ai planning and scheduling: Existing approaches and new results. AIJ, 143(2):151-188, 2003.
5. F. Laburthe and Y. Caseau. SALSA: A Language for Search Algorithms. In CP'98, Pisa, Italy, October 1998.
6. M. Dell'Amico and M. Trubian. Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research, 41:231-252, 1993.
7. M. Mastrolilli and L. Gambardella. Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling, 3(1):3-20, 2000.
8. L. Michel and P. Van Hentenryck. Localizer. Constraints, 5:41-82, 2000.
9. L. Michel and P. Van Hentenryck. A constraint-based architecture for local search. In OOPSLA'00, Seattle, WA, 2002.
10. L. Michel and P. Van Hentenryck. Maintaining longest path incrementally. In CP'03, Cork, Ireland, 2003.
11. L. Michel and P. Van Hentenryck. Iterative relaxations for iterative flattening in cumulative scheduling. In ICAPS'04, Whistler, BC, Canada, 2004.
12. E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job shop problem. Management Science, 42(6):797-813, 1996.
13. W. Nuijten and C. Le Pape. Constraint-based job shop scheduling with ilog scheduler. Journal of Heuristics, 3:271-286, 1998.
14. W. P. M. Nuijten and E. H. L. Aarts. A computational study of constraint satisfaction for multiple capacitated job shop scheduling. EJOR, 90(2):269-284, 1996.
15. P. Shaw, B. De Backer, and V. Furnon. Improved local search for CP toolkits. Annals of Operations Research, 115:31-50, 2002.
16. M. Singer and M. Pinedo. A computational study of branch and bound techniques for minimizing the totalweighted tardiness in job shops. IIE Scheduling and Logistics, 30:109-118, 1997.
17. M. Singer and M. Pinedo. A shifting bottleneck heuristic for minimizing the totalweighted tardiness in job shops. Naval Research Logistics, 46(1):1-17, 1999.
18. P. Van Hentenryck and L. Michel. Control abstractions for local search. In CP'03, Cork, Ireland, 2003. (Best Paper Award).
19. S. Voss and D. Woodruff. Optimization Software Class Libraries. Kluwer, 2002.
20. J. Walser. Integer Optimization by Local Search. Springer Verlag, 1998.
21. F. Werner and A. Winkler. Insertion Techniques for the Heuristic Solution of the Job Shop Problem. TR, Technical Universitaet Magdebourg, 1992.