One-dimensional stock cutting resilient against singular random defects

DOI10.1016/J.COR.2023.106280MaRDI QIDQ6106587zbMATH OpenFDO

Authors Claudio Arbib, Fabrizio Marinelli, Ulrich Pferschy, Fatemeh K. Ranjbar

Publication date 3 July 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/J.COR.2023.106280

zbMATH Keywords

bin packingcutting stockdynamic programmingmixed integer programmingrecoverable defects

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Determining cutting stock patterns when defects are present
• Guillotine cutting of defective boards
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
• Pattern reduction in one-dimensional cutting stock problems

Cites work

• A dynamic stochastic stock-cutting problem
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
• A method for the cutting stock problem with different qualities
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape
• A stochastic programming approach to the cutting stock problem with usable leftovers
• Adaptive Bin Packing with Overflow
• An Algorithm for Two-Dimensional Cutting Problems
• An application of deterministic and robust optimization in the wood cutting industry
• An exact model for a slitting problem in the steel industry
• An improved typology of cutting and packing problems
• An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Determining cutting stock patterns when defects are present
• Exact solution of the robust knapsack problem
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Integer optimization with penalized fractional values: the knapsack case
• Integrated defect detection and optimization for cross cutting of wooden boards
• Knapsack problem with probability constraints
• Mathematical models and decomposition methods for the multiple knapsack problem
• Number of bins and maximum lateness minimization in two-dimensional bin packing
• On the cutting stock problem under stochastic demand
• On the equal-subset-sum problem
• One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
• One-dimensional heuristics adapted for two-dimensional rectangular strip packing
• Production planning in furniture settings via robust optimization
• Setup and open-stacks minimization in one-dimensional stock cutting
• Solving robust bin-packing problems with a branch-and-price approach
• The cutting-wrapping problem in the textile industry: Optimal overlap of fabric lengths and defects for maximizing return based on quality
• The stochastic trim-loss problem
• Two-dimensional guillotineable-layout cutting problems with a single defect -- an AND/OR-graph approach

Cited in

(1)

• Cutting stock problem with usable leftovers: a review

This page was built for publication: One-dimensional stock cutting resilient against singular random defects

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