Login / Signup
The single machine batching problem with identical family setup times to minimize maximum lateness is strongly NP-hard.
L. F. Lu
Jinjiang Yuan
Published in:
Eur. J. Oper. Res. (2007)
Keyphrases
</>
setup times
single machine
maximum lateness
strongly np hard
scheduling problem
completion times
sequence dependent setup times
processing times
release dates
flowshop
scheduling jobs
single machine scheduling problem
precedence constraints
parallel machines
dynamic programming
identical parallel machines