A time-indexed MIP for order acceptance and capacitated job shop scheduling is shown to prove optimality for many large instances when capacity is loose, with tighter capacities remaining hard.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Order acceptance and scheduling in capacitated job shops
A time-indexed MIP for order acceptance and capacitated job shop scheduling is shown to prove optimality for many large instances when capacity is loose, with tighter capacities remaining hard.