The cutting stock problem in the canvas industry

DOI10.1016/0377-2217(90)90360-NzbMath0684.90080OpenAlexW2081973015MaRDI QIDQ1825765

Alan A. Farley

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90360-n

zbMATH Keywords

heuristicscutting stockcanvas industrytextile industrythree-stage Gilmore-Gomory algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Production models (90B30) Combinatorial optimization (90C27)

Related Items (9)

An interactive technique for the cutting stock problem with multiple objectives ⋮ The nesting problem in the leather manufacturing industry ⋮ An exact algorithm for general, orthogonal, two-dimensional knapsack problems ⋮ Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ Heuristic methods for gang-rip saw arbor design. ⋮ Limiting the number of each piece in two-dimensional cutting stock patterns ⋮ Modified greedy heuristic for the one-dimensional cutting stock problem ⋮ Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations ⋮ A column generation procedure for gang-rip saw arbor design and scheduling

Cites Work

• Unnamed Item
• Trim-loss pattern rearrangement and its relevance to the flat-glass industry
• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
• Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
• A Linear Programming Approach to the Cutting-Stock Problem
• Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm
• A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape
• A Frequency Approach to the One-dimensional Cutting Problem for Carpet Rolls
• Glass cutting in a small firm
• 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: The cutting stock problem in the canvas industry