Constraint propagation techniques for the disjunctive scheduling problem

Artificial Intelligence

Volumn 122, Issue 1, 2000, Pages 189-240

  Dorndorf, Ulrich ^a   Pesch, Erwin ^a   Phan Huy, Toàn ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; PROBLEM SOLVING;

CONSISTENCY TESTS; CONSTRAINT PROPAGATION METHODS; DISJUNCTIVE SCHEDULING; JOB SHOP SCHEDULING;

ARTIFICIAL INTELLIGENCE;

EID: 0034271995     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00040-0     Document Type: Article

References (62)

1. Applegate D., Cook W. A computational study of the job shop scheduling problem. ORSA J. Comput. Vol. 3:1991;149-156.
2. Amarel S. On the representation of problems and goal-directed procedures for computers. Banerji R., Mesarovic M. Theoretical Approaches to Non-Numerical Problem Solving. 1970;179-244 Springer-Verlag, Heidelberg.
3. Blażewicz J., Domschke W., Pesch E. The job shop scheduling problem: Conventional and new solution techniques. European J. Oper. Res. Vol. 93:1996;1-33.
4. van Beek P. Reasoning about qualitative temporal information. Artificial Intelligence. Vol. 58:1992;297-326.
5. Bessière C. Arc-consistency and arc-consistency again. Artificial Intelligence. Vol. 65:1994;179-190.
6. Bessière C., Freuder E.C., Régin J.-C. Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence. Vol. 107:1999;125-148.
7. Bibel W. Constraint satisfaction from a deductive viewpoint. Artificial Intelligence. Vol. 35:1988;401-413.
8. Brucker P., Jurisch B., Krämer A. The job shop problem and immediate selection. Ann. Oper. Res. Vol. 50:1994;73-114.
9. Brucker P., Jurisch B., Sievers B. A fast branch and bound algorithm for the job shop scheduling problem. Discrete Appl. Math. Vol. 49:1994;107-127.
10. Baptiste P., Le Pape C. A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. Proc. IJCAI-95, Montreal, Quebec. 1995;136-140.
11. Baptiste P., Le Pape C. Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. Proc. 15th Workshop of the U.K. Planning Special Interest Group, Liverpool. 1996.
12. Carlier J. The one machine sequencing problem. European J. Oper. Res. Vol. 11:1982;42-47.
13. Chen Y. Arc consistency revisited. Inform. Process. Lett. Vol. 70:1999;75-184.
14. Christofides N. Graph Theory: An Algorithmic Approach. 1975;Academic Press, London.
15. Caseau Y., Laburthe F. Disjunctive scheduling with task intervals, Technical Report 95-25. 1995;Laboratoire d'Informatique de l'Ecole Normale Supérieure, Paris.
16. Clowes M.B. On seeing things. Artificial Intelligence. Vol. 2:1971;179-185.
17. Cohen J. Constraint logic programming languages. Comm. ACM. Vol. 33:1990;52-68.
18. Cooper M.C. An optimal k -consistency algorithm. Artificial Intelligence. Vol. 41:1989;89-95.
19. Carlier J., Pinson E. An algorithm for solving the job shop problem. Management Science. Vol. 35:1989;164-176.
20. Carlier J., Pinson E. A practical use of Jackson's preemptive schedule for solving the job shop problem. Ann. Oper. Res. Vol. 26:1990;269-287.
21. Carlier J., Pinson E. Adjustments of heads and tails for the job shop problem. European J. Oper. Res. Vol. 78:1994;146-161.
22. Davis E. Constraint propagation with interval labels. Artificial Intelligence. Vol. 32:1987;281-331.
23. Deweß G. An existence theorem for packing problems with implications for the computation of optimal machine schedules. Optimization. Vol. 25:1992;261-269.
24. Dechter R., Pearl J. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence. Vol. 34:1988;1-38.
25. Dorndorf U., Pesch E., Phan-Huy T. Solving the open shop scheduling problem, Working Paper. 1999;University of Bonn, Bonn.
26. Dorndorf U., Phan-Huy T., Pesch E. A survey of interval capacity consistency tests for time and resource constrained scheduling. Wȩglarz J. Project Scheduling - Recent Models, Algorithms and Applications. 1999;213-238 Kluwer Academic, Boston, MA.
27. Erschler J., Lopez P., Thuriot C. Raisonnement temporel sous contraintes de ressource et problèmes d'ordonnancement. Revue d'Intelligence Artificielle. Vol. 5:1991;7-32.
28. Focacci F., Nuijten W. A constraint propagation algorithm for scheduling with sequence dependent setup times. Junker U., Karisch S.E., Tschöke S. Proc. 2nd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 2000;53-55 University of Paderborn, Paderborn.
29. Freuder E.C. Synthesizing constraint expressions. J. ACM. Vol. 21:1978;958-966.
30. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
31. van Hentenryck P., Deville Y., Teng C.-M. A generic arc consistency algorithm and its specializations. Artificial Intelligence. Vol. 57:1992;291-321.
32. van Hentenryck P. Constraint Satisfaction in Logic Programming. 1992;MIT Press, Cambridge, MA.
33. Han C.-C., Lee C.-H. Comments on Mohr and Henderson's path consistency algorithm. Artificial Intelligence. Vol. 36:1988;125-130.
34. Haralick R.M., Shapiro L.G. The consistent labelling problem: Part I. IEEE Trans. Pattern Anal. Machine Intelligence. Vol. 1:1979;173-184.
35. Haralick R.M., Shapiro L.G. The consistent labelling problem: Part II. IEEE Trans. Pattern Anal. Machine Intelligence. Vol. 2:1980;193-203.
36. Huffman D.A. Impossible objects as nonsense sentences. Meltzer B., Michie D. Machine Intelligence 6. 1971;295-323 Edinburgh University Press, Edinburgh.
37. Jeavons P., Cohen D., Cooper M.C. Constraints, consistency and closure. Artificial Intelligence. Vol. 101:1998;251-265.
38. Kumar V. Algorithms for constraint satisfaction problems. AI Magazine. Vol. 13:1992;32-44.
39. Lopez P., Erschler J., Esquirol P. Ordonnancement de tâches sous contraintes: Une approche énergétique. RAIRO Automatique, Productique, Informatique Industrielle. Vol. 26:1992;453-481.
40. Lhomme O. Consistency techniques for numeric CSPs. Proc. IJCAI-93, Chambéry, France. 1993;232-238.
41. Mackworth A.K. Consistency in networks of relations. Artificial Intelligence. Vol. 8:1977;99-118.
42. Mackworth A.K. The logic of constraint satisfaction. Artificial Intelligence. Vol. 58:1992;3-20.
43. Meseguer P. Constraint satisfaction problems: An overview. AI Communications. Vol. 2:1989;3-17.
44. Mackworth A.K., Freuder E.C. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence. Vol. 25:1985;65-74.
45. Mohr R., Henderson T.C. Arc and path consistency revisited. Artificial Intelligence. Vol. 28:1986;225-233.
46. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences. Vol. 7:1974;95-132.
47. Moore R.E. Interval Analysis. 1966;Prentice-Hall, Englewood Cliffs, NJ.
48. Martin P., Shmoys D.B. A new approach to computing optimal schedules for the job shop scheduling problem. Proc. 5th International IPCO Conference. 1996.
49. Muth J.F., Thompson G.L. Industrial Scheduling. 1963;Prentice-Hall, Englewood Cliffs, NJ.
50. Nuijten W.P.M., Le Pape C. Constraint-based job shop scheduling with ILOG scheduler. J. Heuristics. Vol. 3:1998;271-286.
51. Nuijten W., Sourd F. New time bound adjustment techniques for shop scheduling. Brucker P., Heitmann S., Hurink J., Knust S. Proc. 7th International Workshop on Project Management and Scheduling. 2000;224-226 University of Osnabrück, Osnabrück.
52. Nuijten W.P.M. Time and resource constrained scheduling: A constraint satisfaction approach, Ph.D. Thesis. 1994;Eindhoven University of Technology, Eindhoven.
53. Phan-Huy T. Wissensbasierte Methoden zur Optimierung von Produktionsabläufen, Master's Thesis. 1996;University of Bonn, Bonn.
54. Phan-Huy T. Constraint propagation in flexible manufacturing, Ph.D. Thesis. 1999;University of Bonn, Bonn.
55. Pesch E., Tetzlaff U. Constraint propagation based scheduling of job shops. INFORMS J. Comput. Vol. 8:1996;144-157.
56. Roy B., Sussmann B. Les problèmes d'ordonnancement avec contraintes disjonctives, Note D. S. 9. 1964;SEMA, Paris.
57. Seidel R. A new method for solving constraint satisfaction problems. Proc. IJCAI-81, Vancouver, BC. 1981;338-342.
58. Tsang E.P.K., Foster N. Solution synthesis in the constraint satisfaction problem, Technical Report csm-142. 1990;Department of Computer Sciences, University of Essex, Essex.
59. Torres P., Lopez P. Overview and possible extensions of shaving techniques for job-shop problems. Junker U., Karisch S.E., Tschöke S. Proc. 2nd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. 2000;181-186 University of Paderborn, Paderborn.
60. Tsang E. Foundations of Constraint Satisfaction. 1993;Academic Press, Essex.
61. Waltz D.L. Generating semantic descriptions from drawings of scenes with shadows, Technical Report AI-TR-271. 1972;Massachusetts Institute of Technology, Cambridge, MA.
62. Waltz D.L. Understanding line drawings of scenes with shadows. Winston P.H. The Psychology of Computer Vision. 1975;19-91 McGraw-Hill, New York.