IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v42y1996i9p1247-1259.html
   My bibliography  Save this article

Overlapping Start-Time Bands in Implicit Tour Scheduling

Author

Listed:
  • Larry W. Jacobs

    (Department of Operations Management and Information Systems, Northern Illinois University, DeKalb, Illinois 60115)

  • Michael J. Brusco

    (Department of Information and Management Sciences, The Florida State University, Tallahassee, Florida 32306-1042)

Abstract

Many organizations face personnel scheduling decisions under conditions of variable demand for service across a seven-day planning horizon. These organizations must assign employees to daily shifts that efficiently satisfy the demand for labor, yet allow adequate time for rest between subsequent shifts of an employee's weekly tour schedule. To meet these diverse objectives, managers may permit shifts to begin (and end) in any planning period of the day, but place bands on shift-start times to which individuals may be assigned on each day of their tour schedule. We present a compact integer programming model that implicitly represents start-time band scheduling flexibility. We demonstrate the new model by applying it to requirements for toll collectors on the Illinois Tollway. Problems requiring up to two million variables using a general set covering formulation were represented using the new implicit programming model and often solved to optimality in just a few minutes on a Pentium-based microcomputer. The results indicate that start-time bands can provide an important improvement in scheduling efficiency when compared to the exclusive use of schedules that require workers to begin work on the same hour of the day on each day of their tour.

Suggested Citation

  • Larry W. Jacobs & Michael J. Brusco, 1996. "Overlapping Start-Time Bands in Implicit Tour Scheduling," Management Science, INFORMS, vol. 42(9), pages 1247-1259, September.
    • Handle: RePEc:inm:ormnsc:v:42:y:1996:i:9:p:1247-1259
    DOI: 10.1287/mnsc.42.9.1247
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.42.9.1247
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.42.9.1247?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
    ---><---

    Citations

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


    Cited by:

    1. 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.
    2. 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.
    3. Idris Addou & François Soumis, 2007. "Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap," Annals of Operations Research, Springer, vol. 155(1), pages 177-205, November.
    4. 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.
    5. 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.
    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. 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.
    8. M J Brusco & T R Johns, 2011. "An integrated approach to shift-starting time selection and tour-schedule construction," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1357-1364, July.
    9. 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.
    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.

    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:ormnsc:v:42:y:1996:i:9:p:1247-1259. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.