IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i11p3341-3353.html
   My bibliography  Save this article

A study on crate sizing problems

Author

Listed:
  • Shih Jia Lee
  • Ek Peng Chew
  • Loo Hay Lee
  • Julius Thio

Abstract

This paper studies the crate sizing problem to predetermine optimal standard packaging crate sizes for a demand of assorted sizes of products to minimise space and costs. The crate sizing problem is a real world logistics scenario faced by an existing multinational corporation in the applied chemistry industry. Customer demands come in a mix of rolls to be packaged in individual crates and then shipped in shipping containers from plants to customers. Firstly, a linear crate length optimisation model is introduced with the objective to minimise the total loss of extra space inside the crates for a given distribution of customer demands. In order to take inventory costs of crates into consideration, a second problem is introduced to both find the optimal number of crate types and the corresponding lengths such that the total costs of packaging and inventory are minimised. The latter problem is first formulated as a non-linear optimisation model and then solved using dynamic programming approach to balance the trade-off between the number of crate types and the penalty cost for space wastage inside the crates.

Suggested Citation

  • Shih Jia Lee & Ek Peng Chew & Loo Hay Lee & Julius Thio, 2015. "A study on crate sizing problems," International Journal of Production Research, Taylor & Francis Journals, vol. 53(11), pages 3341-3353, June.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:11:p:3341-3353
    DOI: 10.1080/00207543.2014.980453
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.980453
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.980453?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.

    Citations

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


    Cited by:

    1. Kandula, Shanthan & Krishnamoorthy, Srikumar & Roy, Debjit, 2021. "Learning to Play the Box-Sizing Game: A Machine Learning Approach for Solving the E-commerce Packaging Problem," IIMA Working Papers WP 2021-11-02, Indian Institute of Management Ahmedabad, Research and Publication Department.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:53:y:2015:i:11:p:3341-3353. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.