A hybrid DP-CP approach for the partial shop scheduling problem that supports arbitrary precedence graphs, anytime column search, and large neighborhood search while reusing the DP model across restarts.
Annals of discrete mathematics , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem
A hybrid DP-CP approach for the partial shop scheduling problem that supports arbitrary precedence graphs, anytime column search, and large neighborhood search while reusing the DP model across restarts.