An M / M / m / n Queue for the Shortest Distance Priority Machine Interference Problem

Gary H. Reynolds
Additional contact information
Gary H. Reynolds: West Virginia University, Morgantown, West Virginia

Operations Research, 1975, vol. 23, issue 2, 325-341

Abstract: A mathematical model is developed for the machine interference problem with the priority of servicing the nearest machine in need of repair. The walking distance to a repair can be very significant in such large scale problems as law enforcement and guerrilla warfare where a first-in-first-out priority would, most likely, yield meaningless results. Compared with other models depicting the problem as a Markov process, the shortest distance priority yields the largest number of operating machines under steady-state conditions.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.2.325 (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:23:y:1975:i:2:p:325-341

Access Statistics for this article

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