Document Open Access Logo

Disjunctive Scheduling in Tempo

Author Emmanuel Hebrard

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.CP.2025.13.pdf
  • Filesize: 1 MB
  • 22 pages
HTML5 Logo HTML (experimental)
LIPIcs.CP.2025.13.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Applied computing
  • Computing methodologies → Discrete space search
Keywords
  • Scheduling
  • Constraint solvers
  • Clause-learning

Metrics

Abstract

In this paper we introduce a constraint programming lazy clause and literal generation solver embarking ideas from SAT Modulo theories. A key aspect of the solver are Boolean variables with an associated semantic in difference logic, i.e., systems of binary numeric difference constraints or edges, making it particularly adapted to scheduling and other temporal problems. We apply this solver to disjunctive scheduling problems, where edges are used as branching variables, can be inferred via the edge finding rule as well as by transitivity reasoning, and can in turn strengthen propagation via temporal graph reasoning. Our experiments on job-shop scheduling show that a deep integration of these techniques makes our solver competitive with state-of-the-art approaches on these problems.

Cite As Get BibTex

Emmanuel Hebrard. Disjunctive Scheduling in Tempo. In 31st International Conference on Principles and Practice of Constraint Programming (CP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 340, pp. 13:1-13:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.CP.2025.13

Author Details

Emmanuel Hebrard
  • LAAS-CNRS, Université de Toulouse, France

Funding

  • Hebrard, Emmanuel: supported by the ANR Project AD-Lib (ANR-22-CE23-0014); and the European Union’s Horizon Europe Research and Innovation program TUPLES No101070149.

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, Rovert Bixby, Vašek Chvátal, and William Cook. Finding Cuts in the TSP (A preliminary report). Technical report, Center for Discrete Mathematics & Theoretical Computer Science, 1995. Google Scholar
  3. David Applegate and William Cook. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing, 3(2):149-156, 1991. URL: https://doi.org/10.1287/IJOC.3.2.149.
  4. Mokhtar S. Bazaraa and R. W. Langley. A Dual Shortest Path Algorithm. SIAM Journal on Applied Mathematics, 26(3):496-501, 1974. Google Scholar
  5. J. Christopher Beck. Multi-point Constructive Search. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP), pages 737-741, 2005. URL: https://doi.org/10.1007/11564751_55.
  6. Arthur Bit-Monnot. Aries Git Repository. https://github.com/plaans/aries, 2019.
  7. Arthur Bit-Monnot. Enhancing Hybrid CP-SAT Search for Disjunctive Scheduling. In Proceedings of the 26th European Conference on Artificial Intelligence (ECAI), pages 255-262, 2023. URL: https://doi.org/10.3233/FAIA230278.
  8. Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, and Lakhdar Sais. Boosting Systematic Search by Weighting Constraints. In Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI), pages 146-150, 2004. Google Scholar
  9. Peter Brucker, Johann Hurink, Bernd Jurisch, and Birgit Wöstmann. A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics, 76(1):43-59, 1997. URL: https://doi.org/10.1016/S0166-218X(96)00116-3.
  10. Jacques Carlier and Eric Pinson. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78(2):146-161, 1994. Project Management and Scheduling. Google Scholar
  11. Anthony Caumond, Philippe Lacomme, and Nikolay Tchernev. A memetic algorithm for the job-shop with time-lags. Computers & Operations Research, 35(7):2331-2356, 2008. URL: https://doi.org/10.1016/J.COR.2006.11.007.
  12. Geoffrey Chu, Peter J. Stuckey, Andreas Schutt, Thorsten Ehlers, Graeme Gange, and Kathryn Francis. Chuffed Git Repository. https://github.com/chuffed/chuffed, 2016.
  13. Scott Cotton and Oded Maler. Fast and Flexible Difference Constraint Propagation for DPLL(T). In Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 170-183, 2006. URL: https://doi.org/10.1007/11814948_19.
  14. Toby O. Davies, Frédéric Didier, and Laurent Perron. ViolationLS: Constraint-Based Local Search in CP-SAT. In Proceedings of the 21st International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR), pages 243-258, 2024. URL: https://doi.org/10.1007/978-3-031-60597-0_16.
  15. Ebru Demirkol, Sanjay Mehta, and Reha Uzsoy. Benchmarks for shop scheduling problems. European Journal of Operational Research, 109(1):137-141, 1998. URL: https://doi.org/10.1016/S0377-2217(97)00019-2.
  16. Thibaut Feydy, Andreas Schutt, and Peter J. Stuckey. Global difference constraint propagation for finite domain solvers. In Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), pages 226-235, 2008. URL: https://doi.org/10.1145/1389449.1389478.
  17. Thibaut Feydy and Peter J. Stuckey. Lazy Clause Generation Reengineered. In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP), pages 352-366, 2009. URL: https://doi.org/10.1007/978-3-642-04244-7_29.
  18. H. 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, 1963. Google Scholar
  19. Daniel Frost and Rina Dechter. Dead-End Driven Learning. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI), pages 294-300, 1994. URL: http://www.aaai.org/Library/AAAI/1994/aaai94-045.php.
  20. Diarmuid Grimes and Emmanuel Hebrard. Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search. INFORMS J. Comput., 27(2):268-284, 2015. URL: https://doi.org/10.1287/IJOC.2014.0625.
  21. Diarmuid Grimes, Emmanuel Hebrard, and Arnaud Malapert. Closing the Open Shop: Contradicting Conventional Wisdom. In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP), pages 400-408, 2009. URL: https://doi.org/10.1007/978-3-642-04244-7_33.
  22. Christelle Guéret and Christian Prins. A new lower bound for the open‐shop problem. Annals of Operations Research, 92:165-183, 1999. URL: https://doi.org/10.1023/A%3A1018930613891.
  23. Emmanuel Hebrard. Tempo. Software, (visited on 2025-07-23). URL: https://gitlab.laas.fr/roc/emmanuel-hebrard/tempo
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.24099
  24. IBM. IBM ILOG CP Optimizer website. URL: https://www.ibm.com/fr-fr/products/ilog-cplex-optimization-studio/cplex-cp-optimizer.
  25. George Katsirelos and Fahiem Bacchus. Unrestricted Nogood Recording in CSP Search. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP), pages 873-877, 2003. URL: https://doi.org/10.1007/978-3-540-45193-8_70.
  26. George Katsirelos and Fahiem Bacchus. Generalized nogoods in csps. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), pages 390-396, 2005. URL: http://www.aaai.org/Library/AAAI/2005/aaai05-062.php.
  27. Philippe Laborie. Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artif. Intell., 143(2):151-188, 2003. URL: https://doi.org/10.1016/S0004-3702(02)00362-4.
  28. Philippe Laborie and Danièle Godard. Self-Adapting Large Neighborhood Search: Application to Single-Mode Scheduling Problems. In Proceedings of MISTA, 2007. Google Scholar
  29. Philippe Laborie, Jerome Rogerie, Paul Shaw, and Petr Vilím. IBM ILOG CP optimizer for scheduling - 20+ years of scheduling with constraints at IBM/ILOG. Constraints An Int. J., 23(2):210-250, 2018. URL: https://doi.org/10.1007/S10601-018-9281-X.
  30. S. Lawrence. An Experimental Investigation of Heuristic Scheduling Techniques (Supplement). PhD thesis, Carnegie Mellon University, 1984. Google Scholar
  31. Christophe Lecoutre. ACE Git Repository. https://github.com/xcsp3team/ACE, 2024.
  32. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, and Vincent Vidal. Nogood recording from restarts. In IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pages 131-136, 2007. URL: http://ijcai.org/Proceedings/07/Papers/019.pdf.
  33. Jia Hui Liang, Vijay Ganesh, Pascal Poupart, and Krzysztof Czarnecki. Learning rate based branching heuristic for sat solvers. In Proceedings of the 19th International conference on Theory and Applications of Satisfiability Testing (SAT), pages 123-140, 2016. URL: https://doi.org/10.1007/978-3-319-40970-2_9.
  34. J.P. Marques-Silva and K.A. Sakallah. GRASP - A new search algorithm for satisfiability. In Proceedings of the International Conference on Computer Aided Design (ICCAD), pages 220-227, 1996. Google Scholar
  35. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: engineering an efficient sat solver. In Proceedings of the 38th Design Automation Conference (DAC), pages 530-535, 2001. URL: https://doi.org/10.1145/378239.379017.
  36. Olga Ohrimenko, Peter J. Stuckey, and Michael Codish. Propagation = Lazy Clause Generation. In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP), pages 544-558, 2007. URL: https://doi.org/10.1007/978-3-540-74970-7_39.
  37. Laurent Perron, Frédéric Didier, and Steven Gay. OR-Tools Git Repository. https://github.com/google/or-tools, 2016.
  38. Laurent Perron, Frédéric Didier, and Steven Gay. The CP-SAT-LP Solver. In Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP), pages 3:1-3:2, 2023. Google Scholar
  39. Diego Olivier Fernandez Pons and Petr Vilím. OptalCP website. https://optalcp.com, 2023.
  40. Charles Prud'homme and Jean-Guillaume Fages. Choco-solver: A Java library for constraint programming. Journal of Open Source Software, 7(78):4708, 2022. URL: https://doi.org/10.21105/JOSS.04708.
  41. Charles Prud'homme and Jean-Guillaume Fages. Choco-solver website. https://choco-solver.org, 2022.
  42. Philippe Refalo. Impact-Based Search Strategies for Constraint Programming. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP), pages 557-571, 2004. URL: https://doi.org/10.1007/978-3-540-30201-8_41.
  43. Thomas Schiex and Gérard Verfaillie. Nogood Recording for static and dynamic constraint satisfaction problems. In Proceedings of 1993 IEEE Conference on Tools with AI (ICTAI), pages 48-55, 1993. URL: https://doi.org/10.1109/TAI.1993.633935.
  44. Christian Schulte, Guido Tack, and Mikael Zayenz Lagerkvist. Gecode website. https://www.gecode.org/index.html, 2002.
  45. Andreas Schutt, Thibaut Feydy, and Peter J. Stuckey. Scheduling Optional Tasks with Explanation. In Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming (CP), pages 628-644, 2013. URL: https://doi.org/10.1007/978-3-642-40627-0_47.
  46. Andreas Schutt and Peter J. Stuckey. Explaining Producer/Consumer Constraints. In Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP), pages 438-454, 2016. URL: https://doi.org/10.1007/978-3-319-44953-1_28.
  47. Paul Shaw. Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP), pages 417-431, 1998. URL: https://doi.org/10.1007/3-540-49481-2_30.
  48. Mohamed Siala, Christian Artigues, and Emmanuel Hebrard. Two Clause Learning Approaches for Disjunctive Scheduling. In Proceedings of the 21st International Conference on Principles and Practice of Constraint Programming (CP), pages 393-402, 2015. URL: https://doi.org/10.1007/978-3-319-23219-5_28.
  49. 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
  50. E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2):278-285, 1993. Google Scholar
  51. Petr Vilím. O(n log n) Filtering Algorithms for Unary Resource Constraint. In Proceedings of the 1st International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR), pages 335-347, 2004. URL: https://doi.org/10.1007/978-3-540-24664-0_23.
  52. Petr Vilím. Global Constraints in Scheduling. PhD thesis, Charles University in Prague, Faculty of Mathematics and Physics, Department of Theoretical Computer Science and Mathematical Logic, KTIML MFF, Universita Karlova, Malostranské náměstí 2/25, 118 00 Praha 1, Czech Republic, August 2007. URL: http://vilim.eu/petr/disertace.pdf.
  53. Petr Vilím. CP solver design for maximum CPU utilization (invited talk). In Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP), pages 5:1-5:1, 2023. URL: https://doi.org/10.4230/LIPICS.CP.2023.5.
  54. Petr Vilím, Philippe Laborie, and Paul Shaw. Failure-Directed Search for Constraint-Based Scheduling. In Proceedings of the 12th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR), pages 437-453, 2015. URL: https://doi.org/10.1007/978-3-319-18008-3_30.
  55. Takeshi Yamada and Ryohei Nakano. A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems. In Parallel Problem Solving from Nature, 1992. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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