IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i12d10.1057_palgrave.jors.2601451.html
   My bibliography  Save this article

Generating optimal cutting patterns for rectangular blanks of a single size

Author

Listed:
  • 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)

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.

Suggested Citation

  • Y Cui & R Zhou, 2002. "Generating optimal cutting patterns for rectangular blanks of a single size," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(12), pages 1338-1346, December.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:12:d:10.1057_palgrave.jors.2601451
    DOI: 10.1057/palgrave.jors.2601451
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601451
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601451?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:53:y:2002:i:12:d:10.1057_palgrave.jors.2601451. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.