A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)

From MaRDI portal
Publication:1332811

DOI10.1016/0305-0548(94)90075-2zbMath0810.90048OpenAlexW1973794329MaRDI QIDQ1332811

T. S. S. Srini Vasa Rao, U. C. Gupta

Publication date: 17 April 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90075-2




Related Items (20)

Analysis and optimization of an \(M/G/1\) machine repair problem with multiple imperfect coverageA unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queuesA survey of the machine interference problemAnalysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\)Analytical and computational aspects of the infinite buffer single server \(N\) policy queue with batch renewal inputOptimal control of an \(M/G/1/K\) queueing system with combined \(F\) policy and startup timeA recursive method for the \(F\)-policy \(G/M/1/K\) queueing system with an exponential startup timeBootstrapping Computation of Availability for a Repairable System with Standby Subject to Imperfect SwitchingM/M/R machine interference model with balking, reneging, spares and two modes of failure.Cost benefit analysis of availability systems with warm standby units and imperfect coverageA preemptive discrete-time priority buffer system with partial buffer sharingFuzzy modeling and harmony search optimization for machining system with general repair, standby support and vacationComparative analysis of availability between three systems with general repair times, reboot delay and switching failuresA queueing model for optimal control of partial buffer sharing in ATMOn the \(M/G/1\) machine interference model with sparesAnalysis of \(M/G/1\) queues with delayed vacations and exhaustive service disciplineA recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacityA recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacityAvailability of a repairable retrial system with warm standby componentsSensitivity analysis of the machine repair problem with general repeated attempts



Cites Work




This page was built for publication: A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)