Improving routing decisions in parallel non-observable queues
From MaRDI portal
Publication:1616599
DOI10.1007/s00607-018-0598-5zbMath1486.68022OpenAlexW2790523917WikidataQ130185762 ScholiaQ130185762MaRDI QIDQ1616599
Mikhail Konovalov, Rostislav Razumchik
Publication date: 6 November 2018
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-018-0598-5
Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Computationally efficient evaluation of appointment schedules in health care
- Optimal routing in two parallel queues with exponential service times
- Analysis of a finite-source customer assignment model with no state information
- Optimization of static traffic allocation policies
- A new approach to the Lindley recursion
- Allocation of tasks to specialized processors: A planning approach
- Periodic routing to parallel queues and billiard sequences
- Balanced sequences and optimal routing
- Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
- Upper (lower) bounds on the mean of the maximum (minimum) of a number of random variables
- The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
- A simple dynamic routing problem
- Transient Behavior of the M/G/1 Workload Process
- Instability of the Join-the-Shortest-Queue and FCFS Policies in Queueing Systems and Their Stabilization
- PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES
- A bound for the maximum of a number of random variables
- Optimal Routing of Fixed Size Jobs to Two Parallel Servers
This page was built for publication: Improving routing decisions in parallel non-observable queues
