A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine.
Lars RohwedderAndreas WiesePublished in: CoRR (2020)
Keyphrases
- single machine
- scheduling problem
- competitive ratio
- dynamic programming
- total weighted tardiness
- computational complexity
- np hard
- single machine scheduling problem
- objective function
- error bounds
- learning algorithm
- approximation ratio
- shortest processing time
- number of late jobs
- earliness tardiness
- weighted tardiness
- graph model
- processing times
- particle swarm optimization
- worst case
- weighted sum
- parallel machines
- lower and upper bounds
- approximation algorithms
- convergence rate
- combinatorial optimization
- simulated annealing