Machine Repair as a Priority Waiting-Line Problem

Thomas E. Phipps
Additional contact information
Thomas E. Phipps: Operations Evaluation Group, Massachusetts Institute of Technology, P.O. Box 2176, Potomac Station, Alexandria, Virginia

Operations Research, 1956, vol. 4, issue 1, 76-85

Abstract: A paper by Cobham (Cobham, A. 1954. J. Opns. Res. Soc. Am. 2 70.) in this Journal, dealing with the assignment of priorities in waiting-line problems, is taken as the basis for treatment of a particular variety of machine-repair problem in which shortest jobs, rather than first arrivals, receive highest priority. Cobham's results for the single channel case are found to be easily applicable to this type of priority assignment. These results take a particularly simple form when the priority-labeling index is allowed to assume continuous, rather than discrete, values. They apply to any case in which a one-channel facility repairs random failures from a very large population of machines.

Date: 1956
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.4.1.76 (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:4:y:1956:i:1:p:76-85

Access Statistics for this article

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