Skip to main content
SpringerLink
Log in
Book cover

Handbook on Scheduling pp 477–538Cite as

Constraint Programming and Disjunctive Scheduling

  • Chapter

  • 2202 Accesses

Part of the book series: International Handbook on Information Systems ((INFOSYS))

Abstract

Constraint propagation is an elementary method for reducing the search space of combinatorial search and optimization problems which has become more and more important in the last decades. The basic idea of constraint propagation is to detect and remove inconsistent variable assignments that cannot participate in any feasible solution through the repeated analysis and evaluation of the variables, domains and constraints describing a specific problem instance.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Applegate, W. Cook, A computational study of the job shop scheduling problem, ORSA J. Comput. 3, 1991, 149–156.

    Google Scholar 

  2. Ama70vS. Amarel, On the representation of problems and goal-directed procedures for computers, in R. Banerji and M. Mesarovic, editors, Theoretical Approaches to Non-Numerical Problem Solving, Springer, Heidelberg, 1970, 179–244.

    Google Scholar 

  3. J. Błażewicz, W. Domschke, E. Pesch, The job shop scheduling problem: Conventional and new solution techniques, European J. Oper. Res. 93, 1996, 1–33.

    Article  Google Scholar 

  4. P. van Beek, Reasoning about qualitative temporal information, Artificial Intelligence 58, 1992, 297–326.

    Article  Google Scholar 

  5. C. Bessiere, Arc-consistency and arc-consistency again, Artificial Intelligence 65, 1994, 179–190.

    Article  Google Scholar 

  6. C. Bessiere, E. C. Freuder, J.-C. Regin, Using constraint metaknowledge to reduce arc consistency computation, Artificial Intelligence 107, 1999, 125–148.

    Article  Google Scholar 

  7. W. Bibel, Constraint satisfaction from a deductive viewpoint, Artificial Intelligence 35, 1988,401–413.

    Article  Google Scholar 

  8. P. Brucker, B. Jurisch, Z. Kramer, The job shop problem and immediate selection, Ann. Oper. Res. 50, 1994, 73–114.

    Article  Google Scholar 

  9. P. Brucker, B. Jurisch, B. Sievers, A fast branch and bound algorithm for the job shop scheduling problem, Discrete Appl. Math. 49, 1994, 107–127.

    Article  Google Scholar 

  10. P. Baptiste, C. LePape, A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling, in Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, 1995, 136–140.

    Google Scholar 

  11. P. Baptiste, C. LePape. Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling, in Proceedings of the 15th Workshop of the U. K. Planning Special Interest Group, Liverpool, 1996.

    Google Scholar 

  12. Car82vJ. Carlier, The one machine sequencing problem, European J. Oper. Res, 11, 1982, 42–47.

    Article  Google Scholar 

  13. Y. Chen, Arc consistency revisited, Information Processing Letters 70, 1999, 175–184.

    Article  Google Scholar 

  14. N. Christofides, Graph Theory: An Algorithmic Approach, Academic Press, London, 1975.

    Google Scholar 

  15. Y. Caseau, F. Laburthe, Disjunctive scheduling with task intervals, Technical Report 95-25, Laboratoire d’Informatique de l’Ecole Normale Superieure, Paris, 1995.

    Google Scholar 

  16. M. B. Clowes, On seeing things, Artificial Intelligence 2, 1971, 179–185.

    Article  Google Scholar 

  17. J. Cohen, Constraint logic programming languages, Communications of the ACM 33, 1990, 52–68.

    Article  Google Scholar 

  18. M. C. Cooper, An optimal k-consistency algorithm, Artificial Intelligence 41, 1989, 89–95.

    Article  Google Scholar 

  19. J. Carlier, E. Pinson, An algorithm for solving the job shop problem, Management Sci. 35, 1989, 164–176.

    Google Scholar 

  20. J. Carlier, E. Pinson, A practical use of Jackson’s preemptive schedule for solving the job shop problem, Ann. Oper. Res. 26, 1990, 269–287.

    Google Scholar 

  21. J. Carlier, E. Pinson, Adjustments of heads and tails for the job shop problem, European J. Oper. Res. 78, 1994, 146–161.

    Article  Google Scholar 

  22. E. Davis, Constraint propagation with interval labels, Artificial Intelligence 32, 1987, 281–331.

    Article  Google Scholar 

  23. G. Deweß, An existence theorem for packing problems with implications for the computation of optimal machine schedules, Optimization 25, 1992, 261–269.

    Article  Google Scholar 

  24. R. Dechter, J. Pearl, Network-based heuristics for constraint satisfaction problems, Artificial Intelligence 34, 1988, 1–38.

    Article  Google Scholar 

  25. U. Dorndorf, T. Phan-Huy, E. Pesch, A survey of interval capacity consistency tests for time and resource constrained scheduling, in J. Weglarz, editor, Project Scheduling-Recent Models, Algorithms and Applications, Kluwer Academic Publishers, Boston, 1999, 213–238.

    Google Scholar 

  26. U. Dorndorf, E. Pesch, T. Phan-Huy, Constraint propagation techniques for disjunctive scheduling problems, Artificial Intelligence 122, 2000, 189–240.

    Article  Google Scholar 

  27. U. Dorndorf, E. Pesch, T. Phan-Huy, Solving the open shop scheduling problem, Journal of Scheduling 4, 2001, 157–174.

    Article  Google Scholar 

  28. J. Erschler, P. Lopez, C. Thuriot, Raisonnement temporel sous contraintes de ressource et problèmes d’ordonnancement, Revue d’Intelligence Artificielle 5, 1991, 7–32.

    Google Scholar 

  29. F. Focacci, W. Nuijten, A constraint propagation algorithm for scheduling with sequence dependent setup times, in U. Junker, S.E. Karisch, S. Tschöke, editors, Proceedings of the 2nd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2000, 53–55.

    Google Scholar 

  30. E. C. Freuder, Synthesizing constraint expressions, Journal of the ACM 21, 1978, 958–966.

    Article  Google Scholar 

  31. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

    Google Scholar 

  32. P. van Hentenryck, Y. Deville, C.-M. Teng, A generic arc consistency algorithm and its specializations, Artificial Intelligence 57, 1992, 291–321.

    Article  Google Scholar 

  33. P. van Hentenryck, Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, 1992.

    Google Scholar 

  34. C.-C. Han, C.-H. Lee, Comments on Mohr and Henderson’s path consistency algorithm, Artificial Intelligence 36, 1988, 125–130.

    Article  Google Scholar 

  35. R. M. Haralick, L. G. Shapiro, The consistent labelling problem: Part I, IEEE Transactions PAMI 1, 1979, 173–184.

    Google Scholar 

  36. R. M. Haralick, L. G. Shapiro, The consistent labelling problem: Part II, IEEE Transactions PAMI 2, 1980, 193–203.

    Google Scholar 

  37. D. Z. Huffman, Impossible objects as nonsense sentences, Machine Intelligence 6, 1971, 295–323.

    Google Scholar 

  38. P. Jeavons, D. Cohen, M.C. Cooper, Constraints, consistency and closure, Artificial Intelligence 101, 1998, 251–265.

    Article  Google Scholar 

  39. V. Kumar, Algorithms for constraint satisfaction problems, AI Magazine 13, 1992, 32–44.

    Google Scholar 

  40. P. Lopez, J. Erschler, P. Esquirol, Ordonnancement de tâches sous contraintes: une approche énergétique, RAIRO Automatique, Productique, Informatique Industrielle 26, 1992, 453–481.

    Google Scholar 

  41. O. Lhomme, Consistency techniques for numeric CSPs, in Proceedings of the 13th International Joint Conference on Artificial Intelligence, Chambery, France, 1993, 232–238.

    Google Scholar 

  42. Z. K. Mackworth, Consistency in networks of relations, Articial Intelligence 8, 1977, 99–118.

    Article  Google Scholar 

  43. Z. K. Mackworth, The logic of constraint satisfaction, Artificial Intelligence 58, 1992, 3–20.

    Article  Google Scholar 

  44. P. Meseguer, Constraint satisfaction problems: An overview, AI Communications, 2, 1989, 3–17.

    Google Scholar 

  45. Z. K. Mackworth, E. C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence 25, 1985, 65–74.

    Article  Google Scholar 

  46. R. Mohr, T. C. Henderson, Arc and path consistency revisited, Artificial Intelligence 28, 1986, 225–233.

    Article  Google Scholar 

  47. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences 7, 1974, 95–132.

    Article  Google Scholar 

  48. R. E. Moore, Interval Analysis, Prentice Hall, Englewood Cliffs, 1966.

    Google Scholar 

  49. P. Martin, D. B. Shmoys, A new approach to computing optimal schedules for the job shop scheduling problem, in Proceedings of the 5th International IPCO Conference, 1996.

    Google Scholar 

  50. J. F. Muth, G. L. Thompson (eds.), Industrial Scheduling, Prentice Hall, Englewood Cliffs, 1963.

    Google Scholar 

  51. W. P. M. Nuijten, C. Le Pape. Constraint-based job shop scheduling with ILOG scheduler, Journal of Heuristics 3, 1998, 271–286.

    Article  Google Scholar 

  52. W. Nuijten, F. Sourd, New time bound adjustment techniques for shop scheduling, in P. Brucker, S. Heitmann, J. Hurink, S. Knust, editors, Proceedings of the 7th International Workshop on Project Management and Scheduling, 2000, 224–226.

    Google Scholar 

  53. W. P. M. Nuijten, Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, PhD thesis, Eindhoven University of Technology, 1994.

    Google Scholar 

  54. T. Phan-Huy, Wissensbasierte Methoden zur Optimierung von Produktions-abldufen, Master’s thesis, University of Bonn, Bonn, 1996.

    Google Scholar 

  55. T. Phan-Huy, Constraint Propagation in Flexible Manufacturing, Springer, 2000.

    Google Scholar 

  56. E. Pesch, U. Tetzlaff, Constraint propagation based scheduling of job shops, INFORMS J. Comput. 8, 1996, 144–157.

    Article  Google Scholar 

  57. B. Roy, B. Sussman, Les problèmes d’ordonnancement avec contraintes disjonctives, Note D. S. 9, SEMA, Paris, 1964.

    Google Scholar 

  58. R. Seidel, A new method for solving constraint satisfaction problems, in Proceedings of the 7th International Joint Conference on AI, 1981, 338–342.

    Google Scholar 

  59. E. P. K. Tsang, N. Fbster, Solution synthesis in the constraint satisfaction problem, Technical report csm-142, Department of Computer Sciences, University of Essex, Essex, 1990.

    Google Scholar 

  60. P. Torres, P. Lopez, Overview and possible extensions of shaving techniques for job-shop problems, in U. Junker, S. E. Karisch, S. Tschöke, editors, Proceedings of the 2nd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2000, 181–186.

    Google Scholar 

  61. E. Tsang, Foundations of Constraint Satisfaction, Academic Press, Essex, 1993.

    Google Scholar 

  62. D. L. Waltz, Generating semantic descriptions from drawings of scenes with shadows, Technical report AI-TR-271, M.I.T., 1972.

    Google Scholar 

  63. D. L. Waltz. Understanding line drawings of scenes with shadows, in P. H. Winston, editor, The Psychology of Computer Vision, 19–91. McGraw-Hill, 1975.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2007). Constraint Programming and Disjunctive Scheduling. In: Handbook on Scheduling. International Handbook on Information Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32220-7_13

Download citation

Publish with us

Policies and ethics

Search

Navigation