An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates.
George KarakostasStavros G. KolliopoulosJing WangPublished in: ACM Trans. Algorithms (2012)
Keyphrases
- fixed number
- weighted tardiness
- processing times
- single machine
- single machine scheduling problem
- minimize total
- setup times
- scheduling problem
- parallel machines
- tabu search
- sequence dependent setup times
- finite number
- release dates
- job shop scheduling problem
- approximation algorithms
- flowshop
- genetic algorithm
- lot sizing
- lagrangian relaxation
- long run
- resource allocation
- supply chain
- np hard