Incremental maximum flows for fast envelope computation

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

Volumn , Issue , 2004, Pages 260-268

  Muscettola, Nicola ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENVELOP ALGORITHM; RESOURCE ENVELOPES; SCHEDULING HEURISTICS;

ALGORITHMS; COMPUTATION THEORY; CONSTRAINT THEORY; HEURISTIC METHODS; PLANNING;

SCHEDULING;

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

References (9)

1. R.K. Ahuja, T.L. Magnati, J.N. Orlin, 1993. Network Flows, Prentice Hall, NJ.
2. R.K. Ahuja, M. Kodialam, A.K. Mishra, J.B. Orlin, 1997. Computational Investigations of Maximum Flow Algorithms, European Journal of OR, Vol 97(3).
3. T.H. Cormen, C.E. Leiserson, R.L. Rivest, 1990. Introduction to Algorithms. Cambridge, MA.
4. A.V. Goldberg, R.E. Tarjan, 1988. A New Approach to the Maximum-Flow Problem. JACM, Vol. 35(4).
5. T.K.S. Kumar, 2003. Incremental Computation of Resource-Envelopes in Producer-Consumer Models, Procs. of CP2003, Kinsale, Ireland.
6. P. Laborie, 2001. Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results, Procs. ECP 2001, Spain.
7. P. Morris, N. Muscettola, T. Vidai, 2001. Dynamic Control of Plans with Temporal Uncertainty, in Procs. of IJCAI 2001, Seattle, WA.
8. N. Muscettola, 2002. Computing the Envelope for Stepwise-Constant Resource Allocations, Procs. of CP2002, Ithaca, NY.
9. N. Pollicella, S.F. Smith, A. Cesta, A. Oddi, 2003. Steps toward Computing Flexible Schedules, Procs. of Online-2003 Workshop at CP 2003, Kinsale, Ireland, http://www.cs.ucc.ie/~kb11/CP2003Online/onlineProceedings.pdf