The Power of Reordering for Online Minimum Makespan Scheduling.
Matthias EnglertDeniz ÖzmenMatthias WestermannPublished in: FOCS (2008)
Keyphrases
- scheduling problem
- scheduling jobs
- release dates
- batch processing
- unrelated parallel machines
- online learning
- single machine
- power consumption
- processing times
- setup times
- permutation flowshop
- parallel machines
- round robin
- flexible manufacturing systems
- batch processing machines
- maximum lateness
- neural network
- dynamic scheduling
- production scheduling
- resource allocation
- tabu search
- lower bound
- website