Approximation algorithms for minimizing the total weighted tardiness on a single machine.
Stavros G. KolliopoulosGeorge SteinerPublished in: Theor. Comput. Sci. (2006)
Keyphrases
- approximation algorithms
- total weighted tardiness
- single machine
- scheduling problem
- np hard
- completion times
- special case
- processing times
- sequence dependent setup times
- release dates
- maximum lateness
- lagrangian relaxation
- worst case
- minimum cost
- dynamic programming
- setup times
- job shop scheduling problem
- single machine scheduling problem
- production scheduling
- flowshop
- precedence constraints
- parallel machines
- exact algorithms
- tabu search
- combinatorial auctions
- job shop scheduling
- branch and bound algorithm
- polynomial time approximation