Tighter Bounds for LPT Scheduling on Uniform Processors.
Donald K. FriesenPublished in: SIAM J. Comput. (1987)
Keyphrases
- upper bound
- worst case
- lower bound
- parallel processors
- list scheduling
- multiprocessor systems
- upper and lower bounds
- scheduling problem
- scheduling algorithm
- communication delays
- parallel machines
- error bounds
- lower and upper bounds
- parallel algorithm
- precedence constraints
- branch and bound algorithm
- round robin
- average case
- parallel processing
- worst case bounds
- single processor
- parallel computing
- flexible manufacturing systems
- dynamic scheduling
- information systems
- np hard
- approximation algorithms
- greedy algorithm
- branch and bound
- parallel architecture
- resource constraints
- integer programming
- single machine
- resource allocation