J.comput. appl. math

DOI10.1080/15326349908807169MaRDI QIDQ3490735zbMATH OpenOpenAlexFDO

Authors Ivo Adan, J. Wessels, W. H. M. Zijm

Publication date 1990

Published in Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15326349908807169

zbMATH Keywords

difference equationnumerical algorithmstationary queue length distributioninfinite linear combination of product formssimilar queues in parallel

Mathematics Subject Classification ID

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

Recommendations

• Analysis of the asymmetric shortest queue problem
• Stationary analysis of the shortest queue problem
• Analysis of the symmetric join the shortest orbit queue
• Analysis of the asymmetric shortest queue problem with threshold jockeying
• Analysis of the asymmetrical shortest two-server queueing model
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• scientific article; zbMATH DE number 4066100
• A generalization of symmetric queues

Cited in

(43)

• On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• Analysis of a two incongruent arrivals and services M/G/1 queue with random feedback
• Analysis of the shortest relay queue policy in a cooperative random access network with collisions
• Analysis of the asymmetric shortest queue problem
• Performance modeling of a two-echelon supply chain under different levels of upstream inventory information sharing
• Decay rate for a PH/M/2 queue with shortest queue discipline
• Analyzing \(E_k/E_r/ c\) queues
• scientific article; zbMATH DE number 1523216 (Why is no real title available?)
• Transient analysis of two queues in parallel with jockeying
• Analysis of the symmetric join the shortest orbit queue
• Erlang arrivals joining the shorter queue
• Some first passage time problems for the shortest queue model
• Stationary analysis of the ``shortest queue first service policy: the asymmetric case
• Bad luck when joining the shortest queue
• The shortest queue problem
• Upper and lower bounds for the waiting time in the symmetric shortest queue system
• Stationary analysis of the shortest queue problem
• Steady-state analysis of shortest expected delay routing
• Two coupled queues with vastly different arrival rates: critical loading case
• Performance analysis of joining the shortest queue model among a large number of queues
• Two parallel queues with infinite servers and \textit{join the shortest queue} discipline
• The compensation approach for walks with small steps in the quarter plane
• The generalized join the shortest orbit queue system: stability, exact tail asymptotics and stationary approximations
• A compensation procedure for multiprogramming queues
• Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
• COMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMS
• Analysis of two queues in parallel with jockeying and restricted capacities
• Optimality of routing and servicing in dependent parallel processing systems
• The shorter queue polling model
• Geometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue Model
• scientific article; zbMATH DE number 654704 (Why is no real title available?)
• Asymptotic analysis of two coupled queues with vastly different arrival rates and finite customer capacities
• A finite compensation procedure for a class of two-dimensional random walks
• Harmonic functions for singular quadrant walks
• On the infinite server shortest queue problem: non-symmetric case
• Shortest expected delay routing for Erlang servers
• Martingales and buffer overflow for the symmetric shortest queue model
• scientific article; zbMATH DE number 51576 (Why is no real title available?)
• Necessary conditions for the compensation approach for a random walk in the quarter-plane
• Analysis of job assignment with batch arrivals among heterogeneous servers
• Stationary analysis of the shortest queue first service policy
• Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism

This page was built for publication: J.comput. appl. math

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