Generating optimal cutting patterns for rectangular blanks of a single size

Y Cui () and R Zhou
Additional contact information
Y Cui: CAD/CAM Engineering Research Center, Nanjing University of Aeronautics and Astronautics
R Zhou: CAD/CAM Engineering Research Center, Nanjing University of Aeronautics and Astronautics

Journal of the Operational Research Society, 2002, vol. 53, issue 12, 1338-1346

Abstract: Abstract This paper deals with the problem of minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts. First we prove that we can obtain the unconstrained optimal layout by searching among normal multi-section layouts. Next we present an unconstrained algorithm to search for it. The unconstrained algorithm uses a branch-and-bound method with a tight upper bound. Later we discuss the algorithm for the constrained problem where the blank demand must be met exactly. Finally, the unconstrained algorithm is extended to cope with the blade length constraint. Experimental computations show that the algorithms are extremely efficient.

Keywords: cutting stock problem; packing; optimization; pallet loading problem; manufacturing (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601451 Abstract (text/html)
Access to full text is restricted to subscribers.

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:pal:jorsoc:v:53:y:2002:i:12:d:10.1057_palgrave.jors.2601451

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601451

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().