Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty.
Ghasem MoslehiKamran KianfarPublished in: J. Appl. Math. (2014)
Keyphrases
- approximation algorithms
- single machine
- scheduling problem
- np hard
- processing times
- minimize total
- scheduling jobs
- total weighted tardiness
- special case
- sequence dependent setup times
- single machine scheduling problem
- worst case
- np hardness
- minimum cost
- number of tardy jobs
- production scheduling
- dynamic programming
- constant factor
- flowshop
- approximation ratio
- release dates
- objective function
- polynomial time approximation
- precedence constraints
- search space
- competitive ratio
- optimal solution
- integer programming
- approximation guarantees
- linear programming
- completion times
- lower bound
- parallel machines
- computational complexity
- combinatorial auctions