A linear time approximation scheme for the single machine scheduling problem with controllable processing times.
Monaldo MastrolilliPublished in: J. Algorithms (2006)
Keyphrases
- single machine scheduling problem
- single machine
- weighted tardiness
- release dates
- polynomial time approximation
- scheduling problem
- processing times
- branch and bound algorithm
- approximation algorithms
- combinatorial optimization
- minimize total
- search algorithm
- traveling salesman problem
- web services
- linear programming
- lagrangian relaxation
- precedence constraints
- worst case
- dynamic programming
- search space