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…