J.comput. appl. math

DOI10.1080/15326349908807169zbMATH Open0708.60089OpenAlexW2587121237MaRDI QIDQ3490735FDOQ3490735

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

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

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)

Cited In (43)

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

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)