Calculation of Steady-State Probabilities for Repair Facilities with Multiple Sources and Dynamic Return Priorities

Sikander Daryanani and Douglas R. Miller
Additional contact information
Sikander Daryanani: ICF Resources, Inc., Fairfax, Virginia
Douglas R. Miller: George Mason University, Fairfax, Virginia

Operations Research, 1992, vol. 40, issue 3-supplement-2, S248-S256

Abstract: We develop iterative computational formulas for the steady-state probabilities of an exponential single-channel repair facility with multiple Poisson sources and a dynamic return policy. Such facilities occur as part of multi-echelon repairable item provisioning systems in which backorders are filled according to need instead of FIFO or SIRO policies. Some computational examples are given which show the difference in system performance. Our analysis is an example of the state-reduction computational method for Markov chains. Our implementation makes use of taboo sets and taboo probabilities which have physically meaningful interpretations.

Keywords: inventory/production; theory; multi-echelon with backorder policies; probability; computational: algorithm for structured Markov chain; queues; theory: priority machine repair problem (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.40.3.S248 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:40:y:1992:i:3-supplement-2:p:s248-s256

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().