Generating robust schedules through temporal flexibility

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

Volumn , Issue , 2004, Pages 209-218

  Policella, Nicola ^a   Smith, Stephen F ^b   Cesta, Amedeo ^a   Oddi, Angelo ^a  

^a INSTITUTE OF COGNITIVE SCIENCES AND TECHNOLOGIES   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATION THEORY; CONSTRAINT THEORY; DECISION MAKING; ITERATIVE METHODS;

PARTIAL ORDER SCHEDULES (POS); PRECEDENCE CONSTRAINT POSTING (PCP); SIMPLE TEMPORAL PROBLEM (STP);

SCHEDULING;

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

References (16)

1. st Multidisciplinary International Conference on Scheduling: Theory and Applications, MISTA 2003, 337-362.
2. Bartusch, M.; Mohring, R. H.; and Radermacher, F. J. 1988. Scheduling project networks with resource constraints and time windows. Annals of Operations Research 16:201-240.
3. th International Conference on Artificial Intelligence Planning Systems AIPS-98, 241-223. AAAI Press.
4. Cesta, A.; Oddi, A.; and Smith, S. F. 2002. A Constraint-based method for Project Scheduling with Time Windows. Journal of Heuristics 8(1):109-136.
5. th European Conference on Planning, ECP-01.
6. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal Constraint Networks. Artificial Intelligence 49:61-95.
7. th National Conference on Artificial Intelligence, AAAI-94, 1098-1104. AAAI Press.
8. El Sakkout, H., and Wallace, M. Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling. Constraints.
9. Goldberg, A. V., and Tarjan, R. E. 1988. A New Approach to the Maximum Flow Problem. Journal of the Association for Computing Machinery 35(4):921-940.
10. Kolisch, R.; Schwindt, C.; and Sprecher, A. 1998. Benchmark Instances for Project Scheduling Problems. In Weglarz, J., ed., Project Scheduling - Recent Models, Algorithms and Applications. Boston: Kluwer. 197-212.
11. th International Joint Conference on Artificial Intelligence, IJCAI-95, 1643-1649.
12. th International Conference, CP 2002, volume 2470 of Lecture Notes in Computer Science, 139-154. Springer.
13. Policella, N.; Smith, S. F.; Cesta, A.; and Oddi, A. 2003. Steps toward Computing Flexible Schedules. In Proceedings of Online-2003: Workshop on "Online Constraint Solving: Handling Change and Uncertainty", Kinsale, Co. Cork, Ireland.
14. th International Conference, CP 2003, volume 2833 of Lecture Notes in Computer Science, 664-678. Springer.
15. th National Conference on Artificial Intelligence, AAAI-93, 139-144. AAAI Press.
16. Smith, S. F. 1994. OPIS: A Methodology and Architecture for Reactive Scheduling. In Fox, M., and Zweben, M., eds., Intelligent Scheduling. Morgan Kaufmann. 29-66.