IDEAS home Printed from https://ideas.repec.org/a/caa/jnljfs/v57y2011i6id48-2010-jfs.html
   My bibliography  Save this article

Harvest scheduling with spatial aggregation for two and three strip cut system under shelterwood management

Author

Listed:
  • M. Konoshima

    (Graduate School of Life Sciences, Tohoku University, Aoba, Sendai, Japan)

  • R. Marušák

    (Faculty of Forestry and Wood Sciences, Czech University of Life Sciences Prague, Prague, Czech Republic)

  • A. Yoshimoto

    (Department of Mathematical Analysis and Statistical Inference, The Institute of Statistical Mathematics, Tachikawa, Tokyo, Japan)

Abstract

We propose a spatial aggregation method to solve an optimal harvest scheduling problem for strip shelterwood management. Strip shelterwood management involves either a two-cut system with a preparatory-removal cut cycle, or a three-cut system with a preparatory-establishment-removal cut cycle. In this study we consider these connected sequential cuts as one decision variable, then employ conventional adjacency constraints to seek the best combination of sequential cuts over space and time. Conventional adjacency constraints exclude any spatially-overlapped strips in the decision variables. Our results show the proposed approach can be used to analyze a strip shelterwood cutting system that requires "connectivity" of management units.

Suggested Citation

  • M. Konoshima & R. Marušák & A. Yoshimoto, 2011. "Harvest scheduling with spatial aggregation for two and three strip cut system under shelterwood management," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 57(6), pages 271-277.
    • Handle: RePEc:caa:jnljfs:v:57:y:2011:i:6:id:48-2010-jfs
    DOI: 10.17221/48/2010-JFS
    as

    Download full text from publisher

    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/48/2010-JFS.html
    Download Restriction: free of charge
    File URL: http://jfs.agriculturejournals.cz/doi/10.17221/48/2010-JFS.pdf
    Download Restriction: free of charge
    File URL: https://libkey.io/10.17221/48/2010-JFS?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:caa:jnljfs:v:57:y:2011:i:6:id:48-2010-jfs. 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: Ivo Andrle (email available below). General contact details of provider: https://www.cazv.cz/en/home/ .

    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.