Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date.
Imed KacemPublished in: Discret. Appl. Math. (2010)
Keyphrases
- polynomial time approximation
- total weighted tardiness
- np hard
- approximation algorithms
- single machine
- error bounds
- scheduling problem
- lagrangian relaxation
- bin packing
- processing times
- parallel machines
- lower bound
- job shop scheduling problem
- single machine scheduling problem
- branch and bound algorithm
- setup times
- job shop
- tardiness cost
- release dates
- flowshop
- special case