Iterative relaxations for iterative flattening in cumulative scheduling

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 200-208

  Michel, Laurent ^a   Van Hentenryck, Pascal ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; ITERATIVE FLATTENING ALGORITHM (IFLAT); ITERATIVE RELAXATIONS;

BENCHMARKING; COMPUTATIONAL METHODS; CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS;

SCHEDULING;

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

References (11)

1. Cesta, A.; Oddi, A.; and Smith, S. F. 1999a. Greedy algorithms for the multi-capacitated metric scheduling problem. In ECP, 213-225.
2. Cesta, A.; Oddi, A.; and Smith, S. R 1999b. An iterative sampling procedure for resource constrained project scheduling with time windows. In IJCAI, 1022-1033.
3. Cesta, A.; Oddi, A.; and Smith, S. F. 2000. Iterative flattening: A scalable method for solving multi-capacity scheduling problems. In AAAI/IAAI, 742-747.
4. Feo, T., and Resende, M. 1995. Greedy randomized adaptive search procedures.
5. Laborie, P., and Ghallab, M. 1995. Planning with sharable resource constraints. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, 1643-1649.
6. Michel, L., and Van Hentenryck, P. 2002. A constraint-based architecture for local search. In Conference on Object-Oriented Programming Systems, Languages, and Applications., 101-110. Seattle, WA, USA: ACM.
7. Michel, L., and Van Hentenryck, P. 2003. Maintaining Longest Paths Incrementally. In CP'03.
8. Nuijten, W. P. M., and Aarts, E. H. L. 1996. A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research 90(2):269-284.
9. Nuijten, W. 1994. Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach. Ph.D. Dissertation, Eindhoven University of Technology.
10. Oddi, A., and Smith, S. F. 1997. Stochastic procedures for generating feasible schedules. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97), 308-314. Providence, Rhode Island: AAAI Press / MIT Press.
11. Van Hentenryck, P., and Michel, L. 2003. Control Abstraction for Local Search. In CP'03.