Abstract
Many important problems in engineering management can be formulated as Resource Assignment Problem (RAP). The Workers Assignment Problem (WAP) is considered as a sub-class of RAP which aims to find an optimal assignment of workers to a number of tasks in order to optimize certain objectives. WAP is an NP-hard combinatorial optimization problem. Due to its importance, several algorithms have been developed to solve it. In this paper, it is considered that a manager is required to provide a training course to his workers in order to improve their level of skill or experience to have a sustainable competitive advantage in the industry. The training cost of each worker to perform a particular job is different. The WAP is to find the best assignment of workers to training courses such that the total training cost is minimized. Two metaheuristic optimizations named Whale Optimization Algorithm (WOA) and Flower Pollination Algorithm (FPA) are utilized to final the optimal solution that reduces the total cost. MATLAB Software is used to perform the simulation of the two proposed methods into WAP. The computational results for a set of randomly generated problems of various sizes show that the FPA is able to find good quality solutions.
Publisher
Universitat Politecnica de Valencia
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Strategy and Management,Business and International Management
Reference28 articles.
1. Abdel-Basset, M., & Shawky, L. A. (2019). Flower pollination algorithm: a comprehensive review. Artificial Intelligence Review, 52(4), 2533-2557. https://doi.org/10.1007/s10462-018-9624-4
2. Ammar, A., Pierreval, H., & Elkosentini, S. (2013). Workers assignment problems in manufacturing systems: A literature analysis. In Proceedings of 2013 international conference on industrial engineering and systems management (IESM) (pp. 1-7). IEEE.
3. Bouajaja, S., & Dridi, N. (2017). A survey on human resource allocation problem and its applications. Operational Research, 17(2), 339-369. https://doi.org/10.1007/s12351-016-0247-8
4. Caron, G., Hansen, P., & Jaumard, B. (1999). The assignment problem with seniority and job priority constraints. Operations Research, 47(3), 449-453. https://doi.org/10.1287/opre.47.3.449
5. Cattrysse, D. G., Salomon, M., & Van Wassenhove, L. N. (1994). A set partitioning heuristic for the generalized assignment problem. European Journal of Operational Research, 72(1), 167-174. https://doi.org/10.1016/0377-2217(94)90338-7
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献