Service-adaptive multi-type repairman problems
By: Donald P. Gaver, John A. Morrison, Rogerio Silveira
Contributors: Morrison, John A.; Silveira, Rogerio G.; Naval Postgraduate School (U.S.). Dept. of Operations Research
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1991
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 25
Subjects: Repair; Markov processes; Problem solving; Gueing theory
Other titles: NPS-OR-91-11.
Description: 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.
Notes: Title from cover.

"NPS-OR-91-11."

"March 1991."

AD A235 488.

Includes bibliographical references (p. 25).

aq/aq cc:9116 05/18/98