A heuristic for the skiving and cutting stock problem in paper and plastic film industries

DOI10.1111/ITOR.12390OpenAlexW2587655916MaRDI QIDQ6087622FDOQ6087622

Authors:

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

zbMATH Keywords

combinatorial optimizationcutting problemsreel cuttingskiving and cutting stock

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Title not available (Why is that?)
• Selected Topics in Column Generation
• Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
• An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Setup and open-stacks minimization in one-dimensional stock cutting
• Integer linear programming models for the skiving stock problem
• 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
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
• Reel and sheet cutting at a paper mill
• One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
• A heuristic for the one-dimensional cutting stock problem with usable leftover
• Roll assortment optimization in a paper mill: an integer programming approach
• The one-dimensional cutting stock problem with sequence-dependent cut losses
• Sequential heuristic for the two-dimensional bin-packing problem
• A note on handling residual lengths

Cited In (10)

• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
• The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers
• An improved upper bound for the gap of skiving stock instances of the divisible case
• Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
• Improved flow-based formulations for the skiving stock problem
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• 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
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model

This page was built for publication: A heuristic for the skiving and cutting stock problem in paper and plastic film industries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087622)