CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem

In three linesAcademic paper combining Dynamic Programming (DP) and Constraint Programming (CP) to solve the Partial Shop Scheduling Problem. DP serves as primary search framework while CP leverages global constraint propagation. The approach integrates anytime strategies and Large Neighborhood Search schemes.

Summary generated by Claude — human-verified