Irawan Dwi Wahyono, Khoirudin Asfani, Hari Putranto, Djoko Saryono, Herri Akhmad Bukhori, Tiksno Widyatmoko, Mohd Shafie Rosli, Nurbiha A. Shukor, Noor Dayana Abdul Halim
Scheduling is one of the most challenging computing Scheduling is a reasonably tricky problem if it has to be prosecuted in a short time. It will be even more inconvenient if the scheduled arrangement is uncertain, with many choices requiring more complicated decisions. This problem often occurs among teachers at Malang's MTS Nurul Huda school. The teaching scheduling model is one example of scheduling problems frequently encountered in recent years at MTS Nurul Huda Malang. The solution is complex, and the best solution can only be obtained by trying all the possibilities. This study uses a genetic algorithm that can provide solutions to complex problems in a rationally adequate time to apply to flexible problems in teaching. This algorithm uses binary tournament optimization in search and reciprocal exchange in mutations. The results of this optimization test get a crossover rate of 0.4 and a mutation rate of 0.4, so this optimization is the most effective and efficient in determining flexible scheduling for teachers. The result of the testing of applications is that the average accuracy n is 73.33%. © 2022 IEEE.
State University of Malang, Department of Engineering, Malang, Indonesia; State University of Malang, Faculty of Engineering, Malang, Indonesia; State University of Malang, Department of Indonesian, Malang, Indonesia; State University of Malang, Department of German, Malang, Indonesia; Malaysian University of Technology, Departement of Education, Malaysia