The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers

DOI10.1111/itor.12648OpenAlexW2919434846WikidataQ122112911 ScholiaQ122112911MaRDI QIDQ6069766

Unnamed Author, Débora P. Ronconi, Ernesto G. Birgin

Publication date: 17 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12648

zbMATH Keywords

MIP modelsusable leftoversmultiperiod scenarionon-guillotine cutting and packing

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (6)

Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem ⋮ Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches

Cites Work

• An integer programming model for two- and three-stage two-dimensional cutting stock problems
• Near-optimal solutions to one-dimensional cutting stock problems
• Foundations of bilevel programming
• Symmetry-breaking constraints for packing identical rectangles within polyhedra
• The one-dimensional cutting stock problem with usable leftovers -- a survey
• One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
• Two-stage two-dimensional guillotine cutting stock problems with usable leftover
• Integer linear programming for a cutting problem in the wood-processing industry: a case study
• A New Linear Programming Approach to the Cutting Stock Problem
• A note on handling residual lengths
• The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic
• An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
• Linear models for 1-group two-dimensional guillotine cutting problems
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries

This page was built for publication: The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers