Login / Signup
A note on the proof of the complexity of the little-preemptive open-shop problem.
Evgeny V. Shchepin
Nodari Vakhania
Published in:
Ann. Oper. Res. (2011)
Keyphrases
</>
open shop
job shop
scheduling problem
approximation algorithms
evolutionary computation