Bounding the resource availability of activities with linear resource impact

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 136-143

  Frank, Jeremy ^a   Morris, Paul H ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING;

LOCAL MAXIMUM; LOCAL MINIMUMS; LOW BOUND; MAXIMUM FLOWS; PRODUCTION AND CONSUMPTION; RESOURCE AVAILABILITY; TEMPORAL CONSTRAINTS; TEMPORAL NETWORKS; TIGHT BOUND; UPPER BOUND;

POLYNOMIAL APPROXIMATION;

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

References (10)

1. Ahuja, R.; Magnanti, T.; and Orlin, J. 1993. Network Flows. Prentice Hall.
2. Cheng, C., and Smith, S. 1995. A constraint posting framework for scheduling under complex constraints. In Joint IEEE/INRIA conference on Emerging Technologies for Factory Automation.
3. Cormen, T.; Leiserson, C.; Rivest, R.; and Stein, C. 2001. Introduction to Algorithms. MIT Press. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49:61-94.
4. th International Conference on the Principles and Practices of Constraint Programming. Jónsson, A.; Morris, P.; Muscettola, N.; Rajan, K.; and Smith, B. 2000. Planning in interplanetary space: Theory and practice. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling.
5. Laborie, P. 2003a. Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence 143:151-188.
6. th International Joint Conference on Artificial Intelligence, 948-953.
7. th National Conference on Artificial Intelligence.
8. th International Conference on the Principles and Practices of Constraint Programming.
9. th International Conference on Automated Planning and Scheduling.
10. th International Conference on Automated Planning and Scheduling.