Abstract
In recent years, constraint propagation techniques have been shown to be highly effective for solving difficult scheduling problems. In this paper, we present an algorithm which combines constraint propagation with a problem decomposition approach in order to simplify the solution of the job shop scheduling problem. This is mainly guided by the observation that constraint propagation is more effective for ‘small’ problem instances. Roughly speaking, the algorithm consists of deducing operation sequences that are likely to occur in an optimal solution of the job shop scheduling problem (JSP).
The algorithm for which the name edge-guessing procedure has been chosen – since with respect to the job shop scheduling problem (JSP) the deduction of machine sequences is mainly equivalent to orienting edges in a disjunctive graph – can be applied in a preprocessing step, reducing the solution space, thus speeding up the overall solution process. In spite of the heuristic nature of edge-guessing, it still leads to near-optimal solutions. If combined with a heuristic algorithm, we will demonstrate that given the same amount of computation time, the additional application of edge-guessing leads to better solutions. This has been tested on a set of well-known JSP benchmark problem instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science 34 (1988) 391-401.
D. Applegate and W. Cook, A computational study of the job shop scheduling problem, ORSA Journal on Computing 3 (1991) 149-156.
P. Baptiste and C. Le Pape, 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) pp. 136-140.
P. Baptiste and C. Le Pape, 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).
J. Blazewicz, W. Domschke and E. Pesch, The job shop scheduling problem: Conventional and new solution techniques, European Journal of Operational Research 93 (1996) 1-33.
J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt and J. W¸eglarz, Scheduling Computer and Manufacturing Processes (Springer, Heidelberg, 1996).
P. Brucker, B. Jurisch and A. Krämer, The job shop problem and immediate selection, Annals of Operations Research 50 (1994) 73-114.
P. Brucker, B. Jurisch and B. Sievers, A fast branch and bound algorithm for the job shop scheduling problem, Discrete Applied Mathematics 49 (1994) 107-127.
J. Carlier, The one machine sequencing problem, European Journal of Operational Research 11 (1982) 42-47.
J. Carlier and E. Pinson, An algorithm for solving the job shop problem, Management Science 35 (1989) 164-176.
J. Carlier and E. Pinson, A practical use of Jackson's preemptive schedule for solving the job shop problem, Annals of Operations Research 26 (1990) 269-287.
J. Carlier and E. Pinson, Adjustments of heads and tails for the job shop problem, European Journal of Operational Research 78 (1994) 146-161.
Y. Caseau and F. Laburthe, Disjunctive scheduling with task intervals, Technical Report 95-25, Laboratoire d'lnformatique de 1'Ecole Normale Supérieure, Paris (1995).
G. Deweß, An existence theorem for packing problems with implications for the computation of optimal machine schedules, Optimization 25 (1992) 261-269.
U. Dorndorf, E. Pesch and T. Phan-Huy, A branch-and-bound algorithm for the resource constrained project scheduling problem, Mathematical Methods in Operations Research-ZOR 52 (2000) 413-439.
U. Dorndorf, E. Pesch and T. Phan-Huy, Constraint propagation techniques for the disjunctive scheduling problem, Artificial Intelligence 122 (2000) 189-240.
U. Dorndorf, E. Pesch and T. Phan-Huy, A time-oriented branch-and-bound algorithm for resource constrained project scheduling with generalised precedence constraints, Management Science 46 (2000) 1365-1384.
U. Dorndorf, E. Pesch and T. Phan-Huy, Solving the open shop scheduling problem, Journal of Scheduling 4 (2001) 157-174.
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, Vol. 14, ed. J. Waglarz (Kluwer Academic, Boston, 1999) pp. 213-238.
H. Fisher and G.L. Thompson, Probabilistic learning combinations of local job shop scheduling rules, in: Industrial Scheduling, eds. J.F. Muth and G.L. Thompson (Prentice-Hall, Englewood Cliffs, NJ, 1963) pp. 225-251.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness (Freeman, San Francisco, CA, 1979).
R. Haupt, A survey of priority-rule based scheduling, OR Spektrum 11 (1989) 3-16.
V. Kumar, Algorithms for constraint satisfaction problems, AI Magazine 13 (1992) 32-44.
S. Lawrence, Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques, Technical Report, Carnegie Mellon University, Pittsburg (1984).
P. Martin and 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).
J.F. Muth and G.L. Thompson (eds.), Industrial Scheduling (Prentice-Hall, Englewood Cliffs, NJ, 1963).
W.P.M. Nuijten, Time and resource constrained scheduling: A constraint satisfaction approach, Ph.D. Thesis, Eindhoven University of Technology (1994).
W.P.M. Nuijten and C. Le Pape, Constraint-based job shop scheduling with ILOG scheduler, Journal of Heuristics 3 (1998) 271-286.
E. Pesch, Learning in Automated Manufacturing (Physica, Heidelberg, 1994).
E. Pesch and U. Tetzlaff, Constraint propagation based scheduling of job shops, INFORMS Journal on Computing 8 (1996) 144-157.
T. Phan-Huy, Wissensbasierte Methoden zur Optimierung von Produktionsabläufen, Master's Thesis, University of Bonn, Bonn (1996).
T. Phan-Huy, Constraint Propagation in Flexible Manufacturing (Springer, Heidelberg, 2000).
B. Roy and B. Sussman, Les problèmes d'ordonnancement avec contraintes disjonctives, Note D. S. 9, SEMA, Paris (1964).
E.P.K Tsang, Consistency and satisfiability in constraint satisfaction problems, in: Proceedings of the Artificial Intelligence and Simulated Behaviour-89 Conference, Brighton (1989) pp. 41-48.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dorndorf, U., Pesch, E. & Phan-Huy, T. Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem. Annals of Operations Research 115, 125–145 (2002). https://doi.org/10.1023/A:1021197120431
Issue Date:
DOI: https://doi.org/10.1023/A:1021197120431