A polynomial time approximation scheme for a single machine scheduling problem using a hybrid evolutionary algorithm.
Boris MitavskiyJun HePublished in: IEEE Congress on Evolutionary Computation (2012)
Keyphrases
- polynomial time approximation
- single machine scheduling problem
- np hard
- approximation algorithms
- branch and bound algorithm
- error bounds
- precedence constraints
- bin packing
- release dates
- processing times
- lagrangian relaxation
- setup times
- combinatorial optimization
- branch and bound
- single machine
- search algorithm
- resource consumption
- dynamic programming
- computational complexity