Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines.
Michael H. GoldwasserMark PedigoPublished in: SWAT (2006)
Keyphrases
- preemptive scheduling
- equal length
- identical machines
- processing times
- single machine to minimize
- single machine
- precedence constraints
- job scheduling
- scheduling problem
- dynamic programming
- release dates
- scheduling jobs
- reinforcement learning
- branch and bound algorithm
- online algorithms
- polynomial time approximation