Genetic algorithm for solving the master thesis timetabling problem with multiple objectives

Master thesis defense scheduling problem is a real-world practical problem that arises from the Vietnamese Universities. In this paper, we give the formulation of the problem based on realistic requirements. We then show that the considered problem is NP-hard and propose a genetic algorithm for solving it. We experiment the proposed algorithm on the real problem instances taken from Hanoi University of Science and Technology. Experimental results show the feasibility of proposed algorithm.