Scheduling on identical machines: How good is LPT in an on-line setting?

Bo Chen Arjen P. A. Vestjens

Published in: Oper. Res. Lett. (1997)

Keyphrases

identical machines
polynomial time approximation
processing times
job scheduling
scheduling problem
single machine
np hard
approximation algorithms
error bounds
precedence constraints
scheduling jobs
worst case
linear programming
np complete
approximation guarantees