Randomized large neighborhood search for cumulative scheduling

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 81-89

  Godard, Daniel ^a   Laborie, Philippe ^a   Nuijten, Wim ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING; CONSTRAINT-BASED; EARLINESS/TARDINESS; EMPIRICAL PERFORMANCE ANALYSIS; JOB SHOP SCHEDULING PROBLEMS; LARGE NEIGHBORHOOD SEARCH; SCHEDULING PROBLEM; TIME SCHEDULES;

BENCHMARKING; COMPUTER PROGRAMMING; CONSTRAINT THEORY; NUMBER THEORY; SCHEDULING;

PROBLEM SOLVING;

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

References (18)

1. Applegate, D. and Cook, W. 1991. A computational study of the job-shop scheduling problem. ORSA Journal on Computing 3(2): 149-156.
2. Baptiste, P.; Le Pape, C. and Nuijten, W. 1999. Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research 92:305-333.
3. Cesta, A.; Oddi, A. and Smith, S. 2000. Iterative flattening: A scalable method for solving multi-capacity scheduling problems. In Proceedings of the National Conference on Artificial Intelligence (AAAI-00).
4. French, S. 1982. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Wiley & Sons. ILOG. 2005a. ILOG Scheduler 6.1 Reference Manual. http://www.ilog.com/.
5. ILOG. 2005b. ILOG Solver 6.1 Reference Manual. http://www.ilog.com/.
6. Laborie, P. 2003. Resource Temporal Networks: Definition and Complexity. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03).
7. Laborie, P. 2005. Complete MCS-Based Search: Application to Resource Constrained Project Scheduling. In Technical report ILOG-05-001.
8. Le Pape, C.; Couronne, P.; Vergamini, D. and Gosselin, V. 1994. Time-versus-capacity compromises in project scheduling. In Proceedings of the Thirteenth Workshop of the U.K. Planning Special Interest Group.
9. Le Pape, C. 1994. Implementation of resource constraints in ilog schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering 3(2):55-66.
10. Li, K. and Willis, R. 1992. An iterative scheduling technique for resource-constrained project scheduling. European Journal of Operational Research 56:370-379.
11. Michel, L. and Van Hentenryck, R 2003. Maintaining longest paths incrementally. In Proceedings of the International Conference on Constraint Programming (CP-03).
12. Michel, L. and Van Hentenryck, R 2004. Iterative relaxations for iterative flattening in cumulative scheduling. In Proceedings of the 14Th International Conference on Automated Planning & Scheduling (ICAPS-04).
13. Nuijten, W. and Le Pape, C. 1998. Constraint-based job shop scheduling with ILOG SCHEDULER. Journal of Heuristics 3:271-286.
14. Nuijten, W. 1994. Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach. Ph.D. Dissertation, Eindhoven University of Technology.
15. Nuijten, W. and Aarts, E. 1996. A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research 90(2):269-284.
16. Palpant, M.; Artigues, C.; and Michelon, P. 2004. LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search. Annals of Operations Research 31(1 ):237-257.
17. Policella, N.; Cesta, A.; Oddi, A. and Smith, S. 2004. Generating robust schedules through temporal flexibility. In Proceedings of the 14th International Conference on Automated Planning and Scheduling (/CAPS 04).
18. Shaw, P. 1998. Using constraint programming and local search methods to solve vehicle routing problems. In Proceeding CP98.