Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.
Hans KellererThomas TautenhahnGerhard J. WoegingerPublished in: STOC (1996)
Keyphrases
- single machine
- completion times
- weighted number of tardy jobs
- release times
- scheduling problem
- number of tardy jobs
- processing times
- earliness tardiness
- total weighted tardiness
- maximum lateness
- minimize total
- total tardiness
- sequence dependent setup times
- single machine scheduling problem
- release dates
- number of late jobs
- job processing times
- dynamic programming
- learning effect
- competitive ratio
- scheduling jobs
- production scheduling
- weighted tardiness
- rolling horizon
- approximation algorithms
- setup times
- deteriorating jobs
- weighted sum