IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v217y2014i1p463-47810.1007-s10479-013-1525-y.html
   My bibliography  Save this article

A constructive heuristic for staff scheduling in the glass industry

Author

Listed:
  • Marta Rocha
  • José Oliveira
  • Maria Carravilla

Abstract

In this paper a constructive heuristic for solving the staff scheduling problem of a glass manufacture unit is proposed. Based on simple calculations and algorithms, the developed procedure assigns working shifts and days-off to teams of employees, ensuring the satisfaction of a mandatory sequence of working shifts and the balance of the workload between employees. The computational times for the experiments with the case study company, with three eight-hour working shifts and five teams of employees, fell consistently below 5 seconds for a set of different planning periods. Results are compared with the ones achieved with an optimization model (MIP), demonstrating the good performance of the heuristic, also in terms of the quality of the achieved solutions. The heuristic rarely fails to produce a feasible solution and whenever the solution is feasible then it is also optimal. When tackling problems with a large number of teams, the heuristic maintains the good performance while the MIP model is not able to find any solution within 16 hours of running time. Although it was designed for a particular problem of the glass industry, tests show that the heuristic is flexible enough to be applied to problems with different features, from other activity sectors, encouraging further extensions of this work. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:217:y:2014:i:1:p:463-478:10.1007/s10479-013-1525-y
    DOI: 10.1007/s10479-013-1525-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-013-1525-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-013-1525-y?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. Hesham Alfares, 2004. "Survey, Categorization, and Comparison of Recent Tour Scheduling Literature," Annals of Operations Research, Springer, vol. 127(1), pages 145-175, March.
    2. 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.
    3. Margarida Moz & Margarida Pato, 2004. "Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models," Annals of Operations Research, Springer, vol. 128(1), pages 179-197, April.
    4. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    5. Noah Gans & Ger Koole & Avishai Mandelbaum, 2003. "Telephone Call Centers: Tutorial, Review, and Research Prospects," Manufacturing & Service Operations Management, INFORMS, vol. 5(2), pages 79-141, September.
    6. 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.
    7. Glass, Celia A. & Knight, Roger A., 2010. "The nurse rostering problem: A critical appraisal of the problem structure," European Journal of Operational Research, Elsevier, vol. 202(2), pages 379-389, April.
    8. 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.
    9. G Laporte, 1999. "The art and science of designing rotating schedules," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1011-1017, October.
    10. 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.
    11. Thompson, Gary M. & Goodale, John C., 2006. "Variable employee productivity in workforce scheduling," European Journal of Operational Research, Elsevier, vol. 170(2), pages 376-390, April.
    12. Guy Eitzen & David Panton & Graham Mills, 2004. "Multi-Skilled Workforce Optimisation," Annals of Operations Research, Springer, vol. 127(1), pages 359-372, March.
    13. Burke, Edmund K. & Li, Jingpeng & Qu, Rong, 2010. "A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 484-493, June.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. Uwe Aickelin & Paul White, 2004. "Building Better Nurse Scheduling Algorithms," Annals of Operations Research, Springer, vol. 128(1), pages 159-177, April.
    19. 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. Tristan Becker, 2020. "A decomposition heuristic for rotational workforce scheduling," Journal of Scheduling, Springer, vol. 23(5), pages 539-554, October.
    2. Halil İbrahim Koruca & Murat Serdar Emek & Esra Gulmez, 2023. "Development of a new personalized staff-scheduling method with a work-life balance perspective: case of a hospital," Annals of Operations Research, Springer, vol. 328(1), pages 793-820, 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. 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. 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. 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.
    4. De Bruecker, Philippe & Van den Bergh, Jorne & Beliën, Jeroen & Demeulemeester, Erik, 2015. "Workforce planning incorporating skills: State of the art," European Journal of Operational Research, Elsevier, vol. 243(1), pages 1-16.
    5. Banu Sungur & Cemal Özgüven & Yasemin Kariper, 2017. "Shift scheduling with break windows, ideal break periods, and ideal waiting times," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 203-222, June.
    6. 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.
    7. 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.
    8. Tristan Becker & Pia Mareike Steenweg & Brigitte Werners, 2019. "Cyclic shift scheduling with on-call duties for emergency medical services," Health Care Management Science, Springer, vol. 22(4), pages 676-690, December.
    9. Sanja Petrovic, 2019. "“You have to get wet to learn how to swim” applied to bridging the gap between research into personnel scheduling and its implementation in practice," Annals of Operations Research, Springer, vol. 275(1), pages 161-179, April.
    10. 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.
    11. 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.
    12. De Bruecker, Philippe & Beliën, Jeroen & Van den Bergh, Jorne & Demeulemeester, Erik, 2018. "A three-stage mixed integer programming approach for optimizing the skill mix and training schedules for aircraft maintenance," European Journal of Operational Research, Elsevier, vol. 267(2), pages 439-452.
    13. Florian Mischek & Nysret Musliu, 2019. "Integer programming model extensions for a multi-stage nurse rostering problem," Annals of Operations Research, Springer, vol. 275(1), pages 123-143, April.
    14. 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.
    15. Jaime Miranda & Pablo A. Rey & Antoine Sauré & Richard Weber, 2018. "Metro Uses a Simulation-Optimization Approach to Improve Fare-Collection Shift Scheduling," Interfaces, INFORMS, vol. 48(6), pages 529-542, November.
    16. 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.
    17. Falcón, Raúl & Barrena, Eva & Canca, David & Laporte, Gilbert, 2016. "Counting and enumerating feasible rotating schedules by means of Gröbner bases," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 125(C), pages 139-151.
    18. Young-Chae Hong & Amy Cohn & Stephen Gorga & Edmond O’Brien & William Pozehl & Jennifer Zank, 2019. "Using Optimization Techniques and Multidisciplinary Collaboration to Solve a Challenging Real-World Residency Scheduling Problem," Interfaces, INFORMS, vol. 49(3), pages 201-212, May.
    19. Yongjian Li & Jian Chen & Xiaoqiang Cai, 2007. "An integrated staff-sizing approach considering feasibility of scheduling decision," Annals of Operations Research, Springer, vol. 155(1), pages 361-390, November.
    20. Smirnov, Dmitry & Huchzermeier, Arnd, 2020. "Analytics for labor planning in systems with load-dependent service times," European Journal of Operational Research, Elsevier, vol. 287(2), pages 668-681.

    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:217:y:2014:i:1:p:463-478:10.1007/s10479-013-1525-y. 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.