A note on "Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date".
Kamran KianfarGhasem MoslehiPublished in: Discret. Appl. Math. (2013)
Keyphrases
- polynomial time approximation
- total weighted tardiness
- np hard
- single machine
- approximation algorithms
- error bounds
- lagrangian relaxation
- scheduling problem
- bin packing
- processing times
- job shop scheduling problem
- sequence dependent setup times
- tardiness cost
- special case
- job shop
- branch and bound algorithm
- single machine scheduling problem
- integer programming
- flowshop