Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times.
Silvio Alexandre de AraujoBert De ReyckZeger DegraeveIoannis FragkosRaf JansPublished in: INFORMS J. Comput. (2015)
Keyphrases
- setup times
- multi item
- scheduling problem
- lot sizing
- single machine
- processing times
- flowshop
- single machine scheduling problem
- planning horizon
- lagrangian relaxation
- manufacturing cell
- single server
- precedence constraints
- parallel machines
- branch and bound algorithm
- dynamic programming
- setup cost
- np hard
- upper bound