Service-adaptive multi-type repairman problems
Loading...
Authors
Gaver, Donald Paul
Morrison, John A.
Silveira, Rogerio G.
Subjects
Computer system modeling; performance analysis; priorities; heavy-traffic analysis
Advisors
Date of Issue
1991-03
Date
1991-03
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
The classical repairman problem, cf. Feller (1967) is generalized to consider r failure-prone machine types, each type having its own individual failure rate and also repair rate. Each failed machine joins its type queue, and is repaired by a single server. Several dynamic service priority schemes are considered that approximate first-come, first-served, longest-line first, and least-available first. A heavy-traffic asymptotic analysis determines approximations to the time dependent mean and covariance of individual type queue lengths, and shows that the marginal joint distribution of queue lengths is approximately Ornstein-Uhlenbeck. Numerical illustrations of approximation accuracy are provided, as are suggested applications to computer performance and manufacturing systems analysis
Type
Technical Report
Description
Series/Report No
Department
Operations Research
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
NPS-OR-91-11
Sponsors
Defense Communications Agency, Reston, Virginia, and ONR, Arlington, VA
Funder
O&MN, Direct Funding
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.