11.08.2013 Views

CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...

CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...

CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

customer from the unprotected queue will be started if the protected queue is empty <strong>and</strong> more<br />

than a given number <strong>of</strong> servers become idle. The model is a generalization <strong>of</strong> the many-server<br />

queue with impatient customers. The global balance conditions seem to have no explicit solution.<br />

However, the balance conditions for the density <strong>of</strong> the stationary state process for the subsystem<br />

<strong>of</strong> customers being in service or in the protected queue can be solved. This yields the stability<br />

conditions <strong>and</strong> the probabilities that precisely n customers are in service or in the protected<br />

queue. For obtaining performance measures for the unprotected queue, a system approximation<br />

based on fitting impatience intensities is constructed. The results are applied to the performance<br />

analysis <strong>of</strong> a call center with an integrated voice-mail server.<br />

Keywords: Two-queue priority system, Call center, s-server priority system, Arrival rates, Service<br />

rate, R<strong>and</strong>om maximal waiting time, Many-server queue, Global balance conditions, Stability<br />

conditions, Performance analysis, Integrated voice-mail server<br />

69. C<strong>of</strong>fman, S. <strong>and</strong> M.L. Saxton. Staffing the reference desk in the largely-digital library, Reference<br />

Librarian, 66, 1999, 141–161.<br />

Abstract. The article examines how a centralized, networked reference service might improve<br />

efficiency <strong>and</strong> reduce costs by addressing two long-st<strong>and</strong>ing <strong>and</strong> seemingly intractable problems<br />

associated with the reference process: that librarians spend only a small portion <strong>of</strong> their time at<br />

the reference desk actually answering questions, <strong>and</strong> that many <strong>of</strong> the questions they do answer<br />

could be h<strong>and</strong>led by parapr<strong>of</strong>essionals. The authors explore the feasibility <strong>of</strong> a live, centralized,<br />

networked reference service in a library setting by comparing traditional reference services at the<br />

County <strong>of</strong> Los Angeles Public Library with a commercial inbound call center designed to h<strong>and</strong>le<br />

the same volume <strong>of</strong> questions. Applying Erlang C, the st<strong>and</strong>ard algorithm used to calculate<br />

staffing requirements for commercial call centers, the authors find that a networked reference<br />

service based on a call center model could reduce the reference staff requirements at the County<br />

<strong>of</strong> Los Angeles Public Library by 42% or more. These results are very preliminary, <strong>and</strong> the<br />

article cautions against jumping to conclusions until we have much better data on the questions<br />

we are answering <strong>and</strong> the reference process as a whole, but the evidence we do have suggests<br />

that networked reference services have the potential to truly revolutionize the way we have been<br />

doing reference for the past 100 years.<br />

Keywords: Reference desk staff, Largely digital library, Networked reference service, Intractable<br />

problems, Reference process, Librarians, Parapr<strong>of</strong>essionals, Library setting, Traditional reference<br />

services, County <strong>of</strong> Los Angeles Public Library, Commercial inbound call center, Erlang-C,<br />

St<strong>and</strong>ard algorithm, Staffing requirements, Call center model, Reference staff requirements<br />

(Appears also in Sections IV <strong>and</strong> VII.)<br />

70. Gans, Noah <strong>and</strong> Yong-Pin Zhou. Managing learning <strong>and</strong> turnover in employee staffing. Working<br />

Paper, The Wharton School, The University <strong>of</strong> Pennsylvania, July 1999 (Revised November<br />

2000).<br />

Abstract. We study the employee staffing problem in a service organization that uses employee<br />

service capacities to meet r<strong>and</strong>om, nonstationary service requirements. The employees experience<br />

learning <strong>and</strong> turnover on the job, <strong>and</strong> we develop a Markov Decision Process (MDP) model<br />

that explicitly represents the stochastic nature <strong>of</strong> these effects. Theoretical results are developed<br />

27

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!