Full-Service Probability for Regular Arrangements

Clifford W. Marshall
Additional contact information
Clifford W. Marshall: The Polytechnic Institute of Brooklyn, Brooklyn, New York

Operations Research, 1961, vol. 9, issue 2, 186-199

Abstract: A regular arrangement is a multiple correspondence between a set of elements supplying a service, called stations, and a set of elements requiring service, called installations. There are n installations and 2 n stations. The regular arrangement is such that stations a j and a n + j are able to supply service to installations b j and b j +1 . Each station therefore can service either of two installations and each installation is associated with four stations. It is supposed that after this arrangement has been made a random event removes some stations. The remaining stations are used in the best possible way to supply service to the installations, a station being able to serve only one of its associated installations. The present paper obtains the probability that after the random event it is possible for all installations to receive service.

Date: 1961
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.9.2.186 (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:9:y:1961:i:2:p:186-199

Access Statistics for this article

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