Exact Solution of a Simple Cutting Problem

S. Barnett and G. J. Kynch
Additional contact information
S. Barnett: Loughborough University of Technology, Loughborough, Leics., England
G. J. Kynch: Manchester University Institute of Science and Technology, Manchester, England

Operations Research, 1967, vol. 15, issue 6, 1051-1056

Abstract: Recently Gilmore and Gomory have discussed in detail cutting stock problems in two and more dimensions. However the generality of their approach seems to obscure the existence of exact solutions to very simple situations given in this paper. We discuss here the problem of optimal dissection of a large rectangular plane area into smaller rectangles having unit width and integral length so as to obtain the least waste. When the strips are of only one or two sizes the problem is solved completely. It is shown that when the strips are of two different lengths then, if the area being dissected is large enough and the two lengths are relatively prime numbers, strips can be cut so as to leave no remainder. Possible future extensions are suggested.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.6.1051 (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:15:y:1967:i:6:p:1051-1056

Access Statistics for this article

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