On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes.

Klaus Jansen Lorant Porkolab

Published in: IPCO (2002)

Keyphrases

approximation schemes
approximation algorithms
special case
np hard
scheduling problem
lower bound
worst case
numerical methods
computational complexity
processing times
computational intelligence
np complete
tabu search
branch and bound algorithm