A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk
A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk
M. Urgo,J. Váncza,J. Váncza
2018 · DOI: 10.1007/S10696-018-9316-Z
Flexible Services and Manufacturing Journal · 20 Citations
TLDR
A novel approach for protecting the quality of a schedule by assessing the risk associated to the different scheduling decisions is presented, applied to a stochastic scheduling problem with a set of jobs to be sequenced on a single machine.