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

DOI10.1016/0305-0548(94)90075-2zbMATH Open0810.90048OpenAlexW1973794329MaRDI QIDQ1332811FDOQ1332811

T. S. S. Srinivasa 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

Recommendations

• Calculation of the steady state waiting time distribution in the context of the machine interference problem
• scientific article; zbMATH DE number 4036878
• scientific article; zbMATH DE number 4188944
• Computing steady state probabilities in λ(n)/G/1/K queue
• Calculating steady-state probabilities of the \(G/M/n/m\) queueing systems
• On the \(M/G/1\) machine interference model with spares
• A closed form solution for the G/M/r machine interference model
• Calculation of steady-state probabilities of M/M queues: Further approaches

zbMATH Keywords

machine interferencesteady state probability distribution

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• A Combinatorial Method in the Theory of Queues
• Title not available (Why is that?)
• Title not available (Why is that?)
• The G/M/r machine interference model
• Title not available (Why is that?)
• The \(M/E_k/r\) machine interference model. Steady state equations and numerical solutions
• Title not available (Why is that?)
• Machine interference with general repair and running times
• On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes
• Simple Machine Interference with Two Types of Failure
• On a machine interference problem with several types of machines attended by a single repairman

Cited In (24)

• Title not available (Why is that?)
• Calculation of Steady-State Probabilities for Repair Facilities with Multiple Sources and Dynamic Return Priorities
• Analysis of \(M/G/1\) queues with delayed vacations and exhaustive service discipline
• A survey of the machine interference problem
• Analysis and optimization of an \(M/G/1\) machine repair problem with multiple imperfect coverage
• Fuzzy modeling and harmony search optimization for machining system with general repair, standby support and vacation
• A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
• Analytical and computational aspects of the infinite buffer single server \(N\) policy queue with batch renewal input
• A recursive method for the \(F\)-policy \(G/M/1/K\) queueing system with an exponential startup time
• A preemptive discrete-time priority buffer system with partial buffer sharing
• A queueing model for optimal control of partial buffer sharing in ATM
• Bootstrapping Computation of Availability for a Repairable System with Standby Subject to Imperfect Switching
• On the \(M/G/1\) machine interference model with spares
• Comparative analysis of availability between three systems with general repair times, reboot delay and switching failures
• A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity
• Optimal control of an \(M/G/1/K\) queueing system with combined \(F\) policy and startup time
• Sensitivity analysis of the machine repair problem with general repeated attempts
• M/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 coverage
• Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\)
• Computing steady state probabilities in λ(n)/G/1/K queue
• Availability of a repairable retrial system with warm standby components
• A closed form solution for the G/M/r machine interference model
• A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332811)