IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v51y2019i9p943-956.html
   My bibliography  Save this article

A heuristic based on quadratic approximation for dual sourcing problem with general lead times and supply capacity uncertainty

Author

Listed:
  • Wenbo Chen
  • Huixiao Yang

Abstract

We study a single-product, periodic-review dual sourcing inventory system with demand and supply uncertainty, where the replenishment lead times can be arbitrary and the expedited supplier has a shorter lead time with a higher unit price than the regular supplier, unmet demand is fully backlogged. Even for the general dual sourcing problem without supply risks, the optimal stochastic policy has been unknown for over 50 years and several simple heuristics have been proposed in the literature. Moreover, the consideration of supply uncertainty brings another challenge, where the objective functions characterized by the dynamic programming recursions are not convex in the ordering quantities. Fortunately, a powerful transformation skill is recently proposed to successfully address the problem above and shows that the value-to-go function is L♮ convex. In this article, we design a Linear Programming greedy (LP-greedy) heuristic based on the quadratic approximation of L♮ convex value-to-go function and convert the problem into a convex optimization problem during each period. In an extensive simulation study, two sets of test instances from the literature are employed to compare the performance of our LP-greedy heuristic with that of some well-known policies in dual sourcing system, including Tailored base-surge, Dual index, Best vector base-stock. In addition, to assess the effectiveness of our heuristic, we construct a lower bound to the exact system. The lower bound is based on an information-relaxation approach and involves a penalty function derived from the proposed heuristic. We show that our proposed LP-greedy heuristic performs better than other heuristics in the dual sourcing problem and it is nearly optimal (within 3%) for the majority of cases.

Suggested Citation

  • Wenbo Chen & Huixiao Yang, 2019. "A heuristic based on quadratic approximation for dual sourcing problem with general lead times and supply capacity uncertainty," IISE Transactions, Taylor & Francis Journals, vol. 51(9), pages 943-956, September.
  • Handle: RePEc:taf:uiiexx:v:51:y:2019:i:9:p:943-956
    DOI: 10.1080/24725854.2018.1537532
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2018.1537532?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. Svoboda, Josef & Minner, Stefan & Yao, Man, 2021. "Typology and literature review on multiple supplier inventory control models," European Journal of Operational Research, Elsevier, vol. 293(1), pages 1-23.
    2. Tong Wang & Xiaoyue Yan & Chaolin Yang, 2021. "Managing a Hybrid RDC‐DC Inventory System," Production and Operations Management, Production and Operations Management Society, vol. 30(10), pages 3679-3697, October.
    3. Boute, Robert N. & Gijsbrechts, Joren & van Jaarsveld, Willem & Vanvuchelen, Nathalie, 2022. "Deep reinforcement learning for inventory control: A roadmap," European Journal of Operational Research, Elsevier, vol. 298(2), pages 401-412.

    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:uiiexx:v:51:y:2019:i:9:p:943-956. 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/uiie .

    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.