A PTAS for Minimizing Weighted Flow Time on a Single Machine.
Alexander ArmbrusterLars RohwedderAndreas WiesePublished in: CoRR (2022)
Keyphrases
- single machine
- completion times
- weighted number of tardy jobs
- scheduling problem
- number of tardy jobs
- processing times
- maximum lateness
- total weighted tardiness
- number of late jobs
- earliness tardiness
- single machine scheduling problem
- minimize total
- release times
- weighted tardiness
- scheduling jobs
- dynamic programming
- release dates
- learning effect
- sequence dependent setup times
- production scheduling
- shortest processing time
- competitive ratio
- weighted sum
- np hard
- total tardiness
- flowshop
- approximation algorithms
- setup times
- polynomial time approximation
- special case
- rolling horizon
- simulated annealing