Two Parallel Queues with Infinite Servers andJoin the Shortest QueueDiscipline

DOI10.1080/15326349.2015.1061440zbMath1346.68042OpenAlexW2098147028MaRDI QIDQ3458140

No author found.

Publication date: 8 December 2015

Published in: Stochastic Models (Search for Journal in Brave)

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

zbMATH Keywords

schedulingFredholm integral equationsorthogonal polynomialsMarkov processesqueuing theorynetwork performance evaluation

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Fredholm integral equations (45B05) Systems of nonsingular linear integral equations (45F05) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (2)

Approximations for a queueing game model with join-the-shortest-queue strategy ⋮ Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the infinite server shortest queue problem: non-symmetric case
• On the maximum queue length in the supermarket model
• On the Shortest Queue Version of the Erlang Loss Model
• ON THE INFINITE SERVER SHORTEST QUEUE PROBLEM: SYMMETRIC CASE
• Linear integral equations

This page was built for publication: Two Parallel Queues with Infinite Servers andJoin the Shortest QueueDiscipline