Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism

DOI10.1007/PL00013360zbMath0985.90024OpenAlexW2114081154MaRDI QIDQ5945231

W. Henk M. Zijm, Ivo J. B. F. Adan, Jaap Wessels, Geert-Jan van Houtum

Publication date: 10 October 2001

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00013360

zbMATH Keywords

boundsperformance analysisflexibilityqueueing systemshortest queue routingtruncation model

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Traffic problems in operations research (90B20)

Related Items (8)

The kernel method tail asymptotics analytic approach for stationary probabilities of two-dimensional queueing systems ⋮ Some first passage time problems for the shortest queue model ⋮ Analysis of two queues in parallel with jockeying and restricted capacities ⋮ Geometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue Model ⋮ JOIN MINIMUM COST QUEUE FOR MULTICLASS CUSTOMERS: STABILITY AND PERFORMANCE BOUNDS ⋮ On the Solution to QBD Processes with Finite State Space ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE ⋮ Transient analysis of two queues in parallel with jockeying

This page was built for publication: Performance analysis of parallel identical machines with a generalized shortest queue arrival mechanism