MARC record from Internet Archive

LEADER: 02034nam 2200325 a 45 0
001 a197544
008 980518s1991 caua b f000|0 eng d
040 $aCMontNP$cCMontNP
086 0 $aD 208.14/2:NPS-OR-91-11
100 1 $aGaver, Donald Paul.
245 10 $aService-adaptive multi-type repairman problems /$cDonald P. Gaver, John A. Morrison, Rogerio Silveira.
260 $aMonterey, Calif. :$bNaval Postgraduate School ;$aSpringfield, Va. :$bAvailable from National Technical Information Service,$c[1991]
300 $ai, 25 p. :$bill. ;$c28 cm.
500 $aTitle from cover.
500 $a"NPS-OR-91-11."
500 $a"March 1991."
500 $aAD A235 488.
504 $aIncludes bibliographical references (p. 25).
520 $aThe 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.
592 $aaq/aq cc:9116 05/18/98
650 4 $aMarkov processes.
650 4 $aRepair.
650 4 $aGueing theory.
650 4 $aProblem solving.
700 1 $aMorrison, John A.
700 11 $aSilveira, Rogerio G.
710 2 $aNaval Postgraduate School (U.S.).$bDept. of Operations Research.
740 01 $aNPS-OR-91-11.
926 $aNPS-LIB$bFEDDOCS$cD 208.14/2:NPS-OR-91-11$dBOOK$f1
926 $aNPS-LIB$bFEDDOCS$cD 208.14/2:NPS-OR-91-11$dBOOK$f2