A note on the Coffman-Sethi bound for LPT scheduling.
James D. BlocherSergey SevastyanovPublished in: J. Sched. (2015)
Keyphrases
- worst case
- scheduling problem
- upper bound
- scheduling algorithm
- lower bound
- round robin
- error bounds
- resource constraints
- np hard
- dynamic scheduling
- flexible manufacturing systems
- response time
- parallel processors
- flow control
- approximation algorithms
- database
- minimize total
- project scheduling
- real time database systems
- multiple objectives
- evolutionary algorithm
- computational complexity
- image sequences
- data sets