Document Type : Research Paper


Department of Industrial and Production Engineering, Mechanical Faculty, Rajshahi University of Engineering and Technology, Rajshahi, Bangladesh.


The continuous growth of the population causes an increased demand for our healthcare services. Insufficient hospitals face challenges to serve the patient within a preferable duration. Long lines in front of counters increase the processing time of a patient. From the entry to the completion, plenty of time waste just for unscheduled hospital management system. Job shop scheduling is an optimization process in which jobs are assigned with maintain a particular sequence. In this paper, we proposed flexible job shop scheduling to solve this type of problem by considering patients as job and test counter as machine for the optimization of the processing time and increase the efficiency of a hospital or a clinic. Genetic Algorithm was used to analyze the processing time for multiple counter of a hospital for a stable and effective scheduling. The results showed that an optimized makespan was generated and patients could fulfill their needs much quickly after applying flexible job shop scheduling.


Main Subjects

[1]     Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of operations research1(2), 117-129.
[2]     Wang, L., Zhou, G., Xu, Y., & Liu, M. (2012). An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling. The international journal of advanced manufacturing technology60(9), 1111-1123.
[3]     Saraswati, T. G., & Saputri, M. E. (2019, May). Queuing management and evaluation of standard operating procedures for hospital mental health polyclinics. 1st international conference on economics, business, entrepreneurship, and finance (ICEBEF 2018) (pp. 779-782). Atlantis Press.
[4]     Teekeng, W., & Thammano, A. (2011). A combination of shuffled frog leaping and fuzzy logic for flexible job-shop scheduling problems. Procedia computer science6, 69-75.
[5]     Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers and operations research35(9), 2892-2907.
[6]     Li, J. Q., Pan, Q. K., & Gao, K. Z. (2011). Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. The international journal of advanced manufacturing technology55(9), 1159-1169.
[7]     Sajadi, S. M., Alizadeh, A., Zandieh, M., & Tavan, F. (2019). Robust and stable flexible job shop scheduling with random machine breakdowns: multi-objectives genetic algorithm approach. International journal of mathematics in operational research14(2), 268-289.
[8]     Kumar, G., & Bisoniya, T. S. (2005). Flexible job shop scheduling operation using genetic algorithm. Journal of innovations in engineering and technology5, 1-5.
[9]     Xie, J., Gao, L., Peng, K., Li, X., & Li, H. (2019). Review on flexible job shop scheduling. IET collaborative intelligent manufacturing1(3), 67-77.DOI: 10.1049/iet-cim.2018.0009
[10] Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers & operations research, 35(10), 3202-3212.
[11] Pinedo, M. (2012). Scheduling (Vol. 29). New York: Springer.
[12] Marynissen, J., & Demeulemeester, E. (2016). Literature review on integrated hospital scheduling problems. KU Leuven, faculty of economics and business, KBI_1627.
[13] Mahanta, L. B. (2019). Estimation of the waiting time of patients in a hospital with simple Markovian model using order statistics. Hacettepe journal of mathematics and statistics48(1), 274-289.        
[14] Bekal, M., Manikandan, A., Tewari, A., & GB, P. (2019). Parallel patient treatment algorithm and it’s application in hospital queuing recommendation. International journal of advance research, ideas and innovations in technology, 5(3), 578-582.
[15] Chawasemerwa, T., Taifa, I. W., & Hartmann, D. (2018). Development of a doctor scheduling system: a constraint satisfaction and penalty minimisation scheduling model. International journal of research in industrial engineering7(4), 396-422.
Barzegar, B., Motameni, H., & Bozorgi, H. (2012). Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net. Journal of applied mathematics2012.