IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v28y2026i2p440-458.html

Capacity Planning for Resource Turnaround Operations

Author

Listed:
  • Buyun Li

    (Operations and Decision Technologies, Kelley School of Business, Indiana University, Bloomington, Indiana 47405)

  • Vincent W. Slaugh

    (Nolan School of Hotel Administration, SC Johnson College of Business, Cornell University, Ithaca, New York 14853)

Abstract

Problem definition : Many shared resources, such as hotel rooms or rental cars, require cleaning, charging, or some other operation to “turn around” the resources between successive customer uses. We study staffing and shift planning decisions for the turnaround service capacity in order to minimize the sum of customer waiting and staffing costs. Stochastic customer arrival and departure patterns, coupled with worker shifts with breaks, add to the managerial challenge. Methodology/results : Using the frameworks of diminishing return submodularity and M-convexity, we demonstrate analytical properties for capacity decisions in three staffing scenarios, including our primary model that focuses on shift planning. We propose a solution heuristic that efficiently provides near-optimal solutions. We illustrate the value of our model for hotel housekeeping operations using data from a large city-center hotel. Reallocating some room attendants to different shift start times, especially later in the day compared with current practice, can effectively eliminate guest waiting after the posted check-in time. Managerial implications : Hotels can reduce room attendant idleness and room readiness issues by departing from the common industry practice of all workers starting at 8:00 a.m. Simply having two shift start times in the morning may virtually eliminate waiting and help in recruiting and retaining workers.

Suggested Citation

  • Buyun Li & Vincent W. Slaugh, 2026. "Capacity Planning for Resource Turnaround Operations," Manufacturing & Service Operations Management, INFORMS, vol. 28(2), pages 440-458, March.
  • Handle: RePEc:inm:ormsom:v:28:y:2026:i:2:p:440-458
    DOI: 10.1287/msom.2025.0395
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2025.0395
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2025.0395?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. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Akiyoshi Shioura, 2022. "M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 1566-1611, May.
    3. 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.
    4. Mor Kaspi & Tal Raviv & Michal Tzur, 2017. "Bike-sharing systems: User dissatisfaction in the presence of unusable bicycles," IISE Transactions, Taylor & Francis Journals, vol. 49(2), pages 144-158, February.
    5. Christos Zacharias & Tallys Yunes, 2020. "Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs," Management Science, INFORMS, vol. 66(2), pages 744-763, February.
    6. Marcel F. Neuts & David M. Lucantoni, 1979. "A Markovian Queue with N Servers Subject to Breakdowns and Repairs," Management Science, INFORMS, vol. 25(9), pages 849-861, September.
    7. Christos Zacharias & Michael Pinedo, 2017. "Managing Customer Arrivals in Service Systems with Multiple Identical Servers," Manufacturing & Service Operations Management, INFORMS, vol. 19(4), pages 639-656, October.
    8. Babu George & Justin Paul (ed.), 2020. "Digital Transformation in Business and Society," Springer Books, Springer, number 978-3-030-08277-2, March.
    9. Alex F. Mills & Jonathan E. Helm & Yu Wang, 2021. "Surge Capacity Deployment in Hospitals: Effectiveness of Response and Mitigation Strategies," Manufacturing & Service Operations Management, INFORMS, vol. 23(2), pages 367-387, March.
    10. James Gaughan & Hugh Gravelle & Luigi Siciliani, 2015. "Testing the Bed‐Blocking Hypothesis: Does Nursing and Care Home Supply Reduce Delayed Hospital Discharges?," Health Economics, John Wiley & Sons, Ltd., vol. 24(S1), pages 32-44, March.
    11. 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.
    12. Gabriel R. Bitran & Stephen M. Gilbert, 1996. "Managing Hotel Reservations with Uncertain Arrivals," Operations Research, INFORMS, vol. 44(1), pages 35-49, February.
    13. Vincent W. Slaugh & Bahar Biller & Sridhar R. Tayur, 2016. "Managing Rentals with Usage-Based Loss," Manufacturing & Service Operations Management, INFORMS, vol. 18(3), pages 429-444, July.
    14. Kamran Moinzadeh & Prabhu Aggarwal, 1997. "Analysis of a Production/Inventory System Subject to Random Disruptions," Management Science, INFORMS, vol. 43(11), pages 1577-1588, November.
    15. Daniel Freund & Shane G. Henderson & David B. Shmoys, 2022. "Minimizing Multimodular Functions and Allocating Capacity in Bike-Sharing Systems," Operations Research, INFORMS, vol. 70(5), pages 2715-2731, September.
    16. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. Júlíus Atlason & Marina A. Epelman & Shane G. Henderson, 2008. "Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods," Management Science, INFORMS, vol. 54(2), pages 295-309, February.
    18. Noa Zychlinski & Avishai Mandelbaum & Petar Momčilović & Izack Cohen, 2020. "Bed Blocking in Hospitals Due to Scarce Capacity in Geriatric Institutions—Cost Minimization via Fluid Models," Manufacturing & Service Operations Management, INFORMS, vol. 22(2), pages 396-411, March.
    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. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    2. Qi Luo & Viswanath Nagarajan & Alexander Sundt & Yafeng Yin & John Vincent & Mehrdad Shahabi, 2023. "Efficient Algorithms for Stochastic Ride-Pooling Assignment with Mixed Fleets," Transportation Science, INFORMS, vol. 57(4), pages 908-936, July.
    3. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    4. Valente, Matteo & Reniers, Genserik & Cozzani, Valerio, 2026. "Techno-Economic Analysis of Protection Barriers Against Fire-Induced Domino Effects in the Chemical and Process Industry," Reliability Engineering and System Safety, Elsevier, vol. 266(PB).
    5. Guanyi Wang, 2024. "Robust Network Targeting with Multiple Nash Equilibria," Papers 2410.20860, arXiv.org, revised Nov 2024.
    6. Yuval Filmus & Yasushi Kawase & Yusuke Kobayashi & Yutaro Yamaguchi, 2021. "Tight Approximation for Unconstrained XOS Maximization," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1599-1610, November.
    7. Jiaming Hu & Dachuan Xu & Donglei Du & Cuixia Miao, 2024. "Differentially private submodular maximization with a cardinality constraint over the integer lattice," Journal of Combinatorial Optimization, Springer, vol. 47(4), pages 1-24, May.
    8. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    9. Alexandre D. Jesus & Luís Paquete & Arnaud Liefooghe, 2021. "A model of anytime algorithm performance for bi-objective optimization," Journal of Global Optimization, Springer, vol. 79(2), pages 329-350, February.
    10. Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
    11. repec:dgr:rugsom:99a17 is not listed on IDEAS
    12. Omar El Housni & Huseyin Topaloglu, 2023. "Joint Assortment Optimization and Customization Under a Mixture of Multinomial Logit Models: On the Value of Personalized Assortments," Operations Research, INFORMS, vol. 71(4), pages 1197-1215, July.
    13. Lehmann, Daniel, 2020. "Quality of local equilibria in discrete exchange economies," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 141-152.
    14. Michael Kahr & Markus Leitner & Ivana Ljubić, 2024. "The Impact of Passive Social Media Viewers in Influence Maximization," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1362-1381, December.
    15. Anthony Kim & Vahab Mirrokni & Hamid Nazerzadeh, 2021. "Deals or No Deals: Contract Design for Online Advertising," Operations Research, INFORMS, vol. 69(5), pages 1450-1467, September.
    16. Levi DeValve & Saša Pekeč & Yehua Wei, 2023. "Approximate Submodularity in Network Design Problems," Operations Research, INFORMS, vol. 71(4), pages 1021-1039, July.
    17. Dean Eckles & Hossein Esfandiari & Elchanan Mossel & M. Amin Rahimian, 2022. "Seeding with Costly Network Information," Operations Research, INFORMS, vol. 70(4), pages 2318-2348, July.
    18. Eric DuBois & Ashley Peper & Laura A. Albert, 2023. "Interdicting Attack Plans with Boundedly Rational Players and Multiple Attackers: An Adversarial Risk Analysis Approach," Decision Analysis, INFORMS, vol. 20(3), pages 202-219, September.
    19. Ran Liu & Xiaolan Xie, 2018. "Physician Staffing for Emergency Departments with Time-Varying Demand," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 588-607, August.
    20. Shengminjie Chen & Donglei Du & Wenguo Yang & Suixiang Gao, 2024. "Maximizing stochastic set function under a matroid constraint from decomposition," Journal of Combinatorial Optimization, Springer, vol. 48(1), pages 1-21, August.
    21. Wenzhe Zhang & Shufang Gong & Bin Liu & Qian Liu & Priyanshi Garg, 2026. "On maximizing k-submodular functions under p-system and d-knapsack constraints," Journal of Combinatorial Optimization, Springer, vol. 51(2), pages 1-23, March.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:ormsom:v:28:y:2026:i:2:p:440-458. 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.