A mathematical model for personnel task assignment problem and an application for banking sector
Keywords:Generalized Assignment Problem, Task Assignment, Analytic Hierarchy Process, Personnel Scheduling Banking Sector Linear Physical Programming
Efficient planning and management of the workforce resources is one of the most essential requirements for the companies operating in the service sector. For banks, a large number of transactions coming to Central Operations Department from the branches or directly from the customers and their aim is to provide the best operational service with the highest efficiency with the limited workforce resources in the departments. In this study, a real assignment problem was discussed and the problem was considered as Generalized Assignment Problem. For the solution of the problem, related algorithms were listed and examined in the literature survey section. Then, a two-step method is proposed. First step prioritizes the task coming to the system by considering the customer types, service level agreement (SLA) times, cut-off times, task type. In the second step, a multi-objective mathematical model was developed to assign task to employee groups. A preference based optimization method called Linear Physical Programming (LPP) is used to solve the model. Afterward, proposed model was tested on real banking data. For all the tests, GAMS was used as a solver. Results show that proposed model gave better results compared with current situation. With the proposed solution method, the workloads of the profile groups working above their capacity were transferred to other profile groups with idle capacity. Thus, the capacity utilization rates of the profile groups were more balanced and the minimum capacity utilization rate was calculated as 41%.
Feltl, H., & Raidl, G. R. (2004). An improved hybrid genetic algorithm for the generalized assignment problem, Nicosia, Cyprus: Proceedings of the 2004 ACM Symposium on Applied Computing.
Kuhn, H. W, (1955). The Hungarian method for the assignment problem, Naval Research Logistics, 2, 83-97.
Balachandran, K. R, (1972). Purchasing priorities in queues, Management Science, 18, 319-326.
Mazzola, J. B., Neebe, A. W., & Dunn, C. V. R. (1989). Production planning of a flexible manufacturing system in a material requirements planning environment, International Journal of Flexible Manufacturing Systems, 1, 115-142.
Ross, G. T., & Soland, R. M. (1977). Modeling facility location problems as generalized assignment problems, Management Science, 24, 345-357.
Pentico, D. (2007). Assignment problems: a golden anniversary survey. European Journal of Operational Research, Open Journal of Discrete Mathematics, 176, 774-793.
Osman, I.H. (1995). Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches, OR Spektrum, 17, 211-225.
Chu, P.C., & Beasley, J.E. (1997). A genetic algorithm for the generalized assignment problem, Computers Operations Research, 24, 17-23.
Racer, M., & Amini, M.M. (1994). A robust heuristic for the generalized assignment problem, Annals of Operations Research, 50, 487-503.
Laguna, M., Kelly, J.P., Gonzalez-Velarde, J.L., & Glover, F. (1995). Tabu search for the multilevel generalized assignment problem, European Journal of Operational Research, 82, 176-189.
Diaz, J. A., & Fernandez, E. (2001). A tabu search heuristics for the generalized assignment problem, European Journal of Operational Research, 132, 22-38.
Yagiura, M., Ibaraki, T., & Glover, F. (2004). An ejection chain approach for the generalized assignment problem, INFORMS Journal on Computing, pp. 133-151.
Randall, M. (2004). Heuristics for ant colony optimisation using the generalised assignment problem, in: Proceedings of IEEE Congress on Evolutionary Computation, Portland, Oregon, USA, pp. 1916–1923.
Lourenço, H.R., & Serra D. (2000). Adaptive search heuristics for the generalized assignment problem, Mathware & Soft Computing, 7, 1–15.
Alfandari, L., Plateau, A., & Tolla, P. (2001). A two-phase path relinking algorithm for the generalized assignment problem, 4th International Conference of Metaheuristics, Porto, Portugal, 175-179.
Yagiura, M., Ibaraki, T., & Glover, F. (2006). A path relinking approach with ejection chains for the generalized assignment problem, European Journal of Operational Research, 169, 548-569.
Haddadi, S., & Ouzia, H. (2001). An effective lagrangian heuristic for the generalized assignment problem, INFOR: Information Systems and Operational Research, 39: 351-356.
Qu, G., Brown, D., & Li, N. (2019). Distributed greedy algorithm for multi-agent task assignment problem with submodular utility functions, Automatica, 105, 206-215.
Jacyna, M., Izdebski, M., Szczepański, E., & Golda, P. (2018). The task assignment of vehicles for a production company, Symmetry, 10, 551.
Demir, H. I., & Canpolat, O. (2018) Integrated process planning, WSPT scheduling and WSLK due-date assignment using genetic algorithms and evolutionary strategies, An International Journal of Optimization and Control: Theories & Applications, Vol 8, No 1, pp. 73-83.
Cattrysse, D.G., & Van Wassenhove, L.N. (1992). A survey of algorithms for the generalized assignment problem, European Journal of Operational Research, 60, 260–272.
Mozzola, J. B. (1989). Generalized assignment with nonlinear capacity interaction, Management Science, 35.
LeBlanc, L. J., Shtub, A., & Anandalingam, G. (1999). Formulating and solving production planning problems, European Journal of Operational Research, 112, 54–80.
Mazzola, J.B., & Neebe, A.W. (1988). Bottleneck generalized assignment problem, Engineering Cost and Production Economics, 14, 61-65.
Martello, S., & Toth, P. (1995). The bottleneck generalized assignment problem, European Journal of Operational Research, 83 (3), 621–638.
Thomas, R. R., & Terry, P. H. (2010). A stochastic programming model for scheduling call centers with global service level agreements, European Journal of Operational Research, 207, 1608-1619.
Rodney, B. W., & Ward, W. (2005). A staffing algorithm for call centers with skill-based routing, Manufacturing & Service Operations Management, 7, 276-294.
Christian, H., & Rainer, K. (2010). Scheduling and staffing multiple projects with a multi-skilled workforce, OR Spectrum, 32:343–368.
Krishnamoorthy, M., Ernts, A. T., & Baatar, D. (2012). Algorithms for large scale shift minimisation personnel task scheduling problems, European Journal of Operational Research, 219, 34-48.
Cordeau, J. F., Laporte, G., Pasin, F., & Ropke, S. (2010). Scheduling technicians and tasks in a telecommunications company, J Sched, 13: 393–409.
Hojati, M., & Patil, A.S. (2011). An integer linear programming-based heuristic for scheduling heterogeneous, part-time service employees, European Journal of Operational Research, 209, 37–50.
Lin, H. T., Chen, Y. T., Chou, T. Y., & Liao, Y. C. (2012). Crew rostering with multiple goals: an empirical study, Computers & Industrial Engineering, 63, 483–493.
Borenstein, Y., Shah, N., Tsang, E., Dorne, R., Alsheddy, A., & Voudouris, C. (2010). On the partitioning of dynamic workforce scheduling problems, J Sched, 13, 411–425.
Messac, A., Gupta, S.M., & Akbulut, B. (1996). Linear physical programming: a new approach to multiple objective, Optimization Transaction on Operation Research, 8:39-59.
Messac, A., Melachrinoudis, E., & Sukam, C. P. (2001). Mathematical and pragmatic perspectives of physical programming, AIAA Journal, 39(5):885-893.
Onut S., Tuzkaya U.R., Tuzkaya G., & Gulsun B. (2011). A multi-objective energy resource allocation model for turkish manufacturing industry using linear physical programming, International Journal of Innovative Computing Information and Control, vol.7, pp.3147-3169.
Gulsun B., Tuzkaya G., Tuzkaya U.R., & Onut S. (2009). An aggregate production planning strategy selection methodology based on linear physical programming, International Journal of Industrial Engineering-Theory Applications and Practice, vol.16, pp.135-146.
Maria, A., Mattson, C., Yahaya, A., & Messac, A. (2003). Linear physical programming for production planning optimization, Journal Engineering Optimization, 35, pp. 19-37.
Kucukbay, F., & Araz, C. (2016). Portfolio selection problem: a comparison of fuzzy goal programming and linear physical programming, An International Journal of Optimization and Control: Theories & Applications, Vol 6, No 2, pp. 115-120.
Saaty, T.L. (1977). A scaling method for priorities in hierarchical structures, Journal of Mathematical Psychology, 15, 57-68.
How to Cite
Articles published in IJOCTA are made freely available online immediately upon publication, without subscription barriers to access. All articles published in this journal are licensed under the Creative Commons Attribution 4.0 International License (click here to read the full-text legal code). This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.
Under the Creative Commons Attribution 4.0 International License, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles in IJOCTA, so long as the original authors and source are credited.
The readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material
- for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
under the following terms:
- Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
This work is licensed under a Creative Commons Attribution 4.0 International License.