A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm

Boris Mitavskiy Jun He

Published in: CoRR (2012)

Keyphrases

polynomial time approximation
single machine scheduling problem
np hard
approximation algorithms
branch and bound algorithm
precedence constraints
release dates
error bounds
processing times
setup times
single machine
special case
hybrid algorithm
search procedure
bin packing
quality of service