Constraint-Based Scheduling: An Introduction for Newcomers (original) (raw)

Abstract

Constraint-based scheduling is an approach for solving real-life scheduling problems by stating constraints over the problem variables. By providing generic constraint satisfaction techniques on one side and specialised constraints on the other side, constraint programming achieves a very good generality and efficiency and thus it becomes very popular in solving real-life combinatorial (optimisation) problems. In this paper we present some constraint satisfaction techniques used in constraint-based scheduling. Our goal is to introduce the technology to newcomers rather than to provide a deep survey of the area or to describe some new results there.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (15)

  1. Baptiste, P. and Le Pape, C. (1996). Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group.
  2. Baptiste, P., Le Pape, C., Nuijten, W. (2001). Constraint-based Scheduling: Applying Constraints to Scheduling Problems. Kluwer Academic Publishers, Dordrecht.
  3. Barták, R. (1998). On-line Guide to Constraint Programming, Prague, http://kti.mff.cuni.cz/\~bartak/constraints/
  4. Barták, R. (2001). Filtering Algorithms for Tabular Constraints, in Proceedings of CP2001
  5. Workshop CICLOPS, 168-182. Paphos, Cyprus.
  6. Barták, R. (2002). Visopt ShopFloor: On the Edge of Planning and Scheduling. In Proceedings of CP2002, 587-602. LNCS 2470, Springer Verlag, Ithaca.
  7. Brucker P. (2001). Scheduling Algorithms. Springer Verlag.
  8. Dorndorf U. (2002). Project Scheduling with Time Windows: From Theory to Applications. Physica Verlag, Heidelberg
  9. Harvey W.D. and Ginsberg, M.L. (1995). Limited Discrepancy Search. In Proceedings of International Joint Conference on Artificial Intelligence, 607-613.
  10. Kumar, V. (1992). Algorithms for Constraint Satisfaction Problems: A Survey, AI Magazine 13(1): 32-44.
  11. Laborie P. (2001). Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results. In Proceedings of 6th European Conference on Planning, 205-216. Toledo, Spain.
  12. Régin J.-Ch. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of 12th National Conference on Artificial Intelligence.
  13. Tsang, E. (1995). Foundations of Constraint Satisfaction. Academic Press, London.
  14. Vilím P. and Barták, R. (2002). Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times. In Proceedings of The Sixth International Conference on Artificial Intelligence Planning and Scheduling, 312-320. AAAI Press, Toulouse, France.
  15. Wallace, M. (1994). Applying Constraints for Scheduling. In Constraint Programming, Mayoh B. and Penjaak J. (eds.), NATO ASI Series, Springer Verlag.