Waiting time based routing policies to parallel queues with percentiles objectives

DOI10.1016/J.ORL.2018.04.001OpenAlexW2796984272MaRDI QIDQ2417166

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

zbMATH Keywords

performance evaluationwaiting timeMarkov decision processrelative value functionone-step improvement

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

On the scheduling of operations in a chat contact center ⋮ Late-rejection, a strategy to perform an overflow policy

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Periodic routing to parallel queues and billiard sequences
• An approximation for multi-server queues with deterministic reneging times
• On the value function of the M/Cox(r)/1 queue
• On the Assignment of Customers to Parallel Queues
• Deciding Which Queue to Join: Some Counterexamples
• Optimality of the shortest line discipline
• On the structure of value functions for threshold policies in queueing models
• First in Line Waiting Times as a Tool for Analysing Queueing Systems
• Minimizing response times and queue lengths in systems of parallel queues
• OPTIMIZATION OF OVERFLOW POLICIES IN CALL CENTERS

This page was built for publication: Waiting time based routing policies to parallel queues with percentiles objectives