IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v49y2001i4p549-564.html
   My bibliography  Save this article

Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands

Author

Listed:
  • Linda V. Green

    (Columbia Business School, 3022 Broadway, Room 423, New York, New York 10027)

  • Peter J. Kolesar

    (Columbia Business School, 3022 Broadway, Room 408, New York, New York 10027)

  • João Soares

    (Department of Mathematics, University of Coimbra, Coimbra, Portugal)

Abstract

This paper evaluates the practice of determining staffing requirements in service systems with random cyclic demands by using a series of stationary queueing models. We consider Markovian models with sinusoidal arrival rates and use numerical methods to show that the commonly used “stationary independent period by period” (SIPP) approach to setting staffing requirements is inaccurate for parameter values corresponding to many real situations. Specifically, using the SIPP approach can result in staffing levels that do not meet specified period by period probability of delay targets during a significant fraction of the cycle. We determine the manner in which the various system parameters affect SIPP reliability and identify domains for which SIPP will be accurate. After exploring several alternatives, we propose two simple modifications of SIPP that will produce reliable staffing levels in models whose parameters span a broad range of practical situations. Our conclusions from the sinusoidal model are tested against some empirical data.

Suggested Citation

  • Linda V. Green & Peter J. Kolesar & João Soares, 2001. "Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands," Operations Research, INFORMS, vol. 49(4), pages 549-564, August.
  • Handle: RePEc:inm:oropre:v:49:y:2001:i:4:p:549-564
    DOI: 10.1287/opre.49.4.549.11228
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.49.4.549.11228
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.49.4.549.11228?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Linda V. Green & Peter J. Kolesar, 1995. "On the Accuracy of the Simple Peak Hour Approximation for Markovian Queues," Management Science, INFORMS, vol. 41(8), pages 1353-1370, August.
    2. Linda Green & Peter Kolesar, 1984. "The Feasibility of One-Officer Patrol in New York City," Management Science, INFORMS, vol. 30(8), pages 964-981, August.
    3. Michael J. Brusco & Larry W. Jacobs & Robert J. Bongiorno & Duane V. Lyons & Baoxing Tang, 1995. "Improving Personnel Scheduling at Airline Stations," Operations Research, INFORMS, vol. 43(5), pages 741-751, October.
    4. Philip E. Taylor & Stephen J. Huxley, 1989. "A Break from Tradition for the San Francisco Police: Patrol Officer Scheduling Using an Optimization-Based Decision Support System," Interfaces, INFORMS, vol. 19(1), pages 4-24, February.
    5. Linda Green & Peter Kolesar, 1991. "The Pointwise Stationary Approximation for Queues with Nonstationary Arrivals," Management Science, INFORMS, vol. 37(1), pages 84-97, January.
    6. Helman I. Stern & Marvin Hersh, 1980. "Scheduling Aircraft Cleaning Crews," Transportation Science, INFORMS, vol. 14(3), pages 277-291, August.
    7. Thomas J. Holloran & Judson E. Byrn, 1986. "United Airlines Station Manpower Planning System," Interfaces, INFORMS, vol. 16(1), pages 39-50, February.
    8. Linda V. Green & Peter J. Kolesar, 1997. "The Lagged PSA for Estimating Peak Congestion in Multiserver Markovian Queues with Periodic Arrival Rates," Management Science, INFORMS, vol. 43(1), pages 80-87, January.
    9. M. Segal, 1974. "The Operator-Scheduling Problem: A Network-Flow Approach," Operations Research, INFORMS, vol. 22(4), pages 808-823, August.
    10. Mohan Gopalakrishnan & Srimathy Gopalakrishnan & David M. Miller, 1993. "A Decision Support System for Scheduling Personnel in a Newspaper Publishing Environment," Interfaces, INFORMS, vol. 23(4), pages 104-115, August.
    11. Linda Green & Peter Kolesar & Anthony Svoronos, 1991. "Some Effects of Nonstationarity on Multiserver Markovian Queueing Systems," Operations Research, INFORMS, vol. 39(3), pages 502-511, June.
    12. Leslie C. Edie, 1954. "Traffic Delays at Toll Booths," Operations Research, INFORMS, vol. 2(2), pages 107-138, May.
    13. David Y. Sze, 1984. "OR Practice—A Queueing Model for Telephone Operator Staffing," Operations Research, INFORMS, vol. 32(2), pages 229-249, April.
    14. Bruce Andrews & Henry Parsons, 1993. "Establishing Telephone-Agent Staffing Levels through Economic Optimization," Interfaces, INFORMS, vol. 23(2), pages 14-20, April.
    15. Peter J. Kolesar & Kenneth L. Rider & Thomas B. Crabill & Warren E. Walker, 1975. "A Queuing-Linear Programming Approach to Scheduling Police Patrol Cars," Operations Research, INFORMS, vol. 23(6), pages 1045-1062, December.
    16. Gary M. Thompson, 1997. "Labor staffing and scheduling models for controlling service levels," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(8), pages 719-740, December.
    17. Bruce H. Andrews & Henry L. Parsons, 1989. "L. L. Bean Chooses a Telephone Agent Scheduling System," Interfaces, INFORMS, vol. 19(6), pages 1-9, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Linda V. Green & Peter J. Kolesar, 1998. "A Note on Approximating Peak Congestion in Mt/G/\infty Queues with Sinusoidal Arrivals," Management Science, INFORMS, vol. 44(11-Part-2), pages 137-144, November.
    2. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    3. Schwarz, Justus Arne & Selinka, Gregor & Stolletz, Raik, 2016. "Performance analysis of time-dependent queueing systems: Survey and classification," Omega, Elsevier, vol. 63(C), pages 170-189.
    4. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    5. Castillo, Ignacio & Joro, Tarja & Li, Yong Yue, 2009. "Workforce scheduling with multiple objectives," European Journal of Operational Research, Elsevier, vol. 196(1), pages 162-170, July.
    6. Michael J. Brusco & Larry W. Jacobs, 1998. "Personnel Tour Scheduling When Starting-Time Restrictions Are Present," Management Science, INFORMS, vol. 44(4), pages 534-547, April.
    7. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    8. S Casado & M Laguna & J Pacheco, 2005. "Heuristical labour scheduling to optimize airport passenger flows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 649-658, June.
    9. Samantha L. Zimmerman & Alexander R. Rutherford & Alexa Waall & Monica Norena & Peter Dodek, 2023. "A queuing model for ventilator capacity management during the COVID-19 pandemic," Health Care Management Science, Springer, vol. 26(2), pages 200-216, June.
    10. Brusco, Michael J. & Jacobs, Larry W., 2001. "Starting-time decisions in labor tour scheduling: An experimental analysis and case study," European Journal of Operational Research, Elsevier, vol. 131(3), pages 459-475, June.
    11. Easton, Fred F. & Mansour, Nashat, 1999. "A distributed genetic algorithm for deterministic and stochastic labor scheduling problems," European Journal of Operational Research, Elsevier, vol. 118(3), pages 505-523, November.
    12. Casado Yusta, S. & Pacheco Bonrostro, J., 2003. "Estudio comparativo de diferentes estrategias metaheurísticas para la resolución del labor scheduling problem./Analisys of different methauristas for solving labor scheduling," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 21, pages 537-554, December.
    13. Gary M. Thompson, 1997. "Labor staffing and scheduling models for controlling service levels," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(8), pages 719-740, December.
    14. Michael J. Brusco & Larry W. Jacobs, 2000. "Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling," Management Science, INFORMS, vol. 46(12), pages 1630-1641, December.
    15. Brusco, Michael J. & Jacobs, Larry W., 1995. "Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations," European Journal of Operational Research, Elsevier, vol. 86(2), pages 249-261, October.
    16. Thompson, Gary M. & Goodale, John C., 2006. "Variable employee productivity in workforce scheduling," European Journal of Operational Research, Elsevier, vol. 170(2), pages 376-390, April.
    17. Robert M. Saltzman & Vijay Mehrotra, 2001. "A Call Center Uses Simulation to Drive Strategic Change," Interfaces, INFORMS, vol. 31(3), pages 87-101, June.
    18. Thompson, Gary M. & Pullman, Madeleine E., 2007. "Scheduling workforce relief breaks in advance versus in real-time," European Journal of Operational Research, Elsevier, vol. 181(1), pages 139-155, August.
    19. Oyku Ahipasaoglu & Nesim Erkip & Oya Ekin Karasan, 2019. "The venue management problem: setting staffing levels, shifts and shift schedules at concession stands," Journal of Scheduling, Springer, vol. 22(1), pages 69-83, February.
    20. Brusco, Michael J. & Jacobs, Larry W., 1998. "Eliminating redundant columns in continuous tour scheduling problems," European Journal of Operational Research, Elsevier, vol. 111(3), pages 518-525, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:49:y:2001:i:4:p:549-564. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.