Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine.
Marjan van den AkkerHan HoogeveenNodari VakhaniaPublished in: ESA (2000)
Keyphrases
- single machine
- scheduling problem
- minimize total
- maximum lateness
- total weighted tardiness
- processing times
- release dates
- earliness tardiness
- total tardiness
- sequence dependent setup times
- release times
- weighted tardiness
- single machine scheduling problem
- scheduling jobs
- objective function
- number of late jobs
- learning effect
- rolling horizon
- dynamic programming
- setup times
- weighted number of tardy jobs
- tabu search
- deteriorating jobs
- completion times
- production scheduling
- linear programming