The Power of Reordering for Online Minimum Makespan Scheduling.
Matthias EnglertDeniz ÖzmenMatthias WestermannPublished in: SIAM J. Comput. (2014)
Keyphrases
- scheduling problem
- online learning
- release dates
- lower bound
- batch processing
- scheduling jobs
- unrelated parallel machines
- neural network
- flowshop
- processing times
- deteriorating jobs
- job shop scheduling problem
- precedence constraints
- single machine
- job shop
- unit length
- optimal solution
- setup times
- parallel machines
- scheduling algorithm
- preventive maintenance
- round robin
- power consumption
- batch processing machines