A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine.
Gokhan KirlikCeyda OguzPublished in: Comput. Oper. Res. (2012)
Keyphrases
- total weighted tardiness
- single machine
- sequence dependent setup times
- variable neighborhood search
- single machine scheduling problem
- scheduling problem
- release dates
- processing times
- maximum lateness
- setup times
- parallel machines
- flowshop
- dynamic programming
- lot sizing
- precedence constraints
- traveling salesman problem
- branch and bound algorithm
- graph model
- linear programming
- upper bound