Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms.
Leslie A. HallAndreas S. SchulzDavid B. ShmoysJoel WeinPublished in: Math. Oper. Res. (1997)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- scheduling problem
- vertex cover
- special case
- worst case
- minimum cost
- set cover
- approximation ratio
- randomized algorithms
- facility location problem
- network design problem
- primal dual
- scheduling algorithm
- completion times
- constant factor
- resource allocation
- np hardness
- integer programming
- open shop
- job shop scheduling
- resource constraints
- approximation schemes
- parallel machines
- parallel processors
- branch and bound algorithm
- disjoint paths