A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/K
From MaRDI portal
(Redirected from Publication:1332811)
A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
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
Cites work
- scientific article; zbMATH DE number 3164122 (Why is no real title available?)
- scientific article; zbMATH DE number 4076264 (Why is no real title available?)
- scientific article; zbMATH DE number 3057120 (Why is no real title available?)
- scientific article; zbMATH DE number 3069551 (Why is no real title available?)
- A Combinatorial Method in the Theory of Queues
- Machine interference with general repair and running times
- On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes
- On a machine interference problem with several types of machines attended by a single repairman
- Simple Machine Interference with Two Types of Failure
- The G/M/r machine interference model
- The M/E_k/r machine interference model. Steady state equations and numerical solutions
Cited in
(25)- Bootstrapping computation of availability for a repairable system with standby subject to imperfect switching
- scientific article; zbMATH DE number 4188944 (Why is no real title available?)
- Calculation of Steady-State Probabilities for Repair Facilities with Multiple Sources and Dynamic Return Priorities
- Analysis and optimization of an \(M/G/1\) machine repair problem with multiple imperfect coverage
- A survey of the machine interference problem
- Analysis of \(M/G/1\) queues with delayed vacations and exhaustive service discipline
- A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
- Fuzzy modeling and harmony search optimization for machining system with general repair, standby support and vacation
- A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time
- Analytical and computational aspects of the infinite buffer single server \(N\) policy queue with batch renewal input
- A preemptive discrete-time priority buffer system with partial buffer sharing
- A queueing model for optimal control of partial buffer sharing in ATM
- 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
- Steady-state probability algorithm and performance evaluation for \(M/ (M_r,G_s)/1/N/N\) machine repair model under bi-level repair policy
- 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)
