A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine.
Gabriella SteccoJean-François CordeauElena MorettiPublished in: J. Sched. (2009)
Keyphrases
- single machine
- scheduling problem
- earliness tardiness
- total weighted tardiness
- maximum lateness
- total tardiness
- processing times
- release times
- tabu search
- sequence dependent setup times
- minimize total
- scheduling jobs
- flowshop
- release dates
- precedence constraints
- weighted tardiness
- weighted number of tardy jobs
- setup times
- np hard
- rolling horizon
- parallel machines
- vehicle routing problem
- learning effect
- competitive ratio
- single machine scheduling problem
- job shop scheduling problem
- dynamic programming
- production scheduling
- makespan minimization
- minimizing makespan