Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval.
Hans KellererMikhail A. KubzinVitaly A. StrusevichPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- single machine
- approximation algorithms
- weighted number of tardy jobs
- scheduling problem
- np hard
- processing times
- maximum lateness
- release dates
- release times
- total weighted tardiness
- constant factor
- special case
- precedence constraints
- worst case
- completion times
- sequence dependent setup times
- learning effect
- scheduling jobs
- minimum cost
- single machine scheduling problem
- competitive ratio
- dynamic programming
- approximation guarantees
- approximation ratio
- strongly np hard
- production scheduling
- setup times
- optimal solution
- parallel machines
- integer programming
- flowshop
- lower bound