Login / Signup
On the complexity of minimizing the number of late jobs in unit time open shop.
Svetlana A. Kravchenko
Published in:
Discret. Appl. Math. (2000)
Keyphrases
</>
open shop
number of late jobs
completion times
job shop
release times
single machine
approximation algorithms
scheduling problem
multistage
weighted sum
computational complexity
worst case
special case
sensor networks
markov chain
constraint satisfaction problems