Staffing an inbound call center (RV of 97/15/TM)
Author: Harker, P. T. ; Aksin, O. ZeynepINSEAD Area: Technology and Operations Management Series: Working Paper ; 98/79/TM (revised version of 97/15/TM) Publisher: Fontainebleau : INSEAD, 1998.Language: EnglishDescription: 44 p.Type of document: INSEAD Working Paper Online Access: Click here Abstract: This paper studies a staffing problem for inbound call centers with multiple call types and service agents that specialize in these different call types. The staffing problem seeks to allocate servers in a call center where performance is determined by its server allocation as weel as its telecommunication and information technology resources; profit maximization is the goal of this problem. For the pure loss case, which does not allow for reneged calls, it is shown that a greedy allocation procedure yields the optimal server allocation. Similarly, for the more general case with only one tye of call class, a simple serach procedure is shown to result in the optimal number of servers. Heuristics are proposed for the general multi-class form of the staffing problem, whose performances are evaluated through numerical examples at the end of the paper. Previous title: Staffing an inbound call center - Harker, P. T.;Aksin, O. Zeynep - 1997 - INSEAD Working Paper Next title: Capacity sizing in the presence of common shared resource: staffing an inbound call center (RV of 98/79/TM) - Harker, Patrick T.;Aksin, O. Zeynep - 2000 - INSEAD Working Paper| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
|
Digital Library | Available | BC001796 |
This paper studies a staffing problem for inbound call centers with multiple call types and service agents that specialize in these different call types. The staffing problem seeks to allocate servers in a call center where performance is determined by its server allocation as weel as its telecommunication and information technology resources; profit maximization is the goal of this problem. For the pure loss case, which does not allow for reneged calls, it is shown that a greedy allocation procedure yields the optimal server allocation. Similarly, for the more general case with only one tye of call class, a simple serach procedure is shown to result in the optimal number of servers. Heuristics are proposed for the general multi-class form of the staffing problem, whose performances are evaluated through numerical examples at the end of the paper.
Digitized
There are no comments for this item.