IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v27y1993i3p167-183.html
   My bibliography  Save this article

Handling operations and the lot size trade-off

Author

Listed:
  • Daganzo, Carlos F.
  • Newell, Gordon F.

Abstract

This paper presents a handling cost model for a warehouse that supplies one or more stores with a large number of items and examines operating strategies whose objective is to minimize the sum of handling, transportation and inventory costs. Decisions must be made regarding the frequency of shipments to the store(s) (i.e. the transportation schedule) and the specific items and lot sizes included in each shipment. The paper shows that, conditional on a transportation schedule, lot sizes for the different items (i.e. their delivery frequency consistent with the transportation schedule) can be determined separately across items and independently for each store. The paper also examines how these lot sizes and the best transportation schedule can be identified. The results, unlike those of other inventory models such as the economic order quantity (EOQ) model, exhibit peculiarities caused by the nonsmooth nature of handling costs. For example, the optimal lot size for individual items sent to a specific store is not a continuous function of the value or size of the items. This suggests the need for practical routing and inventory control procedures that recognize handling explicitly.

Suggested Citation

  • Daganzo, Carlos F. & Newell, Gordon F., 1993. "Handling operations and the lot size trade-off," Transportation Research Part B: Methodological, Elsevier, vol. 27(3), pages 167-183, June.
  • Handle: RePEc:eee:transb:v:27:y:1993:i:3:p:167-183
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(93)90027-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Baita, Flavio & Ukovich, Walter & Pesenti, Raffaele & Favaretto, Daniela, 1998. "Dynamic routing-and-inventory problems: a review," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(8), pages 585-598, November.
    2. Ryerson, Megan S., 2010. "Optimal Intercity Transportation Services with Heterogeneous Demand and Variable Fuel Price," University of California Transportation Center, Working Papers qt8696z26t, University of California Transportation Center.

    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:eee:transb:v:27:y:1993:i:3:p:167-183. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.