Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.
Hans KellererThomas TautenhahnGerhard J. WoegingerPublished in: SIAM J. Comput. (1999)
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
- single machine scheduling problem
- release dates
- maximum lateness
- scheduling jobs
- sequence dependent setup times
- learning effect
- minimize total
- weighted tardiness
- number of late jobs
- total tardiness
- production scheduling
- dynamic programming
- job processing times
- setup times
- rolling horizon
- competitive ratio
- flowshop
- deteriorating jobs
- optimal solution