Solving the TimeTabling problem at FPT University
Authors: Nguyen Van Hoai; Luu Thanh Cong; Pham Quang Dung
Abstract: TimeTabling is a classical problem in combinatorial optimization. There are many variants of the problem depending on specific requirements of the given institution. In this paper, we describe a new variant of the timetabling problem arising in FPT university called FUTimeTabling. We propose an algorithm for solving FUTimeTabling problem. We conduct expriments on a real data test which show the feasibility of the proposed technique.
Published: December 2015