Improved lower bounds for the capacitated lot sizing problem with setup times.
Raf JansZeger DegraevePublished in: Oper. Res. Lett. (2004)
Keyphrases
- setup times
- lower bound
- multi item
- scheduling problem
- lagrangian relaxation
- strongly np hard
- lot sizing
- upper bound
- branch and bound algorithm
- processing times
- precedence constraints
- flowshop
- np hard
- single machine
- single machine scheduling problem
- lower and upper bounds
- parallel machines
- single server
- branch and bound
- manufacturing cell
- genetic algorithm
- tabu search
- setup cost
- integer programming
- mixed integer programming
- column generation
- multistage
- linear programming
- response time
- search algorithm
- decision making