Login / Signup
A note on the complexity of flow-shop scheduling with deteriorating jobs.
Karin Thörnblad
Michael Patriksson
Published in:
Discret. Appl. Math. (2011)
Keyphrases
</>
deteriorating jobs
computational complexity
single machine
scheduling problem
worst case