Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost.
Ning MaYa LiuZhili ZhouPublished in: Comput. Oper. Res. (2019)
Keyphrases
- multi period
- setup cost
- production planning
- lot sizing
- integer programming
- multi item
- planning horizon
- total cost
- lead time
- production cost
- lot size
- multistage
- mixed integer programming
- knapsack problem
- holding cost
- column generation
- single item
- linear programming
- mixed integer
- search algorithm
- optimal solution
- valid inequalities
- np hard
- asymptotically optimal
- data envelopment analysis
- routing problem
- facility location
- constraint programming
- facility location problem
- state dependent
- infinite horizon
- special case
- linear program
- supply chain