A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem.
Eric AngelEvripidis BampisPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- single machine
- total weighted tardiness
- scheduling problem
- makespan minimization
- processing times
- sequence dependent setup times
- np hard
- single machine scheduling problem
- job shop scheduling problem
- parallel machines
- lagrangian relaxation
- dynamic programming
- maximum lateness
- flowshop
- release dates
- setup times
- job shop
- precedence constraints
- production scheduling
- computational complexity
- worst case
- tabu search
- cost function
- simulated annealing
- variable neighborhood search
- objective function
- lot sizing
- multistage