Accession Number:

ADA235488

Title:

Service-Adaptive Multi-Type Repairman Problems

Descriptive Note:

Technical rept.

Corporate Author:

NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF OPERATIONS RESEARCH

Personal Author(s):

• Gaver, Donald P.
• Morrison, John A.
• Silveira, Rogerio

Report Date:

1991-03-01

Pagination or Media Count:

37.0

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.

Descriptors:

• *REPAIR
• TIME DEPENDENCE
• COMPUTERS
• PERFORMANCE(ENGINEERING)
• DYNAMICS
• NUMERICAL ANALYSIS
• MEAN
• RATES
• ACCURACY
• MAINTENANCE PERSONNEL
• GRAPHICS
• SYSTEMS ANALYSIS
• MANUFACTURING
• FAILURE

Subject Categories:

• Statistics and Probability
• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE