Journals / An International Journal of Optimization and Control: Theories & Applications (IJOCTA) / 2020 / Cilt: 10 - Sayı: 2

A mathematical model for personnel task assignment problem and an application for banking sector

Pages
147–158
Publication Date
2022-10-11
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Resultsshow that proposed model gave better results compared with current situation.With the proposed solution method, the workloads of the profile groups workingabove their capacity were transferred to other profile groups with idle capacity.Thus, the capacity utilization rates of the profile groups were more balanced andthe minimum capacity utilization rate was calculated as 41%.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Efficient planning and management of the workforce resources is one of the mostessential requirements for the companies operating in the service sector.
📊
Key Findings & Data:For banks,a large number of transactions comes to Central Operations Department from thebranches or directly from the customers and their aim is to provide the bestoperational service with the highest efficiency with the limited workforceresources in the departments.
💡
Conclusion & Impact:Resultsshow that proposed model gave better results compared with current situation.With the proposed solution method, the workloads of the profile groups workingabove their capacity were transferred to other profile groups with idle capacity.Thus, the capacity utilization rates of the profile groups were more balanced andthe minimum capacity utilization rate was calculated as 41%.
🔬Design:Survey & Empirical Study
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Efficient planning and management of the workforce resources is one of the mostessential requirements for the companies operating in the service sector. For banks,a large number of transactions comes to Central Operations Department from thebranches or directly from the customers and their aim is to provide the bestoperational service with the highest efficiency with the limited workforceresources in the departments. In this study, a real assignment problem wasdiscussed and the problem was considered as Generalized Assignment Problem.For the solution of the problem, related algorithms were listed and examined in theliterature survey section. Then, a two-step method is proposed. First stepprioritizes 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 employeegroups. A preference based optimization method called Linear PhysicalProgramming (LPP) is used to solve the model. Afterward, proposed model wastested on real banking data. For all the tests, GAMS was used as a solver. Resultsshow that proposed model gave better results compared with current situation.With the proposed solution method, the workloads of the profile groups workingabove their capacity were transferred to other profile groups with idle capacity.Thus, the capacity utilization rates of the profile groups were more balanced andthe minimum capacity utilization rate was calculated as 41%.

🔖

Cite This Article

CETİN, K., TUZKAYA, G., VAYVAY, O. (2022). A mathematical model for personnel task assignment problem and an application for banking sector. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), Cilt: 10 - Sayı: 2, 147–158. https://ajindex.com/articles/440565

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (16)

  1. 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
  2. Kuhn, H. W, (1955). The Hungarian method for the assignment problem, Naval Research Logistics, 2, 83-97
  3. Balachandran, K. R, (1972). Purchasing priorities in queues, Management Science, 18, 319-326
  4. 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
  5. Ross, G. T., & Soland, R. M. (1977). Modeling facility location problems as generalized assignment problems, Management Science, 24, 345-357
  6. Pentico, D. (2007). Assignment problems: a golden anniversary survey. European Journal of Operational Research, Open Journal of Discrete Mathematics, 176, 774-793
  7. Osman, I.H. (1995). Heuristics for the generalized assignment problem: simulated annealing and tabu search approaches, OR Spektrum, 17, 211-225
  8. Chu, P.C., & Beasley, J.E. (1997). A genetic algorithm for the generalized assignment problem, Computers Operations Research, 24, 17-23
  9. Racer, M., & Amini, M.M. (1994). A robust heuristic for the generalized assignment problem, Annals of Operations Research, 50, 487-503
  10. 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
  11. Diaz, J. A., & Fernandez, E. (2001). A tabu search heuristics for the generalized assignment problem, European Journal of Operational Research, 132, 22-38
  12. Yagiura, M., Ibaraki, T., & Glover, F. (2004). An ejection chain approach for the generalized assignment problem, INFORMS Journal on Computing, pp. 133-151
  13. 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
  14. Lourenço, H.R., & Serra D. (2000). Adaptive search heuristics for the generalized assignment problem, Mathware & Soft Computing, 7, 1–15
  15. Alfandari, L., Plateau, A., & Tolla, P. (2001). A twophase path relinking algorithm for the generalized assignment problem, 4th International Conference of Metaheuristics, Porto, Portugal, 175-179
  16. Yagiura, M., Ibaraki, T., & Glover, F. (2006). A pat