Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
Author:
- Philippe LaboriePLPhilippe Laborie
- 1 February 2003
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 143 (2) , 151-188
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Constraint-Based Method for Project Scheduling with Time WindowsJournal of Heuristics, 2002
- On Not-First/Not-Last conditions in disjunctive schedulingEuropean Journal of Operational Research, 2000
- Multiple-Machine Lower Bounds for Shop-Scheduling ProblemsINFORMS Journal on Computing, 2000
- Bridging the gap between planning and schedulingThe Knowledge Engineering Review, 2000
- Applying constraint satisfaction techniques to job shop schedulingAnnals of Operations Research, 1997
- Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systemsIntelligent Systems Engineering, 1994
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- Temporal constraint networksArtificial Intelligence, 1991
- A practical use of Jackson's preemptive schedule for solving the job shop problemAnnals of Operations Research, 1990
- Planning for conjunctive goalsArtificial Intelligence, 1987