Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time.
Jatin BatraNaveen GargAmit KumarPublished in: CoRR (2018)
Keyphrases
- single machine
- constant factor approximation algorithm
- scheduling problem
- completion times
- processing times
- number of late jobs
- earliness tardiness
- total weighted tardiness
- minimize total
- release times
- maximum lateness
- release dates
- shortest processing time
- constant factor
- learning effect
- total tardiness
- scheduling jobs
- dynamic programming
- sequence dependent setup times
- weighted number of tardy jobs
- polynomially solvable
- single machine scheduling problem
- lower bound
- competitive ratio
- weighted sum
- setup times
- special case
- worst case
- approximation algorithms
- computational complexity
- machine learning
- np hard