Decomposition methods for the lot-sizing and cutting-stock problems in paper industries
From MaRDI portal
Publication:2293861
DOI10.1016/j.apm.2017.04.010zbMath1480.90022OpenAlexW2604360057MaRDI QIDQ2293861
Franklina Maria Bragion Toledo, Marcos M. Furlan, Aline A. S. Leão
Publication date: 5 February 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2017.04.010
Dantzig-Wolfe decompositionadaptive large neighborhood searchlot-sizing problemcutting problemcolumn generation method
Related Items
An analysis of the integrated lot-sizing and cutting-stock problem formulation, Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process, Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers, A survey of adaptive large neighborhood search algorithms and applications, Two dimensional guillotine cutting stock and scheduling problem in printing industry, The cutting stock problem applied to the hardening process in an automotive spring factory, Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries, An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem, The integrated lot sizing and cutting stock problem in an automotive spring factory, Deterministic model for customized pilot manufacture production with various backplane sizes, A bi-integrated model for coupling lot-sizing and cutting-stock problems
Cites Work
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A linear optimization approach to the combined production planning model
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- The combined cutting stock and lot-sizing problem in industrial processes
- A coupling cutting stock-lot sizing problem in the paper industry
- Knapsack problems with setups
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Reel and sheet cutting at a paper mill
- A combined cutting-stock and lot-sizing problem
- Solving a combined cutting-stock and lot-sizing problem with a column generating procedure
- Mathematical Methods of Organizing and Planning Production
- A Dynamic Stochastic Stock-Cutting Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Scheduling Solutions for the Paper Industry
- Order Allocation for Stock Cutting in the Paper Industry
- A Cutting Stock and Scheduling Problem in the Copper Industry
