IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v128y2004i1p199-21510.1023-banor.0000019105.54898.a4.html
   My bibliography  Save this article

Mixed Integer Programming to Schedule a Single-Shift Workforce under Annualized Hours

Author

Listed:
  • Carlos Azmat
  • Tony Hürlimann
  • Marino Widmer

Abstract

Nowadays flexibility is a strategic concept for firms. Indeed workload has to follow, as close as possible, the development of demand throughout the year. However, firms cannot engage and dismiss employees according to production requirements. Thus, workforce scheduling becomes a delicate task. In this paper, four mixed integer programming models are developed to solve the workforce schedule problem for a single-shift. The annualized hour scenario is considered with respect to a set of Swiss legal constrains. Furthermore, the minimal required workforce is guaranteed and it is assumed that each employee is able to perform each task within the team. All employees are full-time workers. Copyright Kluwer Academic Publishers 2004

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:128:y:2004:i:1:p:199-215:10.1023/b:anor.0000019105.54898.a4
    DOI: 10.1023/B:ANOR.0000019105.54898.a4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000019105.54898.a4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000019105.54898.a4?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.

    Citations

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


    Cited by:

    1. Yuan Gao & Qian Zhang & Chun Kit Lau & Bhagwat Ram, 2022. "Robust Appointment Scheduling in Healthcare," Mathematics, MDPI, vol. 10(22), pages 1-15, November.
    2. 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.
    3. A Corominas & J Olivella & R Pastor, 2010. "Capacity planning with working time accounts in services," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(2), pages 321-331, February.
    4. 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.
    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. D Thiel, 2009. "Dynamic modelling of labour assignment flexibility in the French fresh food industry," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(5), pages 652-662, May.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Adibah Shuib & Faiq Izzuddin Kamarudin, 2019. "Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model," Annals of Operations Research, Springer, vol. 272(1), pages 355-372, January.
    13. M Lezaun & G Pérez & E Sáinz de la Maza, 2006. "Crew rostering problem in a public transport company," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1173-1179, October.

    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:128:y:2004:i:1:p:199-215:10.1023/b:anor.0000019105.54898.a4. 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: 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.