Abstract
PDF (811 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (37)
doi:10.1016/S0004-3702(02)00362-4 
Copyright © 2002 Elsevier Science B.V. All rights reserved.
Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results*1
Philippe Laborie
Received 12 January 2002;
Abstract
This paper summarizes the main existing approaches to propagate resource constraints in Constraint-Based scheduling and identifies some of their limitations for using them in an integrated planning and scheduling framework. We then describe two new algorithms to propagate resource constraints on discrete resources and reservoirs. Unlike most of the classical work in scheduling, our algorithms focus on the precedence relations between activities rather than on their absolute position in time. They are efficient even when the set of activities is not completely defined and when the time window of activities is large. These features explain why our algorithms are particularly suited for integrated planning and scheduling approaches. All our algorithms are illustrated with examples. Encouraging preliminary results are reported on pure scheduling problems as well as some possible extensions of our framework.
Author Keywords: Scheduling; AI planning; Constraint programming; Cumulative resources
References
1. M. Dell'Amico and M. Trubian , Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41 (1993), pp. 231–252. View Record in Scopus | Cited By in Scopus (163)
2. P. Baptiste and C. Le Pape , A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In: Proc. IJCAI-95, Montreal, Quebec (1995).
3. P. Baptiste, C. Le Pape and W. Nuijten Constraint-Based Scheduling. Applying Constraint Programming to Scheduling Problems, Kluwer Academics, Dordrecht (2001).
4. C. Beck, Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling, PhD Thesis, University of Toronto, 1999.
5. J. Carlier and E. Pinson , A practical use of Jackson's preemptive schedule for solving the job-shop problem. Ann. Oper. Res. 26 (1990), pp. 269–287.
6. Y. Caseau, F. Laburthe, Disjunctive scheduling with task intervals, Technical Report 95-25, LIENS, Ecole Normale Supérieure, Paris, France, 1995.
7. A. Cesta and A. Oddi , Gaining efficiency and flexibility in the simple temporal problem. In: Proc. Third International Conference on Temporal Representation and Reasoning (TIME-96) (1996).
8. A. Cesta, A. Oddi and S.F. Smith , A constrained-based method for project scheduling with time windows. J. Heuristics 8 1 (2002).
9. A. Cesta and C. Stella , A time and resource problem for planning architectures. In: Proc. ECP-97, Toulouse, France (1997).
10. D. Chapman , Planning for conjunctive goals. Artificial Intelligence 32 (1987), pp. 333–377. Abstract | 
PDF (2530 K)
| View Record in Scopus | Cited By in Scopus (138)
11. C. Cheng and S. Smith , Applying constraint satisfaction techniques to job shop scheduling. Ann. Oper. Res. 70 (1997), pp. 327–357. View Record in Scopus | Cited By in Scopus (12)
12. R. Dechter, I. Meiri and J. Pearl , Temporal constraint networks. Artificial Intelligence 49 1–3 (1991), pp. 61–96.
13. U. Dorndorf, T. Phan Huy and E. Pesch , A survey of interval capacity consistency tests for time and resource constrained scheduling. In: Project Scheduling—Recent Models, Algorithms and Applications, Kluwer Academic, Dordrecht (1999), pp. 213–238.
14. J. Erschler, Analyse sous contraintes et aide à la décision pour certains problèmes d'ordonnancement, PhD Thesis, Université Paul Sabatier, Toulouse, France, 1976.
15. J. Erschler, P. Lopez and C. Thuriot , Raisonnement temporel sous contraintes de ressources et problèmes d'ordonnancement. Revue d'Intelligence Artificielle 5 3 (1991), pp. 7–32.
16. F. Focacci, P. Laborie and W. Nuijten , Solving scheduling problems with setup times and alternative resources. In: Proc. Fifth International Conference on Artificial Intelligence Planning and Scheduling, Breckenridge, CO (2000), pp. 92–101.
17. L. Ford and D. Fulkerson Flows in Networks, Princeton University Press, Princeton, NJ (1962).
18. F. Garcia and P. Laborie , Hierarchisation of the search space in temporal planning. In: New Directions in AI Planning, IOS Press, Amsterdam (1996), pp. 217–232.
19. ILOG, ILOG Scheduler 5.2 Reference Manual, 2001, http://www.ilog.com/.
20. S. Kambhampati and X. Yang , On the role of disjunctive representations and constraint propagation in refinement planning. In: Proc. KR-96, Cambridge, MA (1996), pp. 135–146.
21. P. Laborie, Modal Precedence Graphs and their usage in ILOG Scheduler, Technical Report OIR-1999-01, ILOG, 1999. Restricted availability.
22. P. Laborie and M. Ghallab , Planning with sharable resource constraints. In: Proc. IJCAI-95, Montreal, Quebec (1995), pp. 1643–1649.
23. C. Le Pape , Implementation of resource constraints in ILOG schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering 3 2 (1994), pp. 55–66. View Record in Scopus | Cited By in Scopus (53)
24. D. McAllester and D. Rosenblitt , Systematic nonlinear planning. In: Proc. AAAI-91, Anaheim, CA (1991), pp. 634–639.
25. K. Neumann, C. Schwindt, Project scheduling with inventory constraints, Technical Report WIOR-572, Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe, 1999.
26. X. Nguyen and S. Kambhampati , Reviving partial order planning. In: Proc. IJCAI-01, Seattle, WA (2001), pp. 459–464.
27. W. Nuijten, Time and resource constrained scheduling: A constraint satisfaction approach, PhD Thesis, Eindhoven University of Technology, 1994.
28. D. Pacciarelli and A. Mascis , Job-shop scheduling of perishable items. In: INFORMS'99 (1999).
29. D.E. Smith, J. Frank and A.K. Jonsson , Bridging the gap between planning and scheduling. Knowledge Engineering Review 15 1 (2000).
30. F. Sourd and W. Nuijten , Multiple-machine lower bounds for shop scheduling problems. INFORMS J. Comput. 4 12 (2000), pp. 341–352. View Record in Scopus | Cited By in Scopus (4)
31. P. Torres and P. Lopez , On not-first/not-last conditions in disjunctive scheduling. European J. Oper. Res. 127 (2000), pp. 332–343. Abstract | Article | PDF (147 K)
| View Record in Scopus | Cited By in Scopus (7)
*1 A shorter version of this paper appeared in Proceedings of the Sixth European Conference on Planning, Toledo, Spain, 2001.
