Waiting time based routing policies to parallel queues with percentiles objectives
From MaRDI portal
Publication:2417166
DOI10.1016/J.ORL.2018.04.001OpenAlexW2796984272MaRDI QIDQ2417166FDOQ2417166
Authors: Benjamin Legros 
Publication date: 11 June 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2018.04.001
Recommendations
- On the Assignment of Customers to Parallel Queues
- Minimizing response times and queue lengths in systems of parallel queues
- Optimal routing of customers with general independent interarrival times in deterministic parallel queues
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Open-loop routing of N arrivals to M parallel queues
performance evaluationMarkov decision processwaiting timerelative value functionone-step improvement
Cites Work
- Title not available (Why is that?)
- An approximation for multi-server queues with deterministic reneging times
- On the Assignment of Customers to Parallel Queues
- Optimality of the shortest line discipline
- Title not available (Why is that?)
- Deciding Which Queue to Join: Some Counterexamples
- Minimizing response times and queue lengths in systems of parallel queues
- On the value function of the M/Cox(r)/1 queue
- Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
- On the structure of value functions for threshold policies in queueing models
- Periodic routing to parallel queues and billiard sequences
- Unintended consequences of optimizing a queue discipline for a service level defined by a percentile of the waiting time
- First in line waiting times as a tool for analysing queueing systems
- Optimization of overflow policies in call centers
Cited In (2)
This page was built for publication: Waiting time based routing policies to parallel queues with percentiles objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417166)
