An inventory problem with two randomly available suppliers
dc.citation.epage | 918 | en_US |
dc.citation.issueNumber | 6 | en_US |
dc.citation.spage | 904 | en_US |
dc.citation.volumeNumber | 45 | en_US |
dc.contributor.author | Gürler, Ü. | en_US |
dc.contributor.author | Parlar, M. | en_US |
dc.date.accessioned | 2016-02-08T10:46:42Z | |
dc.date.available | 2016-02-08T10:46:42Z | |
dc.date.issued | 1997 | en_US |
dc.department | Department of Management | en_US |
dc.description.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 Es1[Es2]/G1[G2] 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 E2[E2]/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. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T10:46:42Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1997 | en |
dc.identifier.doi | 10.1287/opre.45.6.904 | en_US |
dc.identifier.issn | 0030-364X | |
dc.identifier.uri | http://hdl.handle.net/11693/25551 | |
dc.language.iso | English | en_US |
dc.publisher | Institute for Operations Research and the Management Sciences | en_US |
dc.relation.isversionof | https://doi.org/10.1287/opre.45.6.904 | en_US |
dc.source.title | Operations Research | en_US |
dc.subject | Availability | en_US |
dc.subject | Functions | en_US |
dc.subject | Integral equations | en_US |
dc.subject | Mathematical models | en_US |
dc.subject | Mathematical transformations | en_US |
dc.subject | Numerical methods | en_US |
dc.subject | Queueing theory | en_US |
dc.subject | Random processes | en_US |
dc.subject | State space methods | en_US |
dc.subject | Erlang random variables | en_US |
dc.subject | Inventory | en_US |
dc.subject | Random supply availability | en_US |
dc.subject | Renewal reward theorem | en_US |
dc.subject | Stages method | en_US |
dc.subject | Inventory control | en_US |
dc.title | An inventory problem with two randomly available suppliers | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- An inventory problem with two randomly available suppliers.pdf
- Size:
- 1.18 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version