An algorithm for Ph/Ph/c queues

DOI10.1016/0377-2217(86)90222-5zbMath0584.90028OpenAlexW2054079951MaRDI QIDQ1069845

L. P. Seelen

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90222-5

zbMATH Keywords

aggregationapproximationsuccessive overrelaxationwaiting time distributionComputational experiencedistributions of phase typefinite and infinite capacity modelsmulti-server queueing systems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (20)

Approximations for multi-server queues: System interpolations ⋮ Block-scaling of value-iteration for discounted Markov renewal programming ⋮ Replacement process decomposition for discounted Markov renewal programming ⋮ Analyzing \(GI/E_ r/1\) queues ⋮ Analysis of the stationary \(E_ k/C_ 2/s\) queueing system ⋮ Predicting the performance of queues -- a data analytic approach ⋮ Optimal control of a simple immigration-birth-death process through total catastrophes ⋮ Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas ⋮ Multi-channel Queuing Systems with Markovian Impatience ⋮ Refining the diffusion approximation for the G/G/c queue ⋮ Benefits of providing amenities to impatient waiting customers. ⋮ Matrix-geometric solution of a multiserver queue with Markovian group arrivals and Coxian servers ⋮ Iterative solution of the \(M^{[x}/C_ 2/S/N\) queues] ⋮ The throughput rate of multistation unreliable production lines ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ Analyzing \(E_k/E_r/ c\) queues ⋮ Waiting-Time Percentiles in the Multi-server M^x/G/c Queue with Batch Arrivals ⋮ A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue ⋮ Analysis of \(R\) out of \(N\) systems with several repairmen, exponential life times and phase type repair times: an algorithmic approach ⋮ On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerical solution for the multi-server queue with hyper-exponential service times
• A value-iteration scheme for undiscounted multichain Markov renewal programs
• A practical technique for the determination of the optimum relaxation factor of the successive over-relaxation method
• The queue GI/M/s with customers of different types or the queue GI/H_m/s
• Numerical analysis of multi-server queues with deterministic service and special phase-type arrivals
• Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queue
• A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS

This page was built for publication: An algorithm for Ph/Ph/c queues