IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v316y2022i1d10.1007_s10479-020-03688-4.html
   My bibliography  Save this article

Staff scheduling in blood collection problems

Author

Listed:
  • Xiang Li

    (Beijing University of Chemical Technology)

  • Haoyue Fan

    (Beijing University of Chemical Technology)

  • Jiaming Liu

    (Beijing University of Chemical Technology)

  • Qifeng Xun

    (University of Chinese Academy of Science)

Abstract

To improve the blood collection volume and reduce the staff costs, this study investigates the staff scheduling problem faced by blood donation center under variant situations derived from reality. Staff scheduling for blood donation center is a complex task due to the stochastic arriving of blood donors. In this study, we propose the deterministic demand model and stochastic demand model of blood donors according to the number of donors arriving at donation sites. Then, based on the deterministic demand and the stochastic demand models, we consider the number of staff in the blood donation center and group blood donation. Five blood collection scenarios are proposed using the combination of donors and staff. To solve the proposed models, linear transformation and lexicographic order optimal method are applied. To verify the effectiveness of the proposed models, both large-scale and small-scale numerical experiments are conducted and its the stability is also validated using the 10 times of random numerical experiments. All of the experimental results show that the proposed models need few staff when facing adequate staff scenarios, and reduce the number of donors when facing inadequate staff scenarios.

Suggested Citation

  • Xiang Li & Haoyue Fan & Jiaming Liu & Qifeng Xun, 2022. "Staff scheduling in blood collection problems," Annals of Operations Research, Springer, vol. 316(1), pages 365-400, September.
    • Handle: RePEc:spr:annopr:v:316:y:2022:i:1:d:10.1007_s10479-020-03688-4
    DOI: 10.1007/s10479-020-03688-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03688-4
    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-020-03688-4?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. Gregory P. Prastacos, 1984. "Blood Inventory Management: An Overview of Theory and Practice," Management Science, INFORMS, vol. 30(7), pages 777-800, July.
    2. Adam Diamant & Joseph Milner & Fayez Quereshy, 2018. "Dynamic Patient Scheduling for Multi†Appointment Health Care Programs," Production and Operations Management, Production and Operations Management Society, vol. 27(1), pages 58-79, January.
    3. Guyon, O. & Lemaire, P. & Pinson, É. & Rivreau, D., 2010. "Cut generation for an integrated employee timetabling and production scheduling problem," European Journal of Operational Research, Elsevier, vol. 201(2), pages 557-567, March.
    4. Peter Brucker & Thomas Kampmeyer, 2008. "Cyclic job shop scheduling problems with blocking," Annals of Operations Research, Springer, vol. 159(1), pages 161-181, March.
    5. 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.
    6. 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.
    7. J. Arturo Castillo-Salazar & Dario Landa-Silva & Rong Qu, 2016. "Workforce scheduling and routing problems: literature survey and computational study," Annals of Operations Research, Springer, vol. 239(1), pages 39-67, April.
    8. Burak Bilgin & Patrick Causmaecker & Benoît Rossie & Greet Vanden Berghe, 2012. "Local search neighbourhoods for dealing with a novel nurse rostering model," Annals of Operations Research, Springer, vol. 194(1), pages 33-57, April.
    9. Gunpinar, Serkan & Centeno, Grisselle, 2016. "An integer programming approach to the bloodmobile routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 86(C), pages 94-115.
    10. Şahinyazan, Feyza Güliz & Kara, Bahar Y. & Taner, Mehmet Rüştü, 2015. "Selective vehicle routing for a mobile blood donation system," European Journal of Operational Research, Elsevier, vol. 245(1), pages 22-34.
    11. 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.
    12. Jinxin Yi, 2003. "Vehicle Routing with Time Windows and Time-Dependent Rewards: A Problem from the American Red Cross," Manufacturing & Service Operations Management, INFORMS, vol. 5(1), pages 74-77.
    13. Andrew J. Mason & David M. Ryan & David M. Panton, 1998. "Integrated Simulation, Heuristic and Optimisation Approaches to Staff Scheduling," Operations Research, INFORMS, vol. 46(2), pages 161-175, April.
    14. Avramidis, Athanassios N. & Chan, Wyean & Gendreau, Michel & L'Ecuyer, Pierre & Pisacane, Ornella, 2010. "Optimizing daily agent scheduling in a multiskill call center," European Journal of Operational Research, Elsevier, vol. 200(3), pages 822-832, February.
    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. Zhao, Shuaiqi & Yang, Hualong & Zheng, Jianfeng & Li, Dechang, 2024. "A two-step approach for deploying heterogeneous vessels and designing reliable schedule in liner shipping services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 182(C).

    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. 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.
    3. 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.
    4. Caballini, Claudia & Paolucci, Massimo, 2020. "A rostering approach to minimize health risks for workers: An application to a container terminal in the Italian port of Genoa," Omega, Elsevier, vol. 95(C).
    5. Defraeye, Mieke & Van Nieuwenhuyse, Inneke, 2016. "Staffing and scheduling under nonstationary demand for service: A literature review," Omega, Elsevier, vol. 58(C), pages 4-25.
    6. Chapados, Nicolas & Joliveau, Marc & L’Ecuyer, Pierre & Rousseau, Louis-Martin, 2014. "Retail store scheduling for profit," European Journal of Operational Research, Elsevier, vol. 239(3), pages 609-624.
    7. Lusby, Richard Martin & Range, Troels Martin & Larsen, Jesper, 2016. "A Benders decomposition-based matheuristic for the Cardinality Constrained Shift Design Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 385-397.
    8. Fang, Kan & Wang, Shijin & Pinedo, Michael L. & Chen, Lin & Chu, Feng, 2021. "A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions," European Journal of Operational Research, Elsevier, vol. 291(1), pages 128-146.
    9. Oyku Ahipasaoglu & Nesim Erkip & Oya Ekin Karasan, 2019. "The venue management problem: setting staffing levels, shifts and shift schedules at concession stands," Journal of Scheduling, Springer, vol. 22(1), pages 69-83, February.
    10. Wu, Zhiying & Xu, Guoning & Chen, Qingxin & Mao, Ning, 2023. "Two stochastic optimization methods for shift design with uncertain demand," Omega, Elsevier, vol. 115(C).
    11. Elín Björk Böðvarsdóttir & Niels-Christian Fink Bagger & Laura Elise Høffner & Thomas J. R. Stidsen, 2022. "A flexible mixed integer programming-based system for real-world nurse rostering," Journal of Scheduling, Springer, vol. 25(1), pages 59-88, February.
    12. Mohammad Reza Hassani & J. Behnamian, 2021. "A scenario-based robust optimization with a pessimistic approach for nurse rostering problem," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 143-169, January.
    13. M. Rezaei Kallaj & M. Hasannia Kolaee & S. M. J. Mirzapour Al-e-hashem, 2023. "Integrating bloodmobiles and drones in a post-disaster blood collection problem considering blood groups," Annals of Operations Research, Springer, vol. 321(1), pages 783-811, February.
    14. 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.
    15. 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.
    16. Lusby, Richard Martin & Range, Troels Martin & Larsen, Jesper, 2015. "A Benders decomposition-based Matheuristic for the Cardinality Constrained Shift Design Problem," Discussion Papers on Economics 9/2015, University of Southern Denmark, Department of Economics.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:316:y:2022:i:1:d:10.1007_s10479-020-03688-4. 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.