Skip to main content
Springer Nature Link
Log in

Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP98 (CP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1520))

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

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

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.

    Google Scholar 

  • D. Applegate and W. Cook [1991], A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing 3(2):149–156.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • S. Bistarelli, U. Montanari and F. Rossi [1995], Constraint Solving over Semirings, Proc. 14th International Joint Conference on Artificial Intelligence.

    Google Scholar 

  • P. Brucker [1995], Scheduling algorithms, Springer Lehrbuch.

    Google Scholar 

  • J. Carlier [1982], The One-Machine Sequencing Problem, European Journal of Operational Research 11:42–47.

    Google Scholar 

  • 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.

    Google Scholar 

  • Y. Caseau and F. Laburthe [1995], Disjunctive Scheduling with Task Intervals, Technical Report, Ecole Normale Supérieure.

    Google Scholar 

  • Y. Caseau and F. Laburthe [1996], CLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving, Working Paper, Bouygues, Direction Scientifique.

    Google Scholar 

  • 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.

    Google Scholar 

  • E. Freuder and R. Wallace [1992], Partial Constraint Satisfaction, Artificial Intelligence 58:21–70.

    Google Scholar 

  • M. R. Garey and D. S. Johnson [1979], Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Company.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • J. M. Moore [1968], An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15(1):102–109.

    Google Scholar 

  • W. P. M. Nuijten [1994], Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, PhD Thesis, Eindhoven University of Technology.

    Google Scholar 

  • L. Péridy [1996], Le probléme de job-shop: arbitrages et ajustements, PhD Thesis, versité de Technologie de Compiègne, France (in French)

    Google Scholar 

  • 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.

    Google Scholar 

  • T. Schiex, H. Fargier and G. Verfaillie [1995], Valued Constraint Satisfaction Problems: Hard and Easy Problems, Proc. 14th International Joint Conference on Artificial Intelligence.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UMR CNRS 6599, Heudiasyc, U.T.C., Compiégne, BP 20529, F-60205

    Philippe Baptiste

  2. Bouygues, Direction des Technologies Nouvelles, USA

    Philippe Baptiste & Claude Le Pape

  3. Institut de Mathématiques Appliquées, Université Catholique de l’Ouest, USA

    Laurent Peridy

Authors
  1. Philippe Baptiste
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Claude Le Pape
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Laurent Peridy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Information Technology, Griffith University, Nathan, Queensland, 4111, Australia

    Michael Maher

  2. ILOG S.A., 9, rue de Verdun, BP 85, F-94253, Gentilly Cedex, France

    Jean-Francois Puget

Rights and permissions

Reprints 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

Publish with us

Policies and ethics