IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v272y2019i1d10.1007_s10479-018-2848-5.html
   My bibliography  Save this article

Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model

Author

Listed:
  • Adibah Shuib

    (Universiti Teknologi MARA)

  • Faiq Izzuddin Kamarudin

    (Universiti Teknologi MARA)

Abstract

Shift scheduling problem (SSP) is a complex NP-hard integer programming problem, especially when many shifts and large number of workers of various ranks and multi-skills are involved. Shift scheduling also needs to comply with certain labour regulations and organisation’s rules and policies. Various models for SSP have been developed and solved. However, studies on SSP for workers of power stations or utility providers are still lacking. This paper presents the study on shift scheduling of workers at the largest power station in Malaysia. The objectives of this study are to identify main criteria and conditions of SSP at the power station, to formulate a Binary Integer Goal Programming (BGP) model for SSP that optimises workers’ day-off preference and to determine the optimal schedule for workers based on the model. The scheduling focuses on three processes which are demand modelling, shift scheduling and day-off scheduling. The study involves scheduling 43 workers in a selected department of the power station for 28 days where workers work in three shifts (morning, evening and night shifts) and have standby and rest days. The SSP-BGP model considers workers’ day-off preference as its main feature and introduces objective function that maximises the overachievement and minimises under-achievement of the day-off preference. It addresses conflicting multi-objectives in determining the optimal schedule using the goal programming approach. The model also put forward new hard and soft constraints, which reflect the nature of shifts’ requirements for these workers when determining the optimal schedule. The required data have been obtained from the power station and validation and verification of the model has been acquired with the cooperation from its personnel. The SSP-BGP model was solved using MATLAB in reasonable time. It significantly reduces the time to obtain a monthly schedule as compared to current manually done scheduling. Based on the 28-day schedule obtained, the day-off preference’s satisfaction of workers has increased by 37.21% that is from 43.02% based on the existing prepared schedule to 80.23% according to the schedule produced based on the SSP-BGP model. The model has shown good performance by not only generating optimal schedule based on the required number and composition of workers for shifts but also providing positive impacts on workers through day-off preferences’ satisfaction and the possibility of working with different groups.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:272:y:2019:i:1:d:10.1007_s10479-018-2848-5
    DOI: 10.1007/s10479-018-2848-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-2848-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-018-2848-5?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. Alex Bonutti & Sara Ceschia & Fabio De Cesco & Nysret Musliu & Andrea Schaerf, 2017. "Modeling and solving a real-life multi-skill shift design problem," Annals of Operations Research, Springer, vol. 252(2), pages 365-382, May.
    2. Jens Brunner & Jonathan Bard & Rainer Kolisch, 2009. "Flexible shift scheduling of physicians," Health Care Management Science, Springer, vol. 12(3), pages 285-305, September.
    3. Sandjai Bhulai & Ger Koole & Auke Pot, 2008. "Simple Methods for Shift Scheduling in Multiskill Call Centers," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 411-420, December.
    4. Guy Eitzen & David Panton & Graham Mills, 2004. "Multi-Skilled Workforce Optimisation," Annals of Operations Research, Springer, vol. 127(1), pages 359-372, March.
    5. U Aickelin & E K Burke & J Li, 2007. "An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1574-1585, December.
    6. Topaloglu, Seyda, 2009. "A shift scheduling model for employees with different seniority levels and an application in healthcare," European Journal of Operational Research, Elsevier, vol. 198(3), pages 943-957, November.
    7. Seyda Topaloglu & Irem Ozkarahan, 2004. "An Implicit Goal Programming Model for the Tour Scheduling Problem Considering the Employee Work Preferences," Annals of Operations Research, Springer, vol. 128(1), pages 135-158, April.
    8. Lin Xie & Marius Merschformann & Natalia Kliewer & Leena Suhl, 2017. "Metaheuristics approach for solving personalized crew rostering problem in public bus transit," Journal of Heuristics, Springer, vol. 23(5), pages 321-347, October.
    9. 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.
    10. Salem Al-Yakoob & Hanif Sherali, 2007. "Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations," Annals of Operations Research, Springer, vol. 155(1), pages 119-142, 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. Xu, Shuling & Hall, Nicholas G., 2021. "Fatigue, personnel scheduling and operations: Review and research opportunities," European Journal of Operational Research, Elsevier, vol. 295(3), pages 807-822.
    2. Emir Hüseyin Özder & Evrencan Özcan & Tamer Eren, 2019. "Staff Task-Based Shift Scheduling Solution with an ANP and Goal Programming Method in a Natural Gas Combined Cycle Power Plant," Mathematics, MDPI, vol. 7(2), pages 1-26, February.
    3. Mustafa Oğuz Afacan & Umut Dur & William Harris, 2021. "School Choice with Hybrid Schedules," Games, MDPI, vol. 12(2), pages 1-11, April.

    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. 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.
    2. 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.
    3. Brech, Claus-Henning & Ernst, Andreas & Kolisch, Rainer, 2019. "Scheduling medical residents’ training at university hospitals," European Journal of Operational Research, Elsevier, vol. 274(1), pages 253-266.
    4. 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.
    5. Wolbeck, Lena Antonia, 2019. "Fairness aspects in personnel scheduling," Discussion Papers 2019/16, Free University Berlin, School of Business & Economics.
    6. Andreas Fügener & Jens O. Brunner, 2019. "Planning for Overtime: The Value of Shift Extensions in Physician Scheduling," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 732-744, October.
    7. Jens Brunner & Günther Edenharter, 2011. "Long term staff scheduling of physicians with different experience levels in hospitals using column generation," Health Care Management Science, Springer, vol. 14(2), pages 189-202, June.
    8. 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.
    9. Stolletz, Raik & Brunner, Jens O., 2012. "Fair optimization of fortnightly physician schedules with flexible shifts," European Journal of Operational Research, Elsevier, vol. 219(3), pages 622-629.
    10. Castaño, Fabián & Velasco, Nubia, 2020. "Exact and heuristic approaches for the automated design of medical trainees rotation schedules," Omega, Elsevier, vol. 97(C).
    11. 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.
    12. Peyman Kiani Nahand & Mahdi Hamid & Mahdi Bastan & Ali Mollajan, 2019. "Human resource management: new approach to nurse scheduling by considering human error," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(6), pages 1429-1443, December.
    13. Ağralı, Semra & Taşkın, Z. Caner & Ünal, A. Tamer, 2017. "Employee scheduling in service industries with flexible employee availability and demand," Omega, Elsevier, vol. 66(PA), pages 159-169.
    14. S M Al-Yakoob & H D Sherali, 2008. "A column generation approach for an employee scheduling problem with multiple shifts and work locations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 34-43, January.
    15. Salem Al-Yakoob & Hanif Sherali, 2007. "Mixed-integer programming models for an employee scheduling problem with multiple shifts and work locations," Annals of Operations Research, Springer, vol. 155(1), pages 119-142, November.
    16. Wang, Wenshu & Xie, Kexin & Guo, Siqi & Li, Weixing & Xiao, Fan & Liang, Zhe, 2023. "A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements," European Journal of Operational Research, Elsevier, vol. 310(1), pages 360-378.
    17. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    18. David Rea & Craig Froehle & Suzanne Masterson & Brian Stettler & Gregory Fermann & Arthur Pancioli, 2021. "Unequal but Fair: Incorporating Distributive Justice in Operational Allocation Models," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2304-2320, July.
    19. Sandeep Rath & Kumar Rajaram, 2022. "Staff Planning for Hospitals with Implicit Cost Estimation and Stochastic Optimization," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1271-1289, March.
    20. 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.

    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:272:y:2019:i:1:d:10.1007_s10479-018-2848-5. 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.