Login / Signup
Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times.
Marjan van den Akker
Han Hoogeveen
Judith Stoef
Published in:
J. Sched. (2018)
Keyphrases
</>
processing times
number of late jobs
single machine
release times
completion times
polynomially solvable
scheduling problem
single machine scheduling problem
release dates
scheduling jobs
setup times
flowshop
worst case performance ratio
resource consumption
learning effect
competitive ratio
sequence dependent setup times
linear combination
computational complexity