IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v32y2024i4d10.1007_s10100-023-00868-y.html
   My bibliography  Save this article

Multicommodity network flow model of a human resource allocation problem considering time periods

Author

Listed:
  • Zsolt Ercsey

    (University of Pécs)

  • Zoltán Kovács

    (OPTIN Ltd.)

Abstract

This article addresses the problem of finding work assignments for employees within a given time horizon in a company using a multicommodity network flow model. The problem of human resource allocation is defined by the actual manpower demands of different periods which may vary during different periods. The investigation focuses on when workers should be called in-house and for how long to satisfy demands, while also complying with labour standards and regulations. Additional targets may also be set up, such as minimising the overall number of labour, as well as meeting “comfort” expectations, i.e. the most even working time should be realised for every worker within the event horizon. The paper describes how the multicommodity network flow model is constructed and the corresponding MILP mathematical programming model is formulated in a simple situation where there is only one position for the labour. Finally, the article explains how to construct the multicommodity network flow model and the MILP model for the general case, where there are multiple positions for the labour requiring various skills and competences per position within the periods.

Suggested Citation

  • Zsolt Ercsey & Zoltán Kovács, 2024. "Multicommodity network flow model of a human resource allocation problem considering time periods," 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. 32(4), pages 1041-1059, December.
    • Handle: RePEc:spr:cejnor:v:32:y:2024:i:4:d:10.1007_s10100-023-00868-y
    DOI: 10.1007/s10100-023-00868-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-023-00868-y
    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/s10100-023-00868-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. Markó Horváth & Tamás Kis, 2019. "Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price," 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. 27(1), pages 39-67, March.
    2. Bożena Staruch & Bogdan Staruch, 2021. "Competence-based assignment of tasks to workers in factories with demand-driven manufacturing," 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. 29(2), pages 553-565, June.
    3. Margarida Moz & Margarida Pato, 2003. "An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules," Annals of Operations Research, Springer, vol. 119(1), pages 285-301, March.
    4. Chunxiao Zhao & Junhua Chen & Xingchen Zhang & Zanyang Cui, 2022. "Solution of Multi-Crew Depots Railway Crew Scheduling Problems: The Chinese High-Speed Railway Case," Sustainability, MDPI, vol. 14(1), pages 1-18, January.
    5. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    6. Paola Cappanera & Giorgio Gallo, 2004. "A Multicommodity Flow Approach to the Crew Rostering Problem," Operations Research, INFORMS, vol. 52(4), pages 583-596, August.
    7. Attila Bernáth & Tamás Király & Erika Kovács & Gergely Mádi-Nagy & Gyula Pap & Júlia Pap & Jácint Szabó & László Végh, 2013. "Algorithms for multiplayer multicommodity flow problems," 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. 21(4), pages 699-712, December.
    8. Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.
    9. Bentao Su & Naiming Xie, 2020. "Single workgroup scheduling problem with variable processing personnel," 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. 28(2), pages 671-684, June.
    Full references (including those not matched with items on IDEAS)

    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. Khodakaram Salimifard & Sara Bigharaz, 2022. "The multicommodity network flow problem: state of the art classification, applications, and solution methods," Operational Research, Springer, vol. 22(1), pages 1-47, March.
    2. Mesquita, Marta & Moz, Margarida & Paias, Ana & Pato, Margarida, 2015. "A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern," European Journal of Operational Research, Elsevier, vol. 245(2), pages 423-437.
    3. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    4. Weiqiang Shen & Chuanlin Zhang & Xiaona Zhang & Jinglun Shi, 2019. "A fully distributed deployment algorithm for underwater strong k-barrier coverage using mobile sensors," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
    5. Bo Cowgill & Jonathan M. V. Davis & B. Pablo Montagnes & Patryk Perkowski, 2024. "Stable Matching on the Job? Theory and Evidence on Internal Talent Markets," CESifo Working Paper Series 11120, CESifo.
    6. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    7. Weihua Yang & Xu Zhang & Xia Wang, 2024. "The Wasserstein Metric between a Discrete Probability Measure and a Continuous One," Mathematics, MDPI, vol. 12(15), pages 1-13, July.
    8. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    9. Alireza Pooya & Morteza Pakdaman, 2021. "A new continuous time optimal control model for manpower planning with promotion from inside the system," Operational Research, Springer, vol. 21(1), pages 349-364, March.
    10. Scott E. Sampson, 2008. "OR PRACTICE---Optimization of Vacation Timeshare Scheduling," Operations Research, INFORMS, vol. 56(5), pages 1079-1088, October.
    11. Nisse, Nicolas & Salch, Alexandre & Weber, Valentin, 2023. "Recovery of disrupted airline operations using k-maximum matching in graphs," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1061-1072.
    12. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    13. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    14. Omar Zatarain & Jesse Yoe Rumbo-Morales & Silvia Ramos-Cabral & Gerardo Ortíz-Torres & Felipe d. J. Sorcia-Vázquez & Iván Guillén-Escamilla & Juan Carlos Mixteco-Sánchez, 2023. "A Method for Perception and Assessment of Semantic Textual Similarities in English," Mathematics, MDPI, vol. 11(12), pages 1-20, June.
    15. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    16. Jesica Armas & Luis Cadarso & Angel A. Juan & Javier Faulin, 2017. "A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals," Annals of Operations Research, Springer, vol. 258(2), pages 825-848, November.
    17. Ana Paias & Marta Mesquita & Margarida Moz & Margarida Pato, 2021. "A network flow-based algorithm for bus driver rerostering," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 543-576, June.
    18. Winker, Peter, 2023. "Visualizing Topic Uncertainty in Topic Modelling," VfS Annual Conference 2023 (Regensburg): Growth and the "sociale Frage" 277584, Verein für Socialpolitik / German Economic Association.
    19. Robert M. Curry & Joseph Foraker & Gary Lazzaro & David M. Ruth, 2024. "Practice Summary: Optimal Student Group Reassignment at U.S. Naval Academy," Interfaces, INFORMS, vol. 54(3), pages 205-210, May.
    20. Borgonjon, Tessa & Maenhout, Broos, 2022. "An exact approach for the personnel task rescheduling problem with task retiming," European Journal of Operational Research, Elsevier, vol. 296(2), pages 465-484.

    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:cejnor:v:32:y:2024:i:4:d:10.1007_s10100-023-00868-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.