Individually optimal routing in parallel systems

DOI10.2307/3213970zbMath0576.60091OpenAlexW4244575219MaRDI QIDQ3696272

P. R. Kumar, Jean Walrand

Publication date: 1985

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

Full work available at URL: https://doi.org/10.2307/3213970

zbMATH Keywords

control of queuesmultiserver systemssocially optimal policyindividually optimal policyinsensitive to the nature of the arrival process

Mathematics Subject Classification ID

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

Related Items

Scheduling jobs on heterogeneous processors ⋮ Job scheduling to minimize expected weighted flowtime on uniform processors ⋮ User equilibria for a parallel queueing system with state dependent routing ⋮ AN INDIVIDUAL AND SOCIALLY OPTIMAL POLICY MINIMIZING EXPECTED FLOW TIMES ⋮ Mathematical theory of queueing networks ⋮ Heavy Traffic queues with heterogeneous servers:pathwise average cost per unit time problem ⋮ Managing Queues with Heterogeneous Servers ⋮ Nearly optimal control of queues in heavy traffic with heterogeneous servers ⋮ Influencing waiting lists ⋮ User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss ⋮ Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines ⋮ CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS