On the Optimal Cutting of Defective Sheets

Susan G. Hahn
Additional contact information
Susan G. Hahn: IBM Corporation, New York, New York

Operations Research, 1968, vol. 16, issue 6, 1100-1114

Abstract: A method is developed for cutting up sheets with defective areas into given pieces while minimizing waste. The sheets, the pieces, and the defects are all rectangles, these latter to be identified by the coordinates of two opposite corners in a coordinate system attached to the sheet. The cutting is done in in three stages. If the length of the sheet is along the x -axis, the first cuts are made parallel to the y -axis, obtaining “sections.” The sections are then cut into “strips” parallel to the x -axis, and, finally, the strips into “pieces” parallel to the y -axis. The procedure uses dynamic programming, which requires a value to be attached to each size. The computer program senses the defects and fits pieces into the clear portion of the sheet in such a way that the total value is a maximum. In order to shorten machine time, some simplifying shortcuts are made.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.6.1100 (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:16:y:1968:i:6:p:1100-1114

Access Statistics for this article

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