IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0194738.html
   My bibliography  Save this article

A novel multi-item joint replenishment problem considering multiple type discounts

Author

Listed:
  • Ligang Cui
  • Yajun Zhang
  • Jie Deng
  • Maozeng Xu

Abstract

In business replenishment, discount offers of multi-item may either provide different discount schedules with a single discount type, or provide schedules with multiple discount types. The paper investigates the joint effects of multiple discount schemes on the decisions of multi-item joint replenishment. In this paper, a joint replenishment problem (JRP) model, considering three discount (all-unit discount, incremental discount, total volume discount) offers simultaneously, is constructed to determine the basic cycle time and joint replenishment frequencies of multi-item. To solve the proposed problem, a heuristic algorithm is proposed to find the optimal solutions and the corresponding total cost of the JRP model. Numerical experiment is performed to test the algorithm and the computational results of JRPs under different discount combinations show different significance in the replenishment cost reduction.

Suggested Citation

  • Ligang Cui & Yajun Zhang & Jie Deng & Maozeng Xu, 2018. "A novel multi-item joint replenishment problem considering multiple type discounts," PLOS ONE, Public Library of Science, vol. 13(6), pages 1-19, June.
    • Handle: RePEc:plo:pone00:0194738
    DOI: 10.1371/journal.pone.0194738
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0194738
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0194738&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0194738?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. Muriel, Ana & Chugh, Tammana & Prokle, Michael, 2022. "Efficient algorithms for the joint replenishment problem with minimum order quantities," European Journal of Operational Research, Elsevier, vol. 300(1), pages 137-150.

    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:plo:pone00:0194738. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.