Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods.
Amine MahjoubJihene KaabiYoussef HarrathPublished in: Int. Trans. Oper. Res. (2021)
Keyphrases
- parallel machines
- scheduling problem
- minimize total
- unrelated parallel machines
- total tardiness
- sequence dependent setup times
- precedence constraints
- massively parallel
- lot sizing
- worst case
- average case
- maximum lateness
- dynamic programming
- computational complexity
- parallel processors
- setup times
- error bounds
- identical parallel machines
- weighted tardiness
- np hard