On a "No Arrivals" Heuristic for Single Machine Stochastic Scheduling.
N. A. FayKevin D. GlazebrookPublished in: Oper. Res. (1992)
Keyphrases
- single machine
- scheduling jobs
- scheduling problem
- rolling horizon
- minimize total
- maximum lateness
- release dates
- release times
- processing times
- number of tardy jobs
- sequence dependent setup times
- total weighted tardiness
- weighted tardiness
- tabu search
- state dependent
- deteriorating jobs
- earliness tardiness
- parallel machines
- job shop scheduling problem
- dynamic programming
- flowshop
- setup times
- production scheduling
- lot sizing
- learning effect
- np hard
- precedence constraints
- strongly np hard
- single machine scheduling problem
- competitive ratio
- job shop scheduling
- weighted number of tardy jobs
- completion times
- single server
- production system
- number of late jobs
- job processing times
- special case
- batch processing
- simulated annealing
- optimal solution
- reinforcement learning