One-dimensional cutting stock problems and solution procedures

Authors:
Robert W. Haessler
Affiliations:
School of Business, University of Michigan Ann Arbor, MI 48109, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1992

Citing 0
Cited 3

Solving a combined cutting-stock and lot-sizing problem with a column generating procedure

Computers and Operations Research
Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

Computers and Operations Research
A hybrid approach based on genetic algorithms to solve the problem of cutting structural beams in a metalwork company

Journal of Heuristics

Quantified Score

Hi-index	0.98

Visualization

Abstract

This paper provides an introduction to one-dimensional cutting stock problems and solution procedures. The first problem considered requires that both trim loss and pattern changes be controlled. Both linear programming and sequential heuristic procedures are discussed along with the ways they can be used jointly to generate the best possible solutions to this type of problem. Two other important classes of one-dimensional problems are discussed along with ways in which they can be solved.