Skip to content
image post
White papers

Solving the TimeTabling problem at FPT University

April 16, 2024

Share with:


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


Download now

Do you need a workthrough of our platform? Let us know

    Related Posts

    Get ahead with AI-powered technology updates!

    Subscribe now to our newsletter for exclusive insights, expert analysis, and cutting-edge developments delivered straight to your inbox!