Waiting time based routing policies to parallel queues with percentiles objectives
From MaRDI portal
Publication:2417166
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
Cites work
- scientific article; zbMATH DE number 3168214 (Why is no real title available?)
- scientific article; zbMATH DE number 3858809 (Why is no real title available?)
- An approximation for multi-server queues with deterministic reneging times
- Deciding Which Queue to Join: Some Counterexamples
- First in line waiting times as a tool for analysing queueing systems
- Minimizing response times and queue lengths in systems of parallel queues
- On the Assignment of Customers to Parallel Queues
- On the structure of value functions for threshold policies in queueing models
- On the value function of the M/Cox(r)/1 queue
- Optimality of the shortest line discipline
- Optimization of overflow policies in call centers
- Periodic routing to parallel queues and billiard sequences
- Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
- Unintended consequences of optimizing a queue discipline for a service level defined by a percentile of the waiting time
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)
