A heuristic for the skiving and cutting stock problem in paper and plastic film industries
From MaRDI portal
Publication:6087622
DOI10.1111/itor.12390OpenAlexW2587655916MaRDI QIDQ6087622
No author found.
Publication date: 15 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://researchportal.port.ac.uk/portal/en/publications/a-heuristic-for-the-skiving-and-cutting-stock-problem-in-paper-and-plastic-film-industries(3420fb58-5558-403e-9367-7f2854da54b9).html
Related Items
An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case ⋮ Improved flow-based formulations for the skiving stock problem
Cites Work
- Unnamed Item
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Integer linear programming models for the skiving stock problem
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
- Reel and sheet cutting at a paper mill
- Roll assortment optimization in a paper mill: an integer programming approach
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- Sequential heuristic for the two-dimensional bin-packing problem
- A heuristic for the one-dimensional cutting stock problem with usable leftover
- The one-dimensional cutting stock problem with sequence-dependent cut losses
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- A note on handling residual lengths
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
- The skiving stock problem as a counterpart of the cutting stock problem
- Selected Topics in Column Generation
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
