Improved semi-online makespan scheduling with a reordering buffer.
Hongyang SunRui FanPublished in: Inf. Process. Lett. (2013)
Keyphrases
- scheduling problem
- batch processing
- release dates
- scheduling jobs
- online learning
- processing times
- single machine
- unrelated parallel machines
- parallel machines
- batch processing machines
- permutation flowshop
- flowshop
- np hard
- lower bound
- scheduling algorithm
- buffer allocation
- real time
- online communities
- job shop scheduling problem
- tabu search
- virtual memory
- neural network
- minimizing makespan
- data sets
- job processing times