Robust preemptive scheduling on unrelated parallel machines under uncertain processing times.
Widad NajiVan-Dat CungMarie-Laure EspinousePublished in: CoDIT (2017)
Keyphrases
- processing times
- unrelated parallel machines
- scheduling problem
- setup times
- scheduling jobs
- preemptive scheduling
- single machine
- flowshop
- completion times
- parallel machines
- single machine scheduling problem
- release dates
- identical parallel machines
- precedence constraints
- np hard
- identical machines
- sequence dependent setup times
- tabu search
- release times
- competitive ratio
- polynomially solvable
- search algorithm