Iterative CP with tailored heuristics solves preemptive jobshop scheduling under maximum workload constraints more effectively than IBM CP Optimizer on benchmark instances.
An efficient constraint programming approach to preemptive job shop scheduling
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An iterative Constraint Programming approach to integrate maximum workload constraints in preemptive jobshop scheduling
Iterative CP with tailored heuristics solves preemptive jobshop scheduling under maximum workload constraints more effectively than IBM CP Optimizer on benchmark instances.