Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time.
Jatin BatraNaveen GargAmit KumarPublished in: FOCS (2018)
Keyphrases
- convex hull
- single machine
- constant factor approximation algorithm
- scheduling problem
- completion times
- number of late jobs
- processing times
- total weighted tardiness
- earliness tardiness
- maximum lateness
- release times
- release dates
- shortest processing time
- total tardiness
- feasible solution
- minimize total
- learning effect
- scheduling jobs
- lagrangian relaxation
- weighted number of tardy jobs
- competitive ratio
- constant factor
- lower bound
- single machine scheduling problem
- dynamic programming
- sequence dependent setup times
- identical machines
- polynomially solvable
- special case
- setup times
- weighted sum
- np hard
- np complete
- approximation algorithms
- training set