Login / Signup
On the open-shop problem with preemption and minimizing the average completion time.
Heidemarie Bräsel
Holger Hennes
Published in:
Eur. J. Oper. Res. (2004)
Keyphrases
</>
open shop
completion times
parallel machines
single machine
scheduling problem
job shop
weighted sum
approximation algorithms
processing times
single machine scheduling problem
flowshop
multistage
combinatorial optimization
special case
resource allocation
resource consumption