One-dimensional cutting stock optimization in consecutive time periods
From MaRDI portal
Publication:858441
DOI10.1016/j.ejor.2006.03.027zbMath1180.90322OpenAlexW3123321822MaRDI QIDQ858441
Publication date: 9 January 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.027
optimizationcuttingcutting stock over consecutive time periodscutting stock problems with return to stockgeneral one-dimensional cutting stock problem
Related Items (17)
Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ One-dimensional stock cutting: optimization of usable leftovers in consecutive orders ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ On the cutting stock problem under stochastic demand ⋮ Heuristic algorithms based on column generation for an online product shipping problem ⋮ A stochastic programming approach to the cutting stock problem with usable leftovers ⋮ A reinforcement learning approach to the stochastic cutting stock problem ⋮ Trim loss optimization by an improved differential evolution ⋮ Renovation of the cutting stock process ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ The one-dimensional cutting stock problem with sequence-dependent cut losses ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders ⋮ An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing ⋮ Integer linear programming for a cutting problem in the wood-processing industry: a case study ⋮ The one-dimensional cutting stock problem with due dates ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey
Cites Work
- Unnamed Item
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- A sequential heuristic procedure for one-dimensional cutting
- An algorithm for the determination of optimal cutting patterns
- Optimization of roll cutting in clothing industry
- A new model for complete solutions to one-dimensional cutting stock problems.
- Improving competitiveness in veneers production by a simple-to-use DSS.
- Row and column generation technique for a multistage cutting stock problem
- Evaluation of algorithms for one-dimensional cutting
- A combined approach to the solution to the general one-dimensional cutting stock problem
- A typology of cutting and packing problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- One-dimensional cutting stock problem to minimize the number of different patterns
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A Linear Programming Approach to the Cutting-Stock Problem
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
- A Linear Programming Approach to the Cutting Stock Problem—Part II
This page was built for publication: One-dimensional cutting stock optimization in consecutive time periods
