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

An optimised target-level inventory replenishment policy for vendor-managed inventory systems

Author

Listed:
  • Leandro C. Coelho
  • Gilbert Laporte

Abstract

In vendor-managed inventory (VMI) systems the supplier is responsible for replenishing customers and for deciding when and how much to deliver. One of two inventory policies is typically employed by the supplier. The first one, called the maximum level (ML) policy, gives full freedom to the supplier to deliver any quantity as long as it respects customer inventory capacities. The alternative, which is more constrained, is called the order-up-to (OU) policy. It states that the supplier has to bring the customer inventory up to its maximum capacity level upon delivery. We propose a new tactical policy in the context of VMI systems, called optimised target-level (OTL), under which when the supplier visits a customer, the quantity delivered is such that the final inventory will always be at the same customer-dependent OTL. We perform a computational evaluation of this new policy against both traditional strategies on benchmark instances. We show that it yields lower costs and inventory levels than the OU policy, and is only marginally more expensive than the ML policy, while being easier to implement.

Suggested Citation

  • Leandro C. Coelho & Gilbert Laporte, 2015. "An optimised target-level inventory replenishment policy for vendor-managed inventory systems," International Journal of Production Research, Taylor & Francis Journals, vol. 53(12), pages 3651-3660, June.
  • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:12:p:3651-3660
    DOI: 10.1080/00207543.2014.986299
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.986299
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2014.986299?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. Mohamed Salim Amri Sakhri & Mounira Tlili & Ouajdi Korbaa, 2022. "A memetic algorithm for the inventory routing problem," Journal of Heuristics, Springer, vol. 28(3), pages 351-375, June.
    2. Manousakis, Eleftherios & Repoussis, Panagiotis & Zachariadis, Emmanouil & Tarantilis, Christos, 2021. "Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation," European Journal of Operational Research, Elsevier, vol. 290(3), pages 870-885.
    3. Diabat, Ali & Bianchessi, Nicola & Archetti, Claudia, 2024. "On the zero-inventory-ordering policy in the inventory routing problem," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1024-1038.
    4. Shen Hong & Deng Qiang & Lao Rebecca & Wu Simon, 2016. "A Case Study of Inventory Management in a Manufacturing Company in China," Nang Yan Business Journal, Sciendo, vol. 5(1), pages 20-40, December.

    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:12:p:3651-3660. 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.