Optimal non-preemptive semi-online scheduling on two related machines.
Leah EpsteinLene M. FavrholdtPublished in: J. Algorithms (2005)
Keyphrases
- scheduling problem
- scheduling algorithm
- flowshop
- online learning
- parallel machines
- capacity allocation
- optimal scheduling
- identical parallel machines
- competitive ratio
- online algorithms
- closely related
- worst case
- lower bound
- optimal solution
- single machine
- closed form
- asymptotically optimal
- real time database systems
- scheduling policies
- flexible manufacturing systems
- evolutionary algorithm
- manufacturing cell