Approximation algorithms for scheduling problems with a modified total weighted tardiness objective.
Stavros G. KolliopoulosGeorge SteinerPublished in: Oper. Res. Lett. (2007)
Keyphrases
- approximation algorithms
- scheduling problem
- total weighted tardiness
- np hard
- parallel machine scheduling problem
- single machine
- sequence dependent setup times
- precedence constraints
- processing times
- flowshop
- special case
- job shop scheduling problem
- job shop
- minimum cost
- parallel machines
- lagrangian relaxation
- setup times
- tabu search
- worst case
- single machine scheduling problem
- release dates
- lower bound
- job shop scheduling
- approximation ratio
- completion times
- optimal solution
- primal dual
- set cover
- approximation guarantees
- linear programming
- computational complexity
- knapsack problem
- exact algorithms
- branch and bound algorithm
- integer programming
- production scheduling
- mathematical model
- linear program
- combinatorial auctions