Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover.
Canrong ZhangDandan ZhangTao WuPublished in: Comput. Oper. Res. (2021)
Keyphrases
- lot sizing
- data driven
- setup times
- scheduling problem
- setup cost
- rolling horizon
- multi item
- multistage
- single machine
- single item
- parallel machines
- inventory systems
- planning horizon
- production planning
- assembly systems
- lead time
- cutting stock
- mixed integer
- processing times
- mixed integer program
- mixed integer programming
- fixed cost
- tabu search
- dynamic programming
- precedence constraints
- learning algorithm
- np hard
- search tree
- optimization problems
- supplier selection
- stochastic inventory control
- search space