End of day process optimization through multi-mode resource constrained project scheduling - A banking case study

Abstract

An End-of-Day process is a batch job that includes a sequence of programs, wherein tasks are completed automatically at times specified by a scheduler. The efficient allocation of resources for the timely execution of tasks allows a company to reduce the overall time needed for the completion of the work and improve customer satisfaction by delivering orders on time. This paper presents a case study of a Turkish bank with the objective of minimizing the duration of the end-of-day process through the optimization of work scheduling and resource allocation. This problem is modeled as a multi-mode resource-constrained project scheduling problem, optimally resolved by mixed-integer programming, and approximated via simulated annealing heuristic. The scheduler in this paper can also be used to assess the importance of scheduling and crashing tasks, along with the sufficiency of the infrastructure to optimize the End-of-Day process.

Keywords

Multi-mode resource constrained project scheduling / Thread allocation / Simulated annealing / End of Day process optimization / Banking case study

Funding

This research has been funded by Fibabanka, with grant number E.D.VR-21-02416.

Declaration of competing interest

The authors declare that they have no conflict of interest regarding the publication of this article.

References

[1] Cetin K, Tuzkaya G, Vayvay O. A mathematical model for personnel task assignment problem and an application for banking sector. Int J Optim Control Theor Appl (IJOCTA) 2020;10:147-158. https://doi.org/10.11121/ijocta.01.2020.00825

[2] Malcolm D, Roseboom J, Clark C, Fazar W. Application of a technique for research and development program evaluation. Oper Res 1959;7:646-669. https://doi.org/10.1287/opre.7.5.646

[3] Koné O., Artigues C, Lopez P, Mongeau M. Comparison of mixed integer linear programming models for the resource-constrained project scheduling problem with consumption and production of resources. Flex Serv Manuf J 2013;25:25-47. https://doi.org/10.1007/s10696-012-9152-5

[4] Christofides N, Alvarez-Valdés R, Tamarit J. Project scheduling with resource constraints: A branch and bound approach. Eur J Oper Res 1987;29:262-273. https://doi.org/10.1016/0377-2217(87)90240-2

[5] Artigues C, Michelon P, Reusser S. Insertion techniques for static and dynamic resource-constrained project scheduling. Eur J Oper Res 2003;149:249-267. https://doi.org/10.1016/S0377-2217(02)00758-0

[6] Alvarez-Valdáres R, Tamarit J. Heuristic algorithms for resource-constrained project scheduling. In: Advances In Project Scheduling. Elsevier; 1989: l34-143.

[7] Boctor F. Some efficient multi-heuristic procedures for resource-constrained project scheduling. Eur J Oper Res 1990;49:3-13. https://doi.org/10.1016/0377-2217(90)90116-S

[8] Özdamar L, Ulusoy G. A local constraint based analysis approach to project scheduling under general resource constraints. Eur J Oper Res 1994; 79(2):287-298. https://doi.org/10.1016/0377-2217(94)90359-X

[9] Ulusoy G, Özdamar L. Heuristic performance and network/resource characteristics in resource-constrained project scheduling. J Oper Res Soc 1989;40:1145-1152. https://doi.org/10.1057/jors.1989.196

[10] Lawrence S. Resource constrained project scheduling-A computational comparison of heuristic scheduling techniques. In: Technical Rep. Graduate School of Industrial Administration And Carnegie-Mellon Univ; 1985.

[11] Kolisch R. Efficient priority rules for the resource-constrained project scheduling problem. J Oper Manag 1996;14:179-192. https://doi.org/10.1016/0272-6963(95)00032-1

[12] Özdamar L, Ulusoy G. An iterative local constraints based analysis for solving the resource constrained project scheduling problem. J Oper Manag 1996;14:193-208. https://doi.org/10.1016/0272-6963(95)00015-1

[13] Ulusoy G, Ozdamar L. A constraint-based perspective in resource constrained project scheduling. Int J Prod Res 1994;32:693-705. https://doi.org/10.1080/00207549408956961

[14] Kolisch R, Hartmann S. Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. Springer; 1999. https://doi.org/10.1007/978-1-4615-5533-97

[15] Kolisch R, Hartmann S. Experimental investigation of heuristics for resource-constrained project scheduling: An update. Eur J Oper Res 2006;174:23-37. https://doi.org/10.1016/j.ejor.2005.01.065

[16] Hartmann S, Briskorn D. An updated survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 2022;297:1-14. https://doi.org/10.1016/j.ejor.2021.05.004

[17] Li K, Willis R. An iterative scheduling technique for resource-constrained project scheduling. Eur J Oper Res 1992;56:370-379. https://doi.org/10.1016/0377-2217(92)90320-9

[18] Valls V, Ballestin F, Quintanilla S. A hybrid genetic algorithm for the resource-constrained project scheduling problem. Eur J Oper Res 2008;185:495-508. https://doi.org/10.1016/j.ejor.2006.12.033

[19] Lee J, Kim Y. Search heuristics for resource constrained project scheduling. J Oper Res Soc 1996;47:678-689. https://doi.org/10.1057/jors.1996.79

[20] Talbot F. Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Manag Sci 1982;28:1197-1210. https://doi.org/10.1287/mnsc.28.10.1197

[21] Patterson J, Slowinski R, Talbot F, Weglarz J. An algorithm for a general class of precedence and resource constrained scheduling problems. Advances In Project Scheduling 1989;3-28. https://doi.org/10.1016/B978-0-444-87358-3.50005-5

[22] Sprecher A, Hartmann S, Drexl A. An exact algorithm for project scheduling with multiple modes. Oper Res Spektrum 1997;19:195-203. https://doi.org/10.1007/BF01545587

[23] Hartmann S, Drexl A. Project scheduling with multiple modes: A comparison of exact algorithms. Networks: An International Journal 1998;32:283-297. https://doi.org/10.1002/(SICI)1097-0037(199812)32:43.0.CO;2-I

[24] Sprecher A, Drexl A. Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur J Oper Res 1998;107:431-450. https://doi.org/10.1016/S0377-2217(97)00348-2

[25] Boctor F. A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes. Eur J Oper Res 1996;90:349-361. https://doi.org/10.1016/0377-2217(95)00359-2

[26] Boctor F. Resource-constrained project scheduling by simulated annealing. Int J Prod Res 1996;34:2335-2351. https://doi.org/10.1080/00207549608905028

[27] Bouleimen K, Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur J Oper Res 2003;149:268-281. https://doi.org/10.1016/S0377-2217(02)00761-0

[28] Jozefowska J, Mika M, Rozycki R, Waligora G, Weglarz J. Simulated annealing for multi-mode resource-constrained project scheduling. Ann Oper Res 2001;102:137-155.

[29] Mori M, Tseng C. A genetic algorithm for multi-mode resource constrained project scheduling problem. Eur J Oper Res 1997;100:134-141. https://doi.org/10.1016/S0377-2217(96)00180-4

[30] Özdamar L. A genetic algorithm approach to a general category project scheduling problem. IEEE Trans Syst Man Cybern C (Applications And Reviews) 1999;29:44-59. https://doi.org/10.1109/5326.740669

[31] Alcaraz J, Maroto C, Ruiz R. Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms. J Oper Res Soc 2003;54:614-626. https://doi.org/10.1057/palgrave.jors.2601563

[32] Weglarz J, Jozefowska J, Mika M, Waligora G. Project scheduling with finite or infinite number of activity processing modes-A survey. Eur J Oper Res 2011;208:177-205. https://doi.org/10.1016/j.ejor.2010.03.037