Partial Flexibility in Routeing and Scheduling
Authors:
- Osman T. AkgunOAOsman T. Akgun
- Rhonda RighterRRRhonda Righter
- Ronald WolffRWRonald Wolff
- 1 September 2013
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 45 (3) , 673-691
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.Keywords
This publication has 36 references indexed in Scilit:
- Multiple-server system with flexible arrivalsAdvances in Applied Probability, 2011
- THE N-NETWORK MODEL WITH UPGRADESProbability in the Engineering and Informational Sciences, 2010
- Telephone Call Centers: Tutorial, Review, and Research ProspectsManufacturing & Service Operations Management, 2003
- Minimizing response times and queue lengths in systems of parallel queuesJournal of Applied Probability, 1999
- On Choosing a Task Assignment Policy for a Distributed Server SystemJournal of Parallel and Distributed Computing, 1999
- Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policiesThe Annals of Applied Probability, 1998
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service ratesJournal of Applied Probability, 1993
- Stochastic ordering properties and optimal routing control for a class of finite capacity queueing systems1990
- Upper bounds on work in system for multichannel queuesJournal of Applied Probability, 1987
- A critical remark on a system approximation in queueing theoryMathematische Operationsforschung und Statistik, 1976