Minimizing the total completion time on-line on a single machine, using restarts.
Rob van SteeJohannes A. La PoutréPublished in: J. Algorithms (2005)
Keyphrases
- single machine
- completion times
- weighted number of tardy jobs
- release times
- scheduling problem
- number of tardy jobs
- processing times
- total weighted tardiness
- job processing times
- total tardiness
- maximum lateness
- earliness tardiness
- single machine scheduling problem
- learning effect
- release dates
- sequence dependent setup times
- minimize total
- scheduling jobs
- competitive ratio
- number of late jobs
- dynamic programming
- rolling horizon
- constraint satisfaction problems
- precedence constraints
- parallel machines
- parallel computing