Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts.
Rob van SteeJohannes A. La PoutréPublished in: ESA (2002)
Keyphrases
- single machine
- completion times
- weighted number of tardy jobs
- release times
- scheduling problem
- number of tardy jobs
- processing times
- total weighted tardiness
- total tardiness
- minimize total
- job processing times
- single machine scheduling problem
- maximum lateness
- scheduling jobs
- release dates
- rolling horizon
- earliness tardiness
- dynamic programming
- weighted tardiness
- sequence dependent setup times
- learning effect
- number of late jobs
- production scheduling
- setup times
- competitive ratio
- precedence constraints
- lagrangian relaxation
- job shop scheduling problem
- weighted sum
- np hard
- special case