A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions

DOI10.1016/0377-2217(83)90239-4zbMath0521.90057OpenAlexW1989274974MaRDI QIDQ1055340

Alan A. Farley

Publication date: 1983

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90239-4

zbMATH Keywords

cutting stock problemscomputational experimencecutting restrictionstwo-dimensional trim-loss problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Production models (90B30)

Related Items

Practical adaptations of the Gilmore-Gomory approach to cutting stock problems ⋮ Improved heuristics for sequencing cutting patterns ⋮ Limiting the number of each piece in two-dimensional cutting stock patterns ⋮ Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations ⋮ Heuristics for sequencing cutting patterns

Cites Work

• Trim-loss pattern rearrangement and its relevance to the flat-glass industry
• A Linear Programming Approach to the Cutting-Stock Problem
• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions

This page was built for publication: A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions