Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures.
Wiebke von Hoyningen-HueneGudrun P. KiesmüllerPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- parallel machines
- unrelated parallel machines
- scheduling problem
- single machine
- total tardiness
- scheduling jobs
- flowshop
- release dates
- processing times
- open shop
- sequence dependent setup times
- setup times
- minimize total
- weighted tardiness
- parallel machine scheduling problem
- maximum lateness
- special case
- minimizing makespan
- total weighted tardiness
- preventive maintenance
- computational complexity
- np hard
- lower bound