An iterative heuristic for the single machine dynamic total completion time scheduling problem.
Suresh ChandRodney TraubReha UzsoyPublished in: Comput. Oper. Res. (1996)
Keyphrases
- single machine
- scheduling problem
- release times
- scheduling jobs
- rolling horizon
- tabu search
- processing times
- earliness tardiness
- maximum lateness
- dynamic programming
- dominance rules
- job shop scheduling problem
- total tardiness
- completion times
- release dates
- total weighted tardiness
- setup times
- sequence dependent setup times
- job processing times
- flowshop
- np hard
- minimize total
- learning effect
- parallel machines
- weighted tardiness
- precedence constraints
- production scheduling
- number of late jobs
- weighted number of tardy jobs
- simulated annealing
- minimizing makespan
- competitive ratio
- strongly np hard
- optimal solution
- single machine scheduling problem
- search algorithm
- makespan minimization
- asymptotic optimality
- deteriorating jobs
- search procedure