IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v45y1997i6p904-918.html
   My bibliography  Save this article

An Inventory Problem with Two Randomly Available Suppliers

Author

Listed:
  • Ülkü Gürler

    (Bilkent University, Bilkent/Ankara, Turkey)

  • Mahmut Parlar

    (McMaster University, Hamilton, Ontario, Canada)

Abstract

This paper considers a stochastic inventory model in which supply availability is subject to random fluctuations that may arise due to machine breakdowns, strikes, embargoes, etc. It is assumed that the inventory manager deals with two suppliers who may be either individually ON (available) or OFF (unavailable). Each supplier's availability is modeled as a semi-Markov (alternating renewal) process. We assume that the durations of the ON periods for the two suppliers are distributed as Erlang random variables. The OFF periods for each supplier have a general distribution. In analogy with queuing notation, we call this an E s 1 [ E s 2 ]/ G 1 [ G 2 ] system. Since the resulting stochastic process is non-Markovian, we employ the “method of stages” to transform the process into a Markovian one, albeit at the cost of enlarging the state space. We identify the regenerative cycles of the inventory level process and use the renewal reward theorem to form the long-run average cost objective function. Finite time transition functions for the semi-Markov process are computed numerically using a direct method of solving a system of integral equations representing these functions. A detailed numerical example is presented for the E 2 [ E 2 ]/ M [ M ] case. Analytic solutions are obtained for the particular case of “large” (asymptotic) order quantity, in which case the objective function assumes a very simple form that can be used to analyze the optimality conditions. The paper concludes with the discussion of an alternative inventory policy for modeling the random supply availability problem.

Suggested Citation

  • Ülkü Gürler & Mahmut Parlar, 1997. "An Inventory Problem with Two Randomly Available Suppliers," Operations Research, INFORMS, vol. 45(6), pages 904-918, December.
  • Handle: RePEc:inm:oropre:v:45:y:1997:i:6:p:904-918
    DOI: 10.1287/opre.45.6.904
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.6.904
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.45.6.904?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
    ---><---

    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:inm:oropre:v:45:y:1997:i:6:p:904-918. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.