Resource temporal networks: Definition and complexity

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 948-953

  Laborie, Philippe ^a  

^a IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY RESOURCES; CONSTRAINT NETWORKS; EXPRESSIVE POWER; FORMAL DEFINITION; NP COMPLETE; TEMPORAL NETWORKS;

ARTIFICIAL INTELLIGENCE;

COMPLEX NETWORKS;

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

References (18)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, 1993.
2. D. Chapman. Planning for Conjunctive Goals. Artificial Intelligence, 32:333-377, 1987.
3. L. Finta and Z. Liu. Single Machine Scheduling Subject to Precedence Delays. Discrete Applied Mathematics, 70:247-266, 1996. (Pubitemid 126399091)
4. M. Fox and D. Long. PDDL2.1 : An Extension to PDDL for Expressing Temporal Planning Domains, Feb. 2002.
5. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
6. A. Gcrevini and M. Cristani. On finding a solution in temporal constraint satisfaction problems. In Proc. IJCAI97, pages 1460-1465, 1997.
7. M. Ghallab and H. Laruelle. Representation and Control in IxTeT, a Temporal Planner. In Proc. AIPS-94, pages 61-67, 1994.
8. M.C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, New York, 1980.
9. H. Groflin. On Node Constraint Networks. Networks, 15:469-475, 1985.
10. M. Helmert. Decidability and Undecidability Results for Planning with Numerical State Variables. In Proc. AIPS-02, pages 44-53, 2002.
11. D. Hochbaum. The pscudoflow algorithm and the pscudoflow-based simplex for the maximum flow problem. In Proc. 1PCO-98, pages 325-337, Houston Texas, June 1998.
12. ILOG. 1LOG Scheduler 5.3 Reference Manual and Users Manual, 2002. http://www.ilog.com/.
13. P. Laborie. Algorithms for Propagating Resource Constraints in Al Planning and Scheduling: Existing Approaches and New Results. Artificial Intelligence, 143(2):151-188,2003.
14. N. Muscettola. Computing the Envelope for Stepwise-Constant Resource Allocations. In Proc. CP-2002, pages 139-154, 2002.
15. J.S. Penberthy and D.S. Weld. Temporal Planning with Continuous Change. In Proc. AIPS-94, pages 1010-1015, 1994.
16. J. Rhys. A selection problem of shared fixed costs and network flows. Management Science, 17(3):200-207, 1970.
17. R. Trinquart and M. Ghallab. An Extended Functional Representation in Temporal Planning: Towards Continuous Change. In Proc. ECP-01, Sept 2001.
18. M. Vilain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proc. Fifth National Conference on Artificial Intelligence, pages 377-382, 1986.