)-approximation algorithm for preemptive weighted flow time on a single machine.
Lars RohwedderAndreas WiesePublished in: STOC (2021)
Keyphrases
- single machine
- competitive ratio
- scheduling problem
- total weighted tardiness
- dynamic programming
- objective function
- learning algorithm
- np hard
- search space
- convergence rate
- total tardiness
- processing times
- computational complexity
- linear programming
- convex hull
- lower bound
- sequence dependent setup times
- optimal solution
- approximation ratio
- release dates
- scheduling jobs
- polynomial time approximation
- minimize total
- single machine scheduling problem
- average case
- job shop scheduling problem
- weighted sum
- message passing
- hybrid algorithm
- error bounds