Creating Work Breaks from Available Idleness

Published Online:https://doi.org/10.1287/msom.2017.0682

References

  • 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.CrossrefGoogle Scholar
  • Armony M, Ward A (2010) Fair dynamic routing policies in large-scale service systems with heterogeneous servers. Oper. Res. 58(3):624–637.LinkGoogle Scholar
  • Atar R (2008) Central limit theorem for a many-server queue with random service times. Ann. Appl. Prob. 18(4):1548–1568.CrossrefGoogle Scholar
  • Atar R, Shaki YY, Shwartz A (2011) A blind policy for equalizing cumulative idleness. Queueing Systems 67(4):275–293.CrossrefGoogle Scholar
  • 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.CrossrefGoogle Scholar
  • Brown M (1980) Bounds, inequalities and monotonicity properties for some specialized renewal processes. Ann. Probab. 8(2):227–240.CrossrefGoogle Scholar
  • Brown M (1981) Further monotonicity properties for specialized renewal processes. Ann. Probab. 9(5):891–895.CrossrefGoogle Scholar
  • 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.Google Scholar
  • Eick SG, Massey WA, Whitt W (1993) The physics of the Mt/G/∞ queue. Oper. Res. 41(4):731–742.LinkGoogle Scholar
  • Feller W (1971) An Introduction to Probability Theory and Its Applications, 2nd ed. (John Wiley, New York).Google Scholar
  • Fritz C, Ellis AM, Demsky CA, Lin BC, Guros F (2013) Embracing work breaks. Organ. Dynamics 4(42):274–280.CrossrefGoogle Scholar
  • Jackson JR (1957) Networks of waiting lines. Management Sci. 5(4):518–521.Google Scholar
  • 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.CrossrefGoogle Scholar
  • Kaspi H, Ramanan K (2011) Law of large numbers limits for many-server queues. Ann. Appl. Probab. 21(1):33–114.CrossrefGoogle Scholar
  • 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.CrossrefGoogle Scholar
  • 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.CrossrefGoogle Scholar
  • Liu Y, Whitt W (2012a) The Gt/GI/st + GI many-server fluid queue. Queueing Systems 71(4):405–444.CrossrefGoogle Scholar
  • 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.CrossrefGoogle Scholar
  • Liu Y, Whitt W (2014) Many-server heavy-traffic limits for queues with time-varying parameters. Ann. Appl. Probab. 24(1):378–421.CrossrefGoogle Scholar
  • Mandelbaum A, Momčilović P, Tseytlin Y (2012) On fair routing from emergency departments to hospital wards: QED queues with heterogeneous servers. Management Sci. 58(7):1273–1291.LinkGoogle Scholar
  • Mayo E (1933) The Human Problems of an Industrial Civilization (Scott Foresman, Glenville, IL).Google Scholar
  • Ni EC, Henderson SG (2015) How hard are steady-state queueing simulations? ACM Trans. Modeling Comput. Simulation (TOMACS) 25(4):27.CrossrefGoogle Scholar
  • Pang G, Whitt W (2010) Two-parameter heavy-traffic limits for infinite-server queues. Queueing Systems 65(4):325–364.CrossrefGoogle Scholar
  • Puterman ML (2005) Markov Decison Processes: Discrete Stochastic Dynamic Programming, 2nd ed. (Wiley, Hoboken, NJ).Google Scholar
  • Ross SM (1996) Stochastic Processes, 2nd ed. (Wiley, New York).Google Scholar
  • Sawyerr OO, Srinivas S, Wang S (2009) Call center employee personality factors and service performance. J. Services Marketing 23(5):301–317.CrossrefGoogle Scholar
  • Sisselman MJ, Whitt W (2007) Value-based routing and preference-based routing in customer contact centers. Production Oper. Management 16(3):277–291.CrossrefGoogle Scholar
  • Srikant R, Whitt W (1996) Simulation run lengths to estimate blocking probabilities. ACM Trans. Modeling Comput. Simulation (TOMACS) 6(1):7–52.CrossrefGoogle Scholar
  • Taylor FW (1911) Principles of Scientific Management (Harper and Brothers, New York).Google Scholar
  • 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.CrossrefGoogle Scholar
  • Walpole RE, Myers RH, Myers SL, Ye K (1993) Probability and Statistics for Engineers and Scientists, Vol. 5 (Macmillan, New York).Google Scholar
  • Whitt W (1982) Approximating a point process by a renewal process, Part I: Two basic methods. Oper. Res. 30(1):125–147.LinkGoogle Scholar
  • Whitt W (1989) Planning queueing simulations. Management Sci. 35(11):1341–1366.LinkGoogle Scholar
  • Whitt W (1991) A review of L = λW and extensions. Queueing Systems 9(3):235–268.CrossrefGoogle Scholar
  • Whitt W (2002) Stochastic-Process Limits (Springer, New York).CrossrefGoogle Scholar
  • Whitt W (2006a) Fluid models for multiserver queues with abandonments. Oper. Res. 54(1):37–54.LinkGoogle Scholar
  • Whitt W (2006b) The impact of increased employee retention upon performance in a customer contact center. Manufacturing Service Oper. Management 81(3):221–234.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.