Abstract
This paper presents the results of a case study, concerning the propagation of a global disjunctive resource constraint, when the resource is over-loaded. The problem can be seen as a partial constraint satisfaction problem, in which either the resource constraint or the due dates of some jobs have to be violated. Global constraint propagation methods are introduced to efficiently deal with this situation. These methods are applied to a well-known operations research problem: minimizing the number of late jobs on a single machine, when jobs are subjected to release dates and due dates. Dominance criteria and a branch and bound procedure are developed for this problem. 960 instances are generated with respect to different characteristics (number of jobs, overload ratio, distribution of release dates, of due dates and of processing times). Instances with 60 jobs are solved in 23 seconds on average and 90% of the instances with 100 jobs are solved in less than 1 hour.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aggoun and N. Beldiceanu [1993], Extending CHIP in Order to Solve Complex Scheduling and Placement Problems, Mathematical and Computer Modeling 17:57–73.
D. Applegate and W. Cook [1991], A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing 3(2):149–156.
Ph. Baptiste and C. Le Pape [1995], A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling, Proc. 14th International Joint Conference on Artificial Intelligence.
Ph. Baptiste [1998], An O(n4) Algorithm for Preemptive Scheduling of a Single Machine to Minimize the Number of Late Jobs, Technical Report 98/98, Université de Technologie de Compiègne.
S. Bistarelli, U. Montanari and F. Rossi [1995], Constraint Solving over Semirings, Proc. 14th International Joint Conference on Artificial Intelligence.
P. Brucker [1995], Scheduling algorithms, Springer Lehrbuch.
J. Carlier [1982], The One-Machine Sequencing Problem, European Journal of Operational Research 11:42–47.
J. Carlier and E. Pinson [1990], A Practical Use of Jackson’s Preemptive Schedule for Solving the Job-Shop Problem, Annals of Operations Research 26:269–287.
Y. Caseau and F. Laburthe [1995], Disjunctive Scheduling with Task Intervals, Technical Report, Ecole Normale Supérieure.
Y. Caseau and F. Laburthe [1996], CLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving, Working Paper, Bouygues, Direction Scientifique.
S. Dauzére-Pérés [1995], Minimizing Late Jobs in the General One Machine Scheduling Problem, European Journal of Operational Research 81:134–142.
E. Freuder and R. Wallace [1992], Partial Constraint Satisfaction, Artificial Intelligence 58:21–70.
M. R. Garey and D. S. Johnson [1979], Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Company.
H. Kise, T. Ibaraki and H. Mine [1978], A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times, Operations Research 26(1):121–126.
E. L. Lawler [1990], A Dynamic Programming Algorithm for Preemptive Scheduling of a Single Machine to Minimize the Number of Late Jobs, Annals of Operations Research 26:125–133.
C. Le Pape and Ph. Baptiste [1997], A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling, Proc. 3rd International Conference on the Practical Application of Constraint Technology.
J. M. Moore [1968], An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15(1):102–109.
W. P. M. Nuijten [1994], Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, PhD Thesis, Eindhoven University of Technology.
L. Péridy [1996], Le probléme de job-shop: arbitrages et ajustements, PhD Thesis, versité de Technologie de Compiègne, France (in French)
J-C. Régin and J-F. Puget [1997], A Filtering Algorithm for Global Sequencing Constraints, Proc. 3rd International Conference on Principles and Practice of Constraint Programming.
T. Schiex, H. Fargier and G. Verfaillie [1995], Valued Constraint Satisfaction Problems: Hard and Easy Problems, Proc. 14th International Joint Conference on Artificial Intelligence.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baptiste, P., Le Pape, C., Peridy, L. (1998). Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_8
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive