Minimizing response times and queue lengths in systems of parallel queues

DOI10.1239/jap/1032374764zbMath0985.60082OpenAlexW2059997698MaRDI QIDQ4954247

Ger Koole, Don Towsley, Panayotis D. Sparaggis

Publication date: 8 May 2001

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1032374764

zbMATH Keywords

response timesstochastic majorizationrouteingincreasing likelihood distributions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Traffic problems in operations research (90B20)

Related Items (15)

A Fair Policy for the G/GI/N Queue with Multiple Server Pools ⋮ Dynamic routing to heterogeneous collections of unreliable servers ⋮ Understanding the marginal impact of customer flexibility ⋮ Waiting time based routing policies to parallel queues with percentiles objectives ⋮ Monotonicity properties of user equilibrium policies for parallel batch systems ⋮ Maximizing throughput in finite-source parallel queue systems ⋮ A conservative index heuristic for routing problems with multiple heterogeneous service facilities ⋮ On the stability of a class of non-monotonic systems of parallel queues ⋮ On the scheduling of operations in a chat contact center ⋮ ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE ⋮ Asymptotically optimal control of parallel tandem queues with loss ⋮ DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM ⋮ User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss ⋮ Multiple-server system with flexible arrivals ⋮ Partial Flexibility in Routeing and Scheduling

This page was built for publication: Minimizing response times and queue lengths in systems of parallel queues