[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

Creating Work Breaks from Available Idleness

Published: 01 October 2018 Publication History

Abstract

We develop new rules for assigning available service representatives to customers in customer contact centers and other large-scale service systems in order to create effective work breaks for the service representatives from naturally available idleness. These are unplanned breaks occurring randomly over time. We consider both announced breaks as well as unannounced breaks. Our goal is to make the mean and variance of the interval between successive breaks suitably small. Given a target break duration, we propose assigning idle servers based on the elapsed time since their last break. We show that our proposed server-assignment rules are optimal for the many-server heavy-traffic MSHT fluid model. Extensive simulation experiments support the proposed server-assignment rules in practical cases and confirm the MSHT approximation formulas when the number of servers is very large.
The online appendix is available at <ext-link ext-link-type="uri" href="https://doi.org/10.1287/msom.2017.0682">https://doi.org/10.1287/msom.2017.0682</ext-link>.

References

[1]
Aksin OZ, Armony M, Mehrotra V (2007) The modern call center: A multi-disciplinary perspective on operations management research. Production Oper. Management 16(6):665-688.
[2]
Armony M, Ward A (2010) Fair dynamic routing policies in large-scale service systems with heterogeneous servers. Oper. Res. 58(3):624-637.
[3]
Atar R (2008) Central limit theorem for a many-server queue with random service times. Ann. Appl. Prob. 18(4):1548-1568.
[4]
Atar R, Shaki YY, Shwartz A (2011) A blind policy for equalizing cumulative idleness. Queueing Systems 67(4):275-293.
[5]
Biron M, Bamberger P (2010) The impact of structural empowerment on individual well-being and performance: Taking agent preferences, self-efficacy and operational constraints into account. Human Relations 63(2):163-191.
[6]
Brown M (1980) Bounds, inequalities and monotonicity properties for some specialized renewal processes. Ann. Probab. 8(2):227-240.
[7]
Brown M (1981) Further monotonicity properties for specialized renewal processes. Ann. Probab. 9(5):891-895.
[8]
Chan W, Koole G, L'Ecuyer P (2014) Dynamic call center routing policies using call waiting and agent idle times. Management Sci. 16(4):544-560.
[9]
Eick SG, Massey WA, Whitt W (1993) The physics of the Mt/G/? queue. Oper. Res. 41(4):731-742.
[10]
Feller W (1971) An Introduction to Probability Theory and Its Applications, 2nd ed. (John Wiley, New York).
[11]
Fritz C, Ellis AM, Demsky CA, Lin BC, Guros F (2013) Embracing work breaks. Organ. Dynamics 4(42):274-280.
[12]
Jackson JR (1957) Networks of waiting lines. Management Sci. 5(4):518-521.
[13]
Jett QR, George JM (2003) Work interrupted: A closer look at the role of interruptions in organizational life. Acad. Management Rev. 28(3):494-507.
[14]
Kaspi H, Ramanan K (2011) Law of large numbers limits for many-server queues. Ann. Appl. Probab. 21(1):33-114.
[15]
Lin YH, Chen CY, Hongand WH, Lin YC (2010) Perceived job stress and health complaints at a bank call center: Comparison between inbound and outbound services. Indust. Health 48(3):349-356.
[16]
Liu Y, Whitt W (2011) Large-time asymptotics for the Gt/Mt/st+GIt many-server fluid queue with abandonment. Queueing Systems 67(2):145-182.
[17]
Liu Y, Whitt W (2012a) The Gt/GI/st + GI many-server fluid queue. Queueing Systems 71(4):405-444.
[18]
Liu Y, Whitt W (2012b) A many-server fluid limit for the Gt/GI/st + GI queueing model experiencing periods of overloading. Oper. Res. Lett. 40(5):307-312.
[19]
Liu Y, Whitt W (2014) Many-server heavy-traffic limits for queues with time-varying parameters. Ann. Appl. Probab. 24(1):378-421.
[20]
Mandelbaum A, Momcilovic P, Tseytlin Y (2012) On fair routing from emergency departments to hospital wards: QED queues with heterogeneous servers. Management Sci. 58(7):1273-1291.
[21]
Mayo E (1933) The Human Problems of an Industrial Civilization (Scott Foresman, Glenville, IL).
[22]
Ni EC, Henderson SG (2015) How hard are steady-state queueing simulations? ACM Trans. Modeling Comput. Simulation (TOMACS) 25(4):27.
[23]
Pang G, Whitt W (2010) Two-parameter heavy-traffic limits for infinite-server queues. Queueing Systems 65(4):325-364.
[24]
Puterman ML (2005) Markov Decison Processes: Discrete Stochastic Dynamic Programming, 2nd ed. (Wiley, Hoboken, NJ).
[25]
Ross SM (1996) Stochastic Processes, 2nd ed. (Wiley, New York).
[26]
Sawyerr OO, Srinivas S, Wang S (2009) Call center employee personality factors and service performance. J. Services Marketing 23(5):301-317.
[27]
Sisselman MJ, Whitt W (2007) Value-based routing and preference-based routing in customer contact centers. Production Oper. Management 16(3):277-291.
[28]
Srikant R, Whitt W (1996) Simulation run lengths to estimate blocking probabilities. ACM Trans. Modeling Comput. Simulation (TOMACS) 6(1):7-52.
[29]
Taylor FW (1911) Principles of Scientific Management (Harper and Brothers, New York).
[30]
Trougakos JF, Hideg I (2009) Momentary work recovery: The role of within-day work breaks. Sonnentag S, Perrewe PL, Ganster DC, eds. Research in Occupational Stress and Well Being (Emerald Group, Bingley, UK), 37-84.
[31]
Walpole RE, Myers RH, Myers SL, Ye K (1993) Probability and Statistics for Engineers and Scientists, Vol. 5 (Macmillan, New York).
[32]
Whitt W (1982) Approximating a point process by a renewal process, Part I: Two basic methods. Oper. Res. 30(1):125-147.
[33]
Whitt W (1989) Planning queueing simulations. Management Sci. 35(11):1341-1366.
[34]
Whitt W (1991) A review of L = ?W and extensions. Queueing Systems 9(3):235-268.
[35]
Whitt W (2002) Stochastic-Process Limits (Springer, New York).
[36]
Whitt W (2006a) Fluid models for multiserver queues with abandonments. Oper. Res. 54(1):37-54.
[37]
Whitt W (2006b) The impact of increased employee retention upon performance in a customer contact center. Manufacturing Service Oper. Management 81(3):221-234.

Cited By

View all
  • (2022)The Microstructure of WorkManufacturing & Service Operations Management10.1287/msom.2021.105324:4(2202-2220)Online publication date: 1-Jul-2022
  • (2019)Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service SystemsOperations Research10.1287/opre.2018.183867:6(1738-1751)Online publication date: 1-Nov-2019
  1. Creating Work Breaks from Available Idleness

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image Manufacturing & Service Operations Management
    Manufacturing & Service Operations Management  Volume 20, Issue 4
    October 2018
    200 pages

    Publisher

    INFORMS

    Linthicum, MD, United States

    Publication History

    Published: 01 October 2018
    Accepted: 04 October 2017
    Received: 09 September 2016

    Author Tags

    1. customer contact centers
    2. fluid models
    3. large-scale service systems
    4. many-server heavy-traffic limits
    5. server-assignment rules
    6. work breaks

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 26 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)The Microstructure of WorkManufacturing & Service Operations Management10.1287/msom.2021.105324:4(2202-2220)Online publication date: 1-Jul-2022
    • (2019)Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service SystemsOperations Research10.1287/opre.2018.183867:6(1738-1751)Online publication date: 1-Nov-2019

    View Options

    View options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media