4 papers · 1 filter
Solving the Aircraft Disassembly Scheduling Problem
Charles Thomas, Pierre Schaus
Dismantling aircrafts reaching their end of life is a complex endeavour that is necessary in terms of sustainability but yields small income margins for air transport companies. An…
CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem
Emma Legrand, Roger Kameugne, Pierre Schaus
Dynamic Programming (DP) and Constraint Programming (CP) are well-established paradigms for solving combinatorial optimization problems. Usually, these two approaches are used sepa…
Implementing Cumulative Functions with Generalized Cumulative Constraints
Pierre Schaus, Charles Thomas, Roger Kameugne
Modeling scheduling problems with conditional time intervals and cumulative functions has become a common approach when using modern commercial constraint programming solvers. This…
Sequence Variables: A Constraint Programming Computational Domain for Routing and Sequencing
Augustin Delecluse, Pierre Schaus, Pascal Van Hentenryck
Constraint Programming (CP) offers an intuitive, declarative framework for modeling Vehicle Routing Problems (VRP), yet classical CP models based on successor variables cannot alwa…