Document Open Access Logo

An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling

Authors Carla Juvin, Emmanuel Hebrard , Laurent Houssin , Pierre Lopez

PDF
Thumbnail PDF

File

LIPIcs.CP.2023.19.pdf
  • Filesize: 0.8 MB
  • 16 pages

Document Identifiers

Author Details

Carla Juvin
  • LAAS-CNRS, Université de Toulouse, France
Emmanuel Hebrard
  • LAAS-CNRS, Université de Toulouse, France
Laurent Houssin
  • ISAE-SUPAERO, Université de Toulouse, France
Pierre Lopez
  • LAAS-CNRS, Université de Toulouse, France

Funding

  • Hebrard, Emmanuel: ANR Project AD-Lib (ANR-22-CE23-0014).

Acknowledgements

We would like to thank Claude-Guy Quimper for the advice and discussions while writing this paper.

Cite As Get BibTex

Carla Juvin, Emmanuel Hebrard, Laurent Houssin, and Pierre Lopez. An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling. In 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 280, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.CP.2023.19

Abstract

Constraint Programming has been widely, and very successfully, applied to scheduling problems. However, the focus has been on uninterruptible tasks, and preemptive scheduling problems are typically harder for existing constraint solvers. Indeed, one usually needs to represent all potential task interruptions thus introducing many variables and symmetrical or dominated choices.
In this paper, building on mostly known results, we observe that a large class of preemptive disjunctive scheduling problems do not require an explicit model of task interruptions. We then introduce a new constraint programming approach for this class of problems that significantly outperforms state-of-the-art dedicated approaches in our experimental results.

Subject Classification

ACM Subject Classification
  • Theory of computation → Constraint and logic programming
  • Computing methodologies → Planning and scheduling
Keywords
  • Constraint Programming
  • Scheduling
  • Preemptive Resources

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Supplementary Materials

