Optimal preemptive semi-online scheduling to minimize makespan on two related machines.
Leah EpsteinLene M. FavrholdtPublished in: Oper. Res. Lett. (2002)
Keyphrases
- scheduling problem
- scheduling algorithm
- single machine
- identical machines
- optimal scheduling
- flowshop
- identical parallel machines
- manufacturing cell
- online learning
- processing times
- competitive ratio
- closely related
- parallel machines
- optimal solution
- capacity allocation
- resource constraints
- dynamic programming
- parallel processors
- real time
- wafer fabrication
- minimize total
- online algorithms
- power consumption
- genetic algorithm