Spares Provisioning for Repairable Items: Cyclic Queues in Light Traffic
- 1 September 1978
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 10 (3) , 307-314
- https://doi.org/10.1080/05695557808975219
Abstract
The classic machine repair problem is extended and modeled as a cyclic queue for the purpose of determining the number of spares and repair channels for a population of items subject to stochastic failure. In this system the operating units, removal of failed units, transportation to repair depot, and the repair itself are treated as four multi-server stations, each with exponential holding times. An exact model is developed from the literature on networks and cyclic queues and compared with a series approximation. Under a constraint requiring a high availability of spares which insures “light traffic queues,” the approximate model is found to be very accurate and computationally more efficient.Keywords
This publication has 7 references indexed in Scilit:
- Random Flow in Queueing Networks: A Review and CritiqueA I I E Transactions, 1975
- Closed Finite Queuing Networks with Time LagsOperations Research, 1968
- CLOSED NETWORKS OF QUEUESPublished by Defense Technical Information Center (DTIC) ,1967
- Jobshop-Like Queueing SystemsManagement Science, 1963
- Cyclic QueuesJournal of the Operational Research Society, 1958
- Networks of Waiting LinesOperations Research, 1957
- The Output of a Queuing SystemOperations Research, 1956