TY  - JOUR
VL  - 16
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-85108533046&doi=10.3991%2fijet.v16i11.21017&partnerID=40&md5=3c2e0cdd6633e224fd102ef24676c064
JF  - International Journal of Emerging Technologies in Learning
A1  - Tung, S.N.
A1  - Jaafar, J.B.
A1  - Aziz, I.A.
A1  - Nguyen, H.G.
A1  - Bui, A.N.
Y1  - 2021///
KW  - Education computing; Job shop scheduling; Multiobjective optimization; NP-hard; Scheduling
KW  -  Algorithm for solving; Education management; Examination timetabling; Multi objective; Policy constraints; Target optimization; Time requirements; Timetabling problem
KW  -  Genetic algorithms
ID  - scholars15731
N2  - Examination timetabling is one of 3 critical timetabling jobs besides enrollment timetabling and teaching assignment. After a semester, scheduling examinations is not always an easy job in education management, especially for many data. The timetabling problem is an optimization and Np-hard problem. In this study, we build a multi-objective optimizer to create exam schedules for more than 2500 students. Our model aims to optimize the material costs while ensuring the dignity of the exam and students' convenience while considering the design of the rooms, the time requirement of each exam, which involves rules and policy constraints. We propose a programmatic compromise to approach the maximum target optimization model and solve it using the Genetic Algorithm. The results show the effective of the introduced algorithm. © 2021. All rights reserved
IS  - 11
EP  - 24
SN  - 18688799
PB  - International Association of Online Engineering
SP  - 4
TI  - Genetic Algorithm for Solving Multi-Objective Optimization in Examination Timetabling Problem
N1  - cited By 11
AV  - none
ER  -