Minimizing the total weighted flow time in a single machine with controllable processing times.
Dvir ShabtayMoshe KaspiPublished in: Comput. Oper. Res. (2004)
Keyphrases
- single machine
- completion times
- scheduling problem
- release times
- weighted number of tardy jobs
- processing times
- earliness tardiness
- total weighted tardiness
- minimize total
- single machine scheduling problem
- total tardiness
- release dates
- sequence dependent setup times
- maximum lateness
- scheduling jobs
- number of late jobs
- number of tardy jobs
- production scheduling
- learning effect
- competitive ratio
- dynamic programming
- weighted tardiness
- np hard
- identical machines
- deteriorating jobs
- rolling horizon
- job processing times
- setup times
- precedence constraints
- genetic algorithm
- shortest processing time