IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v17y2017i2d10.1007_s12351-016-0247-8.html
   My bibliography  Save this article

A survey on human resource allocation problem and its applications

Author

Listed:
  • Sana Bouajaja

    (University of Tunis El Manar)

  • Najoua Dridi

    (University of Tunis El Manar)

Abstract

In this paper, we present the existing literature on the human resource allocation problem. We study the main resolution approaches: exact, heuristic and metaheuristics methods proposed to solve the problem. We also examine the different studies from state-of the-art and classify them according to their real life applications in several areas such as production planning applications, maintenance management, hospital systems, project management, etc. Finally, we discuss and analyze the different contributions examined in this field.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:operea:v:17:y:2017:i:2:d:10.1007_s12351-016-0247-8
    DOI: 10.1007/s12351-016-0247-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-016-0247-8
    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/s12351-016-0247-8?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. S Abdullah & S Ahmadi & E K Burke & M Dror & B McCollum, 2007. "A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(11), pages 1494-1502, November.
    2. Benavides, Alexander J. & Ritt, Marcus & Miralles, Cristóbal, 2014. "Flow shop scheduling with heterogeneous workers," European Journal of Operational Research, Elsevier, vol. 237(2), pages 713-720.
    3. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    4. Nakade, Koichi & Ohno, Katsuhisa, 1999. "An optimal worker allocation problem for a U-shaped production line," International Journal of Production Economics, Elsevier, vol. 60(1), pages 353-358, April.
    5. Corominas, Albert & Pastor, Rafael & Rodriguez, Ericka, 2006. "Rotational allocation of tasks to multifunctional workers in a service industry," International Journal of Production Economics, Elsevier, vol. 103(1), pages 3-9, September.
    6. Fan Wang & Ning Shi & Ben Chen, 2010. "A Comprehensive Survey Of The Reviewer Assignment Problem," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 9(04), pages 645-668.
    7. E. C. Sewell & S. H. Jacobson, 2012. "A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 433-442, August.
    8. Rolf Lundin & Christophe Midler, 1998. "Projects as Arenas for Renewal and Learning Processes," Post-Print hal-00262925, HAL.
    9. Dowsland, Kathryn A., 1998. "Nurse scheduling with tabu search and strategic oscillation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 393-407, April.
    10. Miralles, Cristobal & Garcia-Sabater, Jose Pedro & Andres, Carlos & Cardos, Manuel, 2007. "Advantages of assembly lines in Sheltered Work Centres for Disabled. A case study," International Journal of Production Economics, Elsevier, vol. 110(1-2), pages 187-197, October.
    11. Araújo, Felipe F.B. & Costa, Alysson M. & Miralles, Cristóbal, 2012. "Two extensions for the ALWABP: Parallel stations and collaborative approach," International Journal of Production Economics, Elsevier, vol. 140(1), pages 483-495.
    12. Sang M. Lee & Marc J. Schniederjans, 1983. "A Multicriteria Assignment Problem: A Goal Programming Approach," Interfaces, INFORMS, vol. 13(4), pages 75-81, August.
    13. Belfares, Lamia & Klibi, Walid & Lo, Nassirou & Guitouni, Adel, 2007. "Multi-objectives Tabu Search based algorithm for progressive resource allocation," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1779-1799, March.
    14. Alvarez-Valdes, Ramon & Crespo, Enric & Tamarit, Jose M., 2002. "Design and implementation of a course scheduling system using Tabu Search," European Journal of Operational Research, Elsevier, vol. 137(3), pages 512-523, March.
    15. Jourdan, L. & Basseur, M. & Talbi, E.-G., 2009. "Hybridizing exact methods and metaheuristics: A taxonomy," European Journal of Operational Research, Elsevier, vol. 199(3), pages 620-629, December.
    16. .Ilker Baybars, 1986. "A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem," Management Science, INFORMS, vol. 32(8), pages 909-932, August.
    17. Robert L. Burdett & Erhan Kozan, 2004. "The Assignment Of Individual Renewable Resources In Scheduling," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 21(03), pages 355-377.
    18. Wallace J. Hopp & Eylem Tekin & Mark P. Van Oyen, 2004. "Benefits of Skill Chaining in Serial Production Lines with Cross-Trained Workers," Management Science, INFORMS, vol. 50(1), pages 83-98, January.
    19. Carello, Giuliana & Lanzarone, Ettore, 2014. "A cardinality-constrained robust model for the assignment problem in Home Care services," European Journal of Operational Research, Elsevier, vol. 236(2), pages 748-762.
    20. Krokhmal, Pavlo A. & Pardalos, Panos M., 2009. "Random assignment problems," European Journal of Operational Research, Elsevier, vol. 194(1), pages 1-17, April.
    21. 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.
    22. Cattrysse, Dirk G. & Van Wassenhove, Luk N., 1992. "A survey of algorithms for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 60(3), pages 260-272, August.
    23. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    24. Daskalaki, S. & Birbas, T. & Housos, E., 2004. "An integer programming formulation for a case study in university timetabling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 117-135, February.
    25. Zhang, Defu & Liu, Yongkai & M'Hallah, Rym & Leung, Stephen C.H., 2010. "A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 550-558, June.
    26. Ramon Alvarez-Valdes & Enric Crespo & Jose Tamarit, 2000. "Assigning students to course sections using tabu search," Annals of Operations Research, Springer, vol. 96(1), pages 1-16, 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. 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.
    2. Zhonghuan Tian & Simon Fong & Suash Deb & Rui Tang & Raymond Wong, 2018. "Vitality-based elephant search algorithm," Operational Research, Springer, vol. 18(3), pages 841-863, October.
    3. Seyed Hamid Reza Pasandideh & Seyed Taghi Akhavan Niaki & Reza Abdollahi, 2020. "Modeling and solving a bi-objective joint replenishment-location problem under incremental discount: MOHSA and NSGA-II," Operational Research, Springer, vol. 20(4), pages 2365-2396, December.
    4. Sedghi, Mahdieh & Kauppila, Osmo & Bergquist, Bjarne & Vanhatalo, Erik & Kulahci, Murat, 2021. "A taxonomy of railway track maintenance planning and scheduling: A review and research trends," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    5. Richárd Kicsiny & Levente Hufnagel & Zoltán Varga, 2023. "Allocation of limited resources under quadratic constraints," Annals of Operations Research, Springer, vol. 322(2), pages 793-817, March.
    6. Meiyan Lin & Kwai Sang Chin & Lijun Ma & Kwok Leung Tsui, 2020. "A comprehensive multi-objective mixed integer nonlinear programming model for an integrated elderly care service districting problem," Annals of Operations Research, Springer, vol. 291(1), pages 499-529, August.

    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. Christian Billing & Florian Jaehn & Thomas Wensing, 2020. "Fair task allocation problem," Annals of Operations Research, Springer, vol. 284(1), pages 131-146, January.
    2. Zhang, Defu & Liu, Yongkai & M'Hallah, Rym & Leung, Stephen C.H., 2010. "A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 550-558, June.
    3. Costa, Alysson M. & Miralles, Cristóbal, 2009. "Job rotation in assembly lines employing disabled workers," International Journal of Production Economics, Elsevier, vol. 120(2), pages 625-632, August.
    4. Battaïa, Olga & Dolgui, Alexandre, 2013. "A taxonomy of line balancing problems and their solutionapproaches," International Journal of Production Economics, Elsevier, vol. 142(2), pages 259-277.
    5. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    6. Talmor, Irit, 2022. "Solving the problem of maximizing diversity in public sector teams," Socio-Economic Planning Sciences, Elsevier, vol. 81(C).
    7. Andreas Kleine & Andreas Dellnitz, 2017. "Allocation of seminar applicants," Journal of Business Economics, Springer, vol. 87(7), pages 927-941, October.
    8. Battaïa, Olga & Delorme, Xavier & Dolgui, Alexandre & Hagemann, Johannes & Horlemann, Anika & Kovalev, Sergey & Malyutin, Sergey, 2015. "Workforce minimization for a mixed-model assembly line in the automotive industry," International Journal of Production Economics, Elsevier, vol. 170(PB), pages 489-500.
    9. 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.
    10. Pape, Tom, 2015. "Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview, computational tests and improvements," European Journal of Operational Research, Elsevier, vol. 240(1), pages 32-42.
    11. García-Villoria, Alberto & Corominas, Albert & Nadal, Adrià & Pastor, Rafael, 2018. "Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints," European Journal of Operational Research, Elsevier, vol. 271(3), pages 882-895.
    12. Olcay Polat & Can B. Kalayci & Özcan Mutlu & Surendra M. Gupta, 2016. "A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 722-741, February.
    13. Vermuyten, Hendrik & Lemmens, Stef & Marques, Inês & Beliën, Jeroen, 2016. "Developing compact course timetables with optimized student flows," European Journal of Operational Research, Elsevier, vol. 251(2), pages 651-661.
    14. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
    15. Sebnem Demirkol Akyol & Adil Baykasoğlu, 2019. "A multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem," Journal of Intelligent Manufacturing, Springer, vol. 30(2), pages 557-573, February.
    16. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    17. Michels, Adalberto Sato & Lopes, Thiago Cantos & Magatão, Leandro, 2020. "An exact method with decomposition techniques and combinatorial Benders’ cuts for the type-2 multi-manned assembly line balancing problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    18. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 575-588, August.
    19. Matusiak, M. & de Koster, M.B.M. & Saarinen, J., 2015. "Data-driven warehouse optimization," ERIM Report Series Research in Management ERS-2015-008-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    20. Boštjan Gabrovšek & Tina Novak & Janez Povh & Darja Rupnik Poklukar & Janez Žerovnik, 2020. "Multiple Hungarian Method for k -Assignment Problem," Mathematics, MDPI, vol. 8(11), pages 1-18, November.

    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:operea:v:17:y:2017:i:2:d:10.1007_s12351-016-0247-8. 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.