Computing the envelope for stepwise-constant resource allocations

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

Volumn 2470, Issue , 2002, Pages 139-154

  Muscettola, Nicola ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

FLOW NETWORK; FLOW PROBLEMS; INNER LOOPS; MAXIMUM FLOW PROBLEMS; RESOURCE ENVELOPES; RESOURCE LEVELS; TEMPORAL NETWORKS;

SCHEDULING ALGORITHMS;

EID: 84957002656     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_10     Document Type: Conference Paper

References (15)

1. R.K. Ahuja, M. Kodialam, A.K. Mishra, J.B. Orlin. Computational Investigations of Maximum Flow Algorithms, European Journal of Operational Re- search, Vol 97(3), 1997.
2. K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, New York, 1974.
3. J.C. Beck, A.J. Davenport, E.D. Davis, M.S. Fox. Beyond Contention: Extending Texture-Based Scheduling Heuristics. in Proceedings of AAAI 1997, Providence, RI, 1997.
4. A. Cesta, A. Oddi, S.F. Smith, A Constraint-Based Method for Resource Constrained Project Scheduling with Time Windows, CMU RI Technical Report, February 2000.
5. A. Cesta, C. Stella. A time and Resource Problem for Planning Architectures. Proceedings of the 4th European Conference on Planning (ECP 97). Toulouse, France, 1997.
6. H. S.F. Cooper., The Loneliness of the Long-Duration Astronaut, Air & Space/Smithsonian, June/July 1996, available at http://www.airspacemag.com/ASM/Mag/Index/1996/JJ/llda.html
7. T.H. Cormen, C.E. Leiserson, R.L. Rivest. Introduction to Algorithms. Cambridge, MA, 1990.
8. R. Dechter, I. Meiri, J. Pearl. Temporal Constraint Networks. Artificial Intelli- gence, 49:61-95, May 1991.
9. A.V. Goldberg, R.E. Tarjan. A New Approach to the Maximum-Flow Problem. Journal of the ACM, Vol. 35(4), 1988.
10. P. Laborie, Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results, Proceedings of ECP 2001, Toledo, Spain, 2001.
11. P. Morris, N. Muscettola, T. Vidal. Dynamic Control of Plans with Temporal Uncertainty, in Proceedings of IJCAI 2001, Seattle, WA, 2001
12. N. Muscettola. On the Utility of Bottleneck Reasoning for Scheduling. in Pro- ceedings of AAAI 1994, Seattle, WA, 1994.
13. W.P.M. Nuijten. Time and Resource Constrained Scheduling: a Constraint Satisfaction Approach. PhD Thesis, Eindhoven University of Technology, 1994.
14. N. Sadeh. Look-ahead techniques for micro-opportunistic job-shop scheduling. PhD Thesis, Carnegie Mellon University, CMU-CS-91-102, 1991.
15. M. Zweben, M.S. Fox. Intelligent Scheduling. Morgan Kaufmann, San Francisco, 1994.