An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling.
Gábor GalambosGerhard J. WoegingerPublished in: SIAM J. Comput. (1993)
Keyphrases
- list scheduling
- worst case
- scheduling problem
- np hard
- parallel machines
- average case
- single machine
- error bounds
- approximation algorithms
- upper bound
- lower bound
- tabu search
- standard deviation
- greedy algorithm
- optimization problems
- constraint satisfaction problems
- optimal solution
- response time
- computing systems
- running times
- unrelated parallel machines
- computational complexity