Online Minimum Makespan Scheduling with a Buffer.
Yan LanXin ChenNing DingGyörgy DósaXin HanPublished in: FAW-AAIM (2012)
Keyphrases
- scheduling problem
- batch processing
- scheduling jobs
- online learning
- unrelated parallel machines
- release dates
- single machine
- deteriorating jobs
- flowshop
- job shop
- np hard
- scheduling algorithm
- job shop scheduling
- processing times
- parallel machines
- real time
- strongly np hard
- unit length
- online environment
- setup times
- parallel processors
- round robin
- job shop scheduling problem
- resource allocation
- optimal solution