Translator Disclaimer
September 2013 Partial flexibility in routeing and scheduling
Osman T. Akgun, Rhonda Righter, Ronald Wolff
Author Affiliations +
Adv. in Appl. Probab. 45(3): 673-691 (September 2013). DOI: 10.1239/aap/1377868534

Abstract

We consider partial customer flexibility in service systems under two different designs. In the first design, flexible customers have their own queue and each server has its own queue of dedicated customers. Under this model, the problem is a scheduling problem and we show under various settings that the dedicated customers first (DCF) policy is optimal. In the second design, flexible customers are not queued separately and must be routed to one of the server's dedicated queues upon arrival. We extend earlier results about the `join the smallest work (JSW)' policy to systems with dedicated as well as flexible arrivals. We compare these models to a routeing model in which only the queue length is available in terms of both efficiency and fairness and argue that the overall best approach for call centers is JSW routeing. We also discuss how this can be implemented in call centers even when work is unknown.

Citation

Download Citation

Osman T. Akgun. Rhonda Righter. Ronald Wolff. "Partial flexibility in routeing and scheduling." Adv. in Appl. Probab. 45 (3) 673 - 691, September 2013. https://doi.org/10.1239/aap/1377868534

Information

Published: September 2013
First available in Project Euclid: 30 August 2013

zbMATH: 1273.90049
MathSciNet: MR3102467
Digital Object Identifier: 10.1239/aap/1377868534

Subjects:
Primary: 90B22
Secondary: 60K25

Rights: Copyright © 2013 Applied Probability Trust

JOURNAL ARTICLE
19 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.45 • No. 3 • September 2013
Back to Top