On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times.
Céline GicquelMichel MinouxYves DalleryPublished in: Oper. Res. Lett. (2009)
Keyphrases
- scheduling problem
- lot sizing
- setup times
- single machine
- rolling horizon
- multi item
- flowshop
- multistage
- processing times
- sequence dependent setup times
- tabu search
- single item
- cutting stock
- precedence constraints
- mixed integer
- production planning
- np hard
- mixed integer programming
- parallel machines
- lead time
- inventory systems
- release dates
- assembly systems
- supplier selection
- planning horizon
- mixed integer program
- single machine scheduling problem
- fixed cost
- feasible solution