IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v200y2010i3p860-873.html
   My bibliography  Save this article

A flexible MILP model for multiple-shift workforce planning under annualized hours

Author

Listed:
  • Hertz, Alain
  • Lahrichi, Nadia
  • Widmer, Marino

Abstract

Flexibility in workforce planning is one of the best ways to respond to fluctuations of the demand. This paper proposes a flexible mixed integer linear programming (MILP) model to solve a multiple-shift workforce planning problem under annualized working hours. The model takes into account laws and collective agreements that impose constraints on overtime and holidays. We consider possible gradual hiring of full time and partial time workers. Several objectives are pursued such as balancing the workload of the employees or minimizing the workforce size. Computational experiments on a real life problem demonstrate the effectiveness of the model.

Suggested Citation

  • Hertz, Alain & Lahrichi, Nadia & Widmer, Marino, 2010. "A flexible MILP model for multiple-shift workforce planning under annualized hours," European Journal of Operational Research, Elsevier, vol. 200(3), pages 860-873, February.
    • Handle: RePEc:eee:ejores:v:200:y:2010:i:3:p:860-873
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00049-6
    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. Beaumont, Nicholas, 1997. "Scheduling staff using mixed integer programming," European Journal of Operational Research, Elsevier, vol. 98(3), pages 473-484, May.
    2. Corominas, Albert & Lusa, Amaia & Pastor, Rafael, 2007. "Planning annualised hours with a finite set of weekly working hours and cross-trained workers," European Journal of Operational Research, Elsevier, vol. 176(1), pages 230-239, January.
    3. 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.
    4. Hung, Rudy, 1994. "Single-shift off-day scheduling of a hierarchical workforce with variable demands," European Journal of Operational Research, Elsevier, vol. 78(1), pages 49-57, October.
    5. Azmat, Carlos S. & Widmer, Marino, 2004. "A case study of single shift planning and scheduling under annualized hours: A simple three-step approach," European Journal of Operational Research, Elsevier, vol. 153(1), pages 148-175, February.
    6. Corominas, Albert & Lusa, Amaia & Pastor, Rafael, 2007. "Using a MILP model to establish a framework for an annualised hours agreement," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1495-1506, March.
    7. Albert Corominas & Amaia Lusa & Rafael Pastor, 2007. "Planning production and working time within an annualised hours scheme framework," Annals of Operations Research, Springer, vol. 155(1), pages 5-23, November.
    8. Billionnet, Alain, 1999. "Integer programming to schedule a hierarchical workforce with variable demands," European Journal of Operational Research, Elsevier, vol. 114(1), pages 105-114, April.
    9. Hung, R, 1991. "Single-shift workforce scheduling under a compressed workweek," Omega, Elsevier, vol. 19(5), pages 494-497.
    10. Rudy Hung, 1994. "Multiple-Shift Workforce Scheduling Under the 3--4 Workweek with Different Weekday and Weekend Labor Requirements," Management Science, INFORMS, vol. 40(2), pages 280-284, February.
    11. Albert Corominas & Amaia Lusa & Rafael Pastor, 2004. "Planning Annualised Hours with a Finite Set of Weekly Working Hours and Joint Holidays," Annals of Operations Research, Springer, vol. 128(1), pages 217-233, April.
    12. Carlos Azmat & Tony Hürlimann & Marino Widmer, 2004. "Mixed Integer Programming to Schedule a Single-Shift Workforce under Annualized Hours," Annals of Operations Research, Springer, vol. 128(1), pages 199-215, April.
    13. 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.
    14. G Laporte & G Pesant, 2004. "A general multi-shift scheduling system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(11), pages 1208-1217, November.
    15. R. N. Burns & G. J. Koop, 1987. "A Modular Approach to Optimal Multiple-Shift Manpower Scheduling," Operations Research, INFORMS, vol. 35(1), pages 100-110, February.
    16. Hamilton Emmons & Richard N. Burns, 1991. "Off-Day Scheduling with Hierarchical Worker Categories," Operations Research, INFORMS, vol. 39(3), pages 484-495, June.
    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. Corominas, Albert & Lusa, Amaia & Olivella, Jordi, 2012. "A detailed workforce planning model including non-linear dependence of capacity on the size of the staff and cash management," European Journal of Operational Research, Elsevier, vol. 216(2), pages 445-458.
    2. Lin, Shih-Wei & Ying, Kuo-Ching, 2014. "Minimizing shifts for personnel task scheduling problems: A three-phase algorithm," European Journal of Operational Research, Elsevier, vol. 237(1), pages 323-334.
    3. Egbert Veen & Erwin Hans & Bart Veltman & Leo Berrevoets & Hubert Berden, 2015. "A case study of cost-efficient staffing under annualized hours," Health Care Management Science, Springer, vol. 18(3), pages 279-288, September.
    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. Lagodimos, A.G. & Mihiotis, A.N., 2010. "Efficient overtime planning in packing shops with lines of identical manning," International Journal of Production Economics, Elsevier, vol. 124(2), pages 453-462, April.
    6. Minh Phuoc Doan & Julien Fondrevelle & Valérie Botta-Genoulaz & Jose Francisco Ferreira Ribeiro, 2022. "Impact of flexible work contracts and multi-skilled agents on a multi-objective workforce planning problem," Post-Print hal-03119408, HAL.
    7. Savic, Aleksandar & Kratica, Jozef & Milanovic, Marija & Dugosija, Djordje, 2010. "A mixed integer linear programming formulation of the maximum betweenness problem," European Journal of Operational Research, Elsevier, vol. 206(3), pages 522-527, November.

    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. Azmat, Carlos S. & Widmer, Marino, 2004. "A case study of single shift planning and scheduling under annualized hours: A simple three-step approach," European Journal of Operational Research, Elsevier, vol. 153(1), pages 148-175, February.
    2. 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.
    3. 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.
    4. Broos Maenhout & Mario Vanhoucke, 2017. "A resource type analysis of the integrated project scheduling and personnel staffing problem," Annals of Operations Research, Springer, vol. 252(2), pages 407-433, May.
    5. Egbert Veen & Erwin Hans & Bart Veltman & Leo Berrevoets & Hubert Berden, 2015. "A case study of cost-efficient staffing under annualized hours," Health Care Management Science, Springer, vol. 18(3), pages 279-288, September.
    6. G Laporte & G Pesant, 2004. "A general multi-shift scheduling system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(11), pages 1208-1217, November.
    7. Lusa, Amaia & Corominas, Albert & Muñoz, Norberto, 2008. "A multistage scenario optimisation procedure to plan annualised working hours under demand uncertainty," International Journal of Production Economics, Elsevier, vol. 113(2), pages 957-968, June.
    8. Narasimhan, Rangarajan, 1997. "An algorithm for single shift scheduling of hierarchical workforce," European Journal of Operational Research, Elsevier, vol. 96(1), pages 113-121, January.
    9. Lusa, Amaia & Pastor, Rafael & Corominas, Albert, 2008. "Determining the most appropriate set of weekly working hours for planning annualised working time," International Journal of Production Economics, Elsevier, vol. 111(2), pages 697-706, February.
    10. Ulusam Seckiner, Serap & Gokcen, Hadi & Kurt, Mustafa, 2007. "An integer programming model for hierarchical workforce scheduling problem," European Journal of Operational Research, Elsevier, vol. 183(2), pages 694-699, December.
    11. Corominas, Albert & Lusa, Amaia & Olivella, Jordi, 2012. "A detailed workforce planning model including non-linear dependence of capacity on the size of the staff and cash management," European Journal of Operational Research, Elsevier, vol. 216(2), pages 445-458.
    12. Albert Corominas & Amaia Lusa & Rafael Pastor, 2007. "Planning production and working time within an annualised hours scheme framework," Annals of Operations Research, Springer, vol. 155(1), pages 5-23, November.
    13. Eiji Mizutani & Kevin Alexander Sánchez Galeano, 2023. "A note on a single-shift days-off scheduling problem with sequence-dependent labor costs," Journal of Scheduling, Springer, vol. 26(3), pages 315-329, June.
    14. Smet, Pieter & Brucker, Peter & De Causmaecker, Patrick & Vanden Berghe, Greet, 2016. "Polynomially solvable personnel rostering problems," European Journal of Operational Research, Elsevier, vol. 249(1), pages 67-75.
    15. 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.
    16. Cambini, Riccardo & Riccardi, Rossana, 2009. "Theoretical and algorithmic results for a class of hierarchical fleet mix problems," European Journal of Operational Research, Elsevier, vol. 198(3), pages 741-747, November.
    17. M Lezaun & G Pérez & E Sáinz de la Maza, 2010. "Staff rostering for the station personnel of a railway company," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1104-1111, July.
    18. 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.
    19. 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.
    20. Richard N. Burns & Rangarajan Narasimhan & L. Douglas Smith, 1998. "A set‐processing algorithm for scheduling staff on 4‐day or 3‐day work weeks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(8), pages 839-853, 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:eee:ejores:v:200:y:2010:i:3:p:860-873. 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/locate/eor .

    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.