Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

P. Y. Wang
Additional contact information
P. Y. Wang: University of Maryland-Baltimore County, Catonsville, Maryland

Operations Research, 1983, vol. 31, issue 3, 573-586

Abstract: We propose two combinatoric methods that generate constrained cutting patterns by successive horizontal and vertical builds of ordered rectangles. Each of the algorithms uses a parameter to bound the maximum acceptable percentages of waste they create. Error bounds measure how close the pattern wastes are to the waste of the optimal solution. We also discuss computational results and applications of the methods to a general cutting stock problem.

Keywords: 582; algorithms; for; two-dimensional; cutting; stock; problems (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (47)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.3.573 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:31:y:1983:i:3:p:573-586

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().