References

  1. Joseph Adams, Egon Balas, and Daniel Zawack. The Shifting Bottleneck Procedure for Job shop Scheduling. Management science, 34(3):391-401, 1988. Google Scholar
  2. David Applegate and William Cook. A Computational Study of the Job-shop Scheduling Problem. ORSA Journal on computing, 3(2):149-156, 1991. Google Scholar
  3. Nikhil Bansal, Tracy Kimbrel, and Maxim Sviridenko. Job Shop Scheduling with Unit Processing Times. Mathematics of Operations Research, 31(2):381-389, 2006. Google Scholar
  4. Philippe Baptiste, Claude Pape, and Wim Nuijten. Constraint-Based Scheduling. Kluwer Academic Publishers, 2001. Google Scholar
  5. Christian Bessiere, Nina Narodytska, Claude-Guy Quimper, and Toby Walsh. The AllDifferent Constraint with Precedences. In Proceedings of CPAIOR 2011, pages 36-52, 2011. Google Scholar
  6. Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, and Lakhdar Sais. Boosting Systematic Search by Weighting Constraints. In Ramón López de Mántaras and Lorenza Saitta, editors, Proceedings of ECAI 2004, pages 146-150, 2004. Google Scholar
  7. Peter Brucker, Svetlana A. Kravchenko, and Yuri N. Sotskov. Preemptive Job-shop Scheduling Problems with a Fixed Number of Jobs. Mathematical Methods of Operations Research, 49(1):41-76, 1999. Google Scholar
  8. Jacques Carlier. The One-machine Sequencing Problem. European Journal of Operational Research, 11(1):42-47, 1982. Google Scholar
  9. Jacques Carlier and Eric Pinson. A Practical Use of Jackson’s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Operations Research, 26:269-287, 1990. Google Scholar
  10. George B. Dantzig. A Machine-job Scheduling Model. Management Science, 6(2):191-196, 1960. Google Scholar
  11. Abbas Ebadi and Ghasem Moslehi. Mathematical Models for Preemptive Shop Scheduling Problems. Computers & Operations Research, 39(7):1605-1614, 2012. Google Scholar
  12. Abbas Ebadi and Ghasem Moslehi. An Optimal Method for the Preemptive Job Shop Scheduling Problem. Computers & Operations Research, 40(5):1314-1327, 2013. Google Scholar
  13. Hamed Fahimi and Claude-Guy Quimper. Linear-Time Filtering Algorithms for the Disjunctive Constraint. In Proceedings of AAAI'2014, pages 2637-2643, 2014. Google Scholar
  14. Henry Fisher and G.L. Thompson. Probabilistic Learning Combinations of Local Job-shop Scheduling Rules. In J.F. Muth and G.L. Thompson, editors, Industrial scheduling, pages 225-251. Prentice-Hall, Englewood Cliffs, N.J., 1963. Google Scholar
  15. Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, and Elizabeth Sweedyk. Better Approximation Guarantees for Job-shop Scheduling. SIAM Journal on Discrete Mathematics, 14(1):67-92, 2001. Google Scholar
  16. Teofilo Gonzalez and Sartaj Sahni. Flowshop and Jobshop Schedules: Complexity and Approximation. Operations research, 26(1):36-52, 1978. Google Scholar
  17. Emmanuel Hebrard. Mistral, a Constraint Satisfaction Library. Third International CSP Solver Competition, pages 31-39, 2008. URL: http://www.cril.univ-artois.fr/CPAI08/Competition-08.pdf.
  18. W.A. Horn. Some Simple Scheduling Algorithms. Naval Research Logistics Quarterly, 21(1):177-185, 1974. Google Scholar
  19. Anant Singh Jain and Sheik Meeran. Deterministic Job-shop Scheduling: Past, Present and Future. European journal of operational research, 113(2):390-434, 1999. Google Scholar
  20. Klaus Jansen, Roberto Solis-Oba, and Maxim Sviridenko. Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. SIAM Journal on Discrete Mathematics, 16(2):288-300, 2003. Google Scholar
  21. Carla Juvin, Laurent Houssin, and Pierre Lopez. Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem. Comput. Oper. Res., 152:106156, 2023. URL: https://doi.org/10.1016/j.cor.2023.106156.
  22. Svetlana A. Kravchenko and Yuri N. Sotskov. Complexity of the Two Machine Job-shop Scheduling Problem with a Fixed Number of Jobs. Central European Journal for Operations Research and Economics, 1995. Google Scholar
  23. Stephen Lawrence. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement). Graduate School of Industrial Administration, Carnegie-Mellon University, 1984. Google Scholar
  24. Claude Le Pape and Philippe Baptiste. Resource Constraints for Preemptive Job-shop Scheduling. Constraints, 3:263-287, 1998. Google Scholar
  25. Claude Le Pape and Philippe Baptiste. Heuristic Control of a Constraint-based Algorithm for the Preemptive Job-shop Scheduling Problem. Journal of Heuristics, 5:305-325, 1999. Google Scholar
  26. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, and Vincent Vidal. Last Conflict Based Reasoning. In Proceedings of ECAI 2006, pages 133-137, 2006. Google Scholar
  27. Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp, and Peter van Beek. A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint. In Georg Gottlob and Toby Walsh, editors, Proceedings IJCAI 2003, pages 245-250. Morgan Kaufmann, 2003. URL: http://ijcai.org/Proceedings/03/Papers/036.pdf.
  28. Robert H. Storer, S. David Wu, and Renzo Vaccari. New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. Management science, 38(10):1495-1509, 1992. Google Scholar
  29. Petr Vilím. O(nlog n) Filtering Algorithms for Unary Resource Constraint. In Proceedings of CPAIOR 2004, pages 335-347, 2004. Google Scholar
  30. Toby Walsh. Search in a Small World. In Thomas Dean, editor, Proceedings of IJCAI 1999, pages 1172-1177, 1999. Google Scholar
  31. Young Su Yun. Genetic Algorithm with Fuzzy Logic Controller for Preemptive and Non-preemptive Job-shop Scheduling Problems. Computers & Industrial Engineering, 43(3):623-644, 2002. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact