IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-01745280.html
   My bibliography  Save this paper

A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time

Author

Listed:
  • Christine Di Martinelly

    (CREGI - Centre de Recherches et d'Etudes en Gestion Industrielle - FUCAM - Facultés Universitaires Catholiques de Mons, LEM - Lille économie management - UMR 9221 - UA - Université d'Artois - UCL - Université catholique de Lille - Université de Lille - CNRS - Centre National de la Recherche Scientifique)

  • Nadine Meskens

    (Département Gestion de Production et des Opérations - FUCAM - Facultés Universitaires Catholiques de Mons)

Abstract

This paper addresses the detailed assignment of nurses to surgical operations taking into account the skills requirements. We consider the building of weekly nurse schedule roster by assigning the nurses to surgical operations while generating teams which have strong affinities and minimising nurse idle times. Nurses are assigned to shifts based on their availability, legal constraints on their working hours and the elective surgery schedule. Building on the ε-constraint method, we propose a new bi-objective approach that can solve the problem faster and more accurately, as well as provide insight into the trade-offs between the two objectives. The approach is also used to gain more insight into the problem and evaluate the impact of nurse settings. In this paper, we considered the impact of using circulating and scrub nurses or using polyvalent (multi-skilled) nurses. In all instances and settings, the affinities between the surgical team members were more sensitive to variations in idle time. Furthermore, the use of polyvalent (multi-skilled) nurses yielded rosters with reduced idle time and better surgical team member affinities.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Christine Di Martinelly & Nadine Meskens, 2017. "A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses' idle time," Post-Print hal-01745280, HAL.
    • Handle: RePEc:hal:journl:hal-01745280
    DOI: 10.1016/j.ijpe.2017.05.014
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Bérubé, Jean-François & Gendreau, Michel & Potvin, Jean-Yves, 2009. "An exact [epsilon]-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits," European Journal of Operational Research, Elsevier, vol. 194(1), pages 39-50, April.
    2. Cheang, B. & Li, H. & Lim, A. & Rodrigues, B., 2003. "Nurse rostering problems--a bibliographic survey," European Journal of Operational Research, Elsevier, vol. 151(3), pages 447-460, December.
    3. 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.
    4. Krishnamoorthy, M. & Ernst, A.T. & Baatar, D., 2012. "Algorithms for large scale Shift Minimisation Personnel Task Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 219(1), pages 34-48.
    5. Ben D. MacArthur & Richard O. C. Oreffo, 2005. "Bridging the gap," Nature, Nature, vol. 433(7021), pages 19-19, January.
    6. Venkataraman, R. & Brusco, M. J., 1996. "An integrated analysis of nurse staffing and scheduling policies," Omega, Elsevier, vol. 24(1), pages 57-71, February.
    7. Mavrotas, George & Florios, Kostas, 2013. "An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in Multi-Objective Integer Programming problems," MPRA Paper 105034, University Library of Munich, Germany.
    8. Zhang, Weihua & Reimann, Marc, 2014. "A simple augmented ∊-constraint method for multi-objective mathematical integer programming problems," European Journal of Operational Research, Elsevier, vol. 234(1), pages 15-24.
    9. Thibaud Monteiro & Nadine Meskens & Tao Wang, 2015. "Surgical scheduling with antagonistic human resource objectives," International Journal of Production Research, Taylor & Francis Journals, vol. 53(24), pages 7434-7449, December.
    10. Gerald W. Evans, 1984. "An Overview of Techniques for Solving Multiobjective Mathematical Programs," Management Science, INFORMS, vol. 30(11), pages 1268-1282, November.
    11. Kortbeek, N. & Braaksma, A. & Burger, C.A.J. & Bakker, P.J.M. & Boucherie, R.J., 2015. "Flexible nurse staffing based on hourly bed census predictions," International Journal of Production Economics, Elsevier, vol. 161(C), pages 167-180.
    12. 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.
    13. Kolen, Antoon W. J. & Kroon, Leo G., 1991. "On the computational complexity of (maximum) class scheduling," European Journal of Operational Research, Elsevier, vol. 54(1), pages 23-38, September.
    14. Meinolf Sellmann & Kyriakos Zervoudakis & Panagiotis Stamatopoulos & Torsten Fahle, 2002. "Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search," Annals of Operations Research, Springer, vol. 115(1), pages 207-225, September.
    15. Kovalyov, Mikhail Y. & Ng, C.T. & Cheng, T.C. Edwin, 2007. "Fixed interval scheduling: Models, applications, computational complexity and algorithms," European Journal of Operational Research, Elsevier, vol. 178(2), pages 331-342, April.
    16. Mirela Stojković & François Soumis & Jacques Desrosiers, 1998. "The Operational Airline Crew Scheduling Problem," Transportation Science, INFORMS, vol. 32(3), pages 232-245, August.
    17. Antoon W.J. Kolen & Jan Karel Lenstra & Christos H. Papadimitriou & Frits C.R. Spieksma, 2007. "Interval scheduling: A survey," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 530-543, August.
    18. Zeghal, F.M. & Minoux, M., 2006. "Modeling and solving a Crew Assignment Problem in air transportation," European Journal of Operational Research, Elsevier, vol. 175(1), pages 187-209, November.
    19. Silva, Thiago A.O. & de Souza, Mauricio C. & Saldanha, Rodney R. & Burke, Edmund K., 2015. "Surgical scheduling with simultaneous employment of specialised human resources," European Journal of Operational Research, Elsevier, vol. 245(3), pages 719-730.
    20. Thomas Stidsen & Kim Allan Andersen & Bernd Dammann, 2014. "A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs," Management Science, INFORMS, vol. 60(4), pages 1009-1032, April.
    21. Alves, Maria Joao & Climaco, Joao, 2007. "A review of interactive methods for multiobjective integer and mixed-integer programming," European Journal of Operational Research, Elsevier, vol. 180(1), pages 99-115, July.
    22. Mavrotas, G. & Diakoulaki, D., 1998. "A branch and bound algorithm for mixed zero-one multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 107(3), pages 530-541, June.
    23. Kirlik, Gokhan & Sayın, Serpil, 2014. "A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems," European Journal of Operational Research, Elsevier, vol. 232(3), pages 479-488.
    24. Matthias Ehrgott, 2005. "Multicriteria Optimization," Springer Books, Springer, edition 0, number 978-3-540-27659-3, January.
    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. Akbarzadeh, Babak & Maenhout, Broos, 2024. "A study on policy decisions to embed flexibility for reactive recovery in the planning and scheduling process in operating rooms," Omega, Elsevier, vol. 126(C).
    2. Sean Harris & David Claudio, 2022. "Current Trends in Operating Room Scheduling 2015 to 2020: a Literature Review," SN Operations Research Forum, Springer, vol. 3(1), pages 1-42, March.
    3. Şeyda Gür & Mehmet Pınarbaşı & Hacı Mehmet Alakaş & Tamer Eren, 2023. "Operating room scheduling with surgical team: a new approach with constraint programming and goal programming," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(4), pages 1061-1085, December.
    4. Akbarzadeh, Babak & Moslehi, Ghasem & Reisi-Nafchi, Mohammad & Maenhout, Broos, 2019. "The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling," European Journal of Operational Research, Elsevier, vol. 278(2), pages 596-614.
    5. Turhan, Aykut Melih & Bilgen, Bilge, 2022. "A mat-heuristic based solution approach for an extended nurse rostering problem with skills and units," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    6. Babak Akbarzadeh & Ghasem Moslehi & Mohammad Reisi-Nafchi & Broos Maenhout, 2020. "A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering," Journal of Scheduling, Springer, vol. 23(2), pages 265-288, 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. Holzmann, Tim & Smith, J.C., 2018. "Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations," European Journal of Operational Research, Elsevier, vol. 271(2), pages 436-449.
    2. Bashir Bashir & Özlem Karsu, 2022. "Solution approaches for equitable multiobjective integer programming problems," Annals of Operations Research, Springer, vol. 311(2), pages 967-995, April.
    3. Volland, Jonas & Fügener, Andreas & Brunner, Jens O., 2017. "A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals," European Journal of Operational Research, Elsevier, vol. 260(1), pages 316-334.
    4. Mansini, Renata & Zanella, Marina & Zanotti, Roberto, 2023. "Optimizing a complex multi-objective personnel scheduling problem jointly complying with requests from customers and staff," Omega, Elsevier, vol. 114(C).
    5. Mesquita-Cunha, Mariana & Figueira, José Rui & Barbosa-Póvoa, Ana Paula, 2023. "New ϵ−constraint methods for multi-objective integer linear programming: A Pareto front representation approach," European Journal of Operational Research, Elsevier, vol. 306(1), pages 286-307.
    6. Damcı-Kurt, Pelin & Zhang, Minjiao & Marentay, Brian & Govind, Nirmal, 2019. "Improving physician schedules by leveraging equalization: Cases from hospitals in U.S," Omega, Elsevier, vol. 85(C), pages 182-193.
    7. Forget, Nicolas & Gadegaard, Sune Lauth & Nielsen, Lars Relund, 2022. "Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs," European Journal of Operational Research, Elsevier, vol. 302(3), pages 909-924.
    8. Dinçer Konur & Hadi Farhangi & Cihan H. Dagli, 2016. "A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 967-1006, October.
    9. Satya Tamby & Daniel Vanderpooten, 2021. "Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 72-85, January.
    10. 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.
    11. Lotfi Hidri & Achraf Gazdar & Mohammed M. Mabkhot, 2020. "Optimized Procedure to Schedule Physicians in an Intensive Care Unit: A Case Study," Mathematics, MDPI, vol. 8(11), pages 1-24, November.
    12. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    13. David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
    14. Ozgu Turgut & Evrim Dalkiran & Alper E. Murat, 2019. "An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems," Journal of Global Optimization, Springer, vol. 75(1), pages 35-62, September.
    15. Nathan Adelgren & Akshay Gupte, 2022. "Branch-and-Bound for Biobjective Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 909-933, March.
    16. I. Kaliszewski & J. Miroforidis, 2022. "Probing the Pareto front of a large-scale multiobjective problem with a MIP solver," Operational Research, Springer, vol. 22(5), pages 5617-5673, November.
    17. Melissa R. Bowers & Charles E. Noon & Wei Wu & J. Kirk Bass, 2016. "Neonatal Physician Scheduling at the University of Tennessee Medical Center," Interfaces, INFORMS, vol. 46(2), pages 168-182, April.
    18. 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.
    19. Barbati, Maria & Corrente, Salvatore & Greco, Salvatore, 2020. "A general space-time model for combinatorial optimization problems (and not only)," Omega, Elsevier, vol. 96(C).
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    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:hal:journl:hal-01745280. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.