IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v30y1984i2p245-257.html
   My bibliography  Save this article

Log Bucking and Lumber Manufacturing Using Dynamic Programming

Author

Listed:
  • Bruce Faaland

    (University of Washington)

  • David Briggs

    (University of Washington)

Abstract

The process of converting a tree into finished lumber involves several interrelated steps. The two of greatest potential for improvement are cutting the felled tree into shorter logs (called bucking the tree) and sawing the bucked logs into lumber. Unlike previous work in the area, this paper considers the two activities together as a single production system. The model allows for variations in tree shape and quality which could be recorded by modern electronic scanners. Among the principal techniques used in the paper are dynamic programming for both bucking and sawing, and a procedure for calculating the distance between two polyhedral sets in R 2 . Computational experience is reported on trees with representative defect patterns, taper, and sweep.

Suggested Citation

  • Bruce Faaland & David Briggs, 1984. "Log Bucking and Lumber Manufacturing Using Dynamic Programming," Management Science, INFORMS, vol. 30(2), pages 245-257, February.
    • Handle: RePEc:inm:ormnsc:v:30:y:1984:i:2:p:245-257
    DOI: 10.1287/mnsc.30.2.245
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.30.2.245
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.30.2.245?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ronnqvist, Mikael & Astrand, Erik, 1998. "Integrated defect detection and optimization for cross cutting of wooden boards," European Journal of Operational Research, Elsevier, vol. 108(3), pages 490-508, August.
    2. Vera Neidlein & Andrèa C. G. Vianna & Marcos N. Arenales & Gerhard Wäscher, 2008. "The Two-Dimensional, Rectangular, Guillotineable-Layout Cutting Problem with a Single Defect," FEMM Working Papers 08035, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    3. Satyaveer Chauhan & J.-M. Frayret & Luc LeBel, 2011. "Supply network planning in the forest supply chain with bucking decisions anticipation," Annals of Operations Research, Springer, vol. 190(1), pages 93-115, October.

    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:inm:ormnsc:v:30:y:1984:i:2:p:245-257. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.