IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v32y2004i5p333-344.html
   My bibliography  Save this article

Real-time schedule adjustment decisions: a case study

Author

Listed:
  • Hur, Daesik
  • Mabert, Vincent A.
  • Bretthauer, K.M.Kurt M.

Abstract

Service capacity management has been extensively studied and successfully applied in many industries, with an emphasis on tour/shift scheduling and assignment decisions. However, few studies have addressed real-time work schedule adjustment decisions made necessary by demand uncertainty and/or labor supply disruption. This case study deals with the real-time work schedule adjustment decision and investigates the association of managerial experience, workforce mix (full- and part-time staff), and information accuracy with managers' adjustment decisions. We designed an experiment that involved practicing service managers from a McDonald's franchise who provided their adjustment decisions for a given set of test scenarios. Their decisions were analyzed and evaluated via a controlled experiment. Using profitability as the primary performance measure, the study identifies the following outcomes: First, senior managers of a store with a higher proportion of part-time staff made more adjustments and attained slightly higher profitability than junior managers, when all employees accepted adjusted schedules. Second, managers of a store with a higher proportion of part-time staff were able to make slightly higher profits, particularly when capacity shortages occurred. And third, to achieve the majority of the benefits from schedule adjustments, it is sufficient to search for information that correctly identifies the direction of demand changes, rather than identifying the exact magnitude of the changes.

Suggested Citation

  • Hur, Daesik & Mabert, Vincent A. & Bretthauer, K.M.Kurt M., 2004. "Real-time schedule adjustment decisions: a case study," Omega, Elsevier, vol. 32(5), pages 333-344, October.
    • Handle: RePEc:eee:jomega:v:32:y:2004:i:5:p:333-344
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(04)00005-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fred F. Easton & Donald F. Rossin, 1991. "Sufficient Working Subsets for the Tour Scheduling Problem," Management Science, INFORMS, vol. 37(11), pages 1441-1451, November.
    2. Robert R. Love & James M. Hoey, 1990. "Management Science Improves Fast-Food Operations," Interfaces, INFORMS, vol. 20(2), pages 21-29, April.
    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. Jackie Hueter & William Swart, 1998. "An Integrated Labor-Management System for Taco Bell," Interfaces, INFORMS, vol. 28(1), pages 75-91, February.
    5. Ahmad I. Z. Jarrah & Jonathan F. Bard & Anura H. deSilva, 1994. "Solving Large-Scale Tour Scheduling Problems," Management Science, INFORMS, vol. 40(9), pages 1124-1144, September.
    6. 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.
    7. Srinagesh Gavirneni & Roman Kapuscinski & Sridhar Tayur, 1999. "Value of Information in Capacitated Supply Chains," Management Science, INFORMS, vol. 45(1), pages 16-24, January.
    8. E. H. Bowman, 1963. "Consistency and Optimality in Managerial Decision Making," Management Science, INFORMS, vol. 9(2), pages 310-321, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. TANASE, George Cosmin, 2014. "The Value Contribution of Service Capacity Management to the Company s Operations and Performance," Romanian Distribution Committee Magazine, Romanian Distribution Committee, vol. 5(4), pages 14-18, December.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Scott E. Sampson, 2008. "OR PRACTICE---Optimization of Vacation Timeshare Scheduling," Operations Research, INFORMS, vol. 56(5), pages 1079-1088, October.
    6. Haase, Knut, 1999. "Retail business staff scheduling under complex labor relations," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 511, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Aykin, Turgut, 2000. "A comparative evaluation of modeling approaches to the labor shift scheduling problem," European Journal of Operational Research, Elsevier, vol. 125(2), pages 381-397, September.
    8. Ferdinand Kiermaier & Markus Frey & Jonathan F. Bard, 2020. "The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers," Journal of Scheduling, Springer, vol. 23(2), pages 177-209, April.
    9. Peters, Emmanuel & de Matta, Renato & Boe, Warren, 2007. "Short-term work scheduling with job assignment flexibility for a multi-fleet transport system," European Journal of Operational Research, Elsevier, vol. 180(1), pages 82-98, July.
    10. Brusco, Michael J. & Johns, Tony R., 1996. "A sequential integer programming method for discontinuous labor tour scheduling," European Journal of Operational Research, Elsevier, vol. 95(3), pages 537-548, December.
    11. 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.
    12. Lagodimos, A. G. & Leopoulos, V., 2000. "Greedy heuristic algorithms for manpower shift planning," International Journal of Production Economics, Elsevier, vol. 68(1), pages 95-106, October.
    13. María I. Restrepo & Bernard Gendron & Louis-Martin Rousseau, 2016. "Branch-and-Price for Personalized Multiactivity Tour Scheduling," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 334-350, May.
    14. Mark W. Isken & Osman T. Aydas, 2022. "A tactical multi-week implicit tour scheduling model with applications in healthcare," Health Care Management Science, Springer, vol. 25(4), pages 551-573, December.
    15. 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.
    16. Brusco, Michael J., 2015. "A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives," European Journal of Operational Research, Elsevier, vol. 247(1), pages 46-59.
    17. Hua Ni & Hernán Abeledo, 2007. "A branch-and-price approach for large-scale employee tour scheduling problems," Annals of Operations Research, Springer, vol. 155(1), pages 167-176, November.
    18. Najmaddin Akhundov & Nail Tahirov & Christoph H. Glock, 2022. "Optimal Scheduling of Waitstaff with Different Experience Levels at a Restaurant Chain," Interfaces, INFORMS, vol. 52(4), pages 324-343, July.
    19. Cai, X. & Li, K. N., 2000. "A genetic algorithm for scheduling staff of mixed skills under multi-criteria," European Journal of Operational Research, Elsevier, vol. 125(2), pages 359-369, September.
    20. Gerard M. Campbell, 1999. "Cross-Utilization of Workers Whose Capabilities Differ," Management Science, INFORMS, vol. 45(5), pages 722-732, May.

    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:eee:jomega:v:32:y:2004:i:5:p:333-344. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.