IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v155y2007i1p167-17610.1007-s10479-007-0212-2.html
   My bibliography  Save this article

A branch-and-price approach for large-scale employee tour scheduling problems

Author

Listed:
  • Hua Ni
  • Hernán Abeledo

Abstract

We present a new methodology for solving large-scale employee tour scheduling problems. An integer programming model is proposed where tours are decomposed into shifts and start times. This formulation can model complex shift and start time rules for both continuous and discontinuous scheduling problems. A branch-and-price approach is devised to solve this model efficiently. The methodology was tested on the largest tour scheduling problems found in the open literature. In comparison with an alternative implicit model, our approach showed superior computational performance. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:155:y:2007:i:1:p:167-176:10.1007/s10479-007-0212-2
    DOI: 10.1007/s10479-007-0212-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0212-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-007-0212-2?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
    ---><---

    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. Anuj Mehrotra & Kenneth E. Murphy & Michael A. Trick, 2000. "Optimal shift scheduling: A branch‐and‐price approach," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 185-200, April.
    2. Tolga Çezik & Oktay Günlük & Hanan Luss, 2001. "An integer programming model for the weekly tour scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(7), pages 607-624, October.
    3. John J. Bartholdi, 1981. "A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering," Operations Research, INFORMS, vol. 29(3), pages 501-510, June.
    4. Mark Isken, 2004. "An Implicit Tour Scheduling Model with Applications in Healthcare," Annals of Operations Research, Springer, vol. 128(1), pages 91-109, April.
    5. R. N. Burns & M. W. Carter, 1985. "Work Force Size and Single Shift Schedules with Variable Demands," Management Science, INFORMS, vol. 31(5), pages 599-607, May.
    6. 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.
    7. Bechtold, Stephen E. & Brusco, Michael J., 1994. "Working set generation methods for labor tour scheduling," European Journal of Operational Research, Elsevier, vol. 74(3), pages 540-551, May.
    8. 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.
    9. James G. Morris & Michael J. Showalter, 1983. "Simple Approaches to Shift, Days-Off and Tour Scheduling Problems," Management Science, INFORMS, vol. 29(8), pages 942-950, August.
    10. 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.
    11. 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.
    12. Stephen E. Bechtold & Larry W. Jacobs, 1990. "Implicit Modeling of Flexible Break Assignments in Optimal Shift Scheduling," Management Science, INFORMS, vol. 36(11), pages 1339-1351, November.
    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. Lishun Zeng & Mingyu Zhao & Yangfan Liu, 2019. "Airport ground workforce planning with hierarchical skills: a new formulation and branch-and-price approach," Annals of Operations Research, Springer, vol. 275(1), pages 245-258, April.
    2. 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.
    3. Marta Rocha & José Oliveira & Maria Carravilla, 2014. "A constructive heuristic for staff scheduling in the glass industry," Annals of Operations Research, Springer, vol. 217(1), pages 463-478, June.
    4. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.
    5. 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.
    6. 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.
    7. Wasakorn Laesanklang & Dario Landa-Silva, 2017. "Decomposition techniques with mixed integer programming and heuristics for home healthcare planning," Annals of Operations Research, Springer, vol. 256(1), pages 93-127, September.

    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. 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.
    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. 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.
    4. Jens O. Brunner & Jonathan F. Bard & Jan M. Köhler, 2013. "Bounded flexibility in days‐on and days‐off scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(8), pages 678-701, December.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Jonathan Bard & David Morton & Yong Wang, 2007. "Workforce planning at USPS mail processing and distribution centers using stochastic optimization," Annals of Operations Research, Springer, vol. 155(1), pages 51-78, November.
    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. 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.
    12. Giovanni Felici & Claudio Gentile, 2004. "A Polyhedral Approach for the Staff Rostering Problem," Management Science, INFORMS, vol. 50(3), pages 381-393, March.
    13. Tolga Çezik & Oktay Günlük & Hanan Luss, 2001. "An integer programming model for the weekly tour scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(7), pages 607-624, October.
    14. L Wan & J F Bard, 2007. "Weekly staff scheduling with workstation group restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(8), pages 1030-1046, August.
    15. 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.
    16. Robbins, Thomas R. & Harrison, Terry P., 2010. "A stochastic programming model for scheduling call centers with global Service Level Agreements," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1608-1619, December.
    17. 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.
    18. 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.
    19. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    20. 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.

    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:spr:annopr:v:155:y:2007:i:1:p:167-176:10.1007/s10479-007-0212-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.