Skip to Main content Skip to Navigation
Journal articles

Waiting time based routing policies to parallel queues with percentiles objectives

Abstract : We develop a method to obtain near-optimal routing policies to parallel queues with decisions based on customers’ wait and performance objectives which include percentiles of the waiting time. We formulate and explicitly derive a value function where the waiting time is used as a decision variable. This allows us to apply a one-step policy improvement method to obtain an efficient routing solution. Numerical illustrations reveal that classical monotone policies are not always optimal.
Document type :
Journal articles
Complete list of metadatas

https://hal-normandie-univ.archives-ouvertes.fr/hal-02065918
Contributor : Jacques-Olivier Catois <>
Submitted on : Wednesday, March 13, 2019 - 9:26:21 AM
Last modification on : Wednesday, October 14, 2020 - 8:40:04 AM

Identifiers

Citation

Benjamin Legros. Waiting time based routing policies to parallel queues with percentiles objectives. Operations Research Letters, Elsevier, 2018, 46 (3), pp.356-361. ⟨10.1016/j.orl.2018.04.001⟩. ⟨hal-02065918⟩

Share

Metrics

Record views

77