Automated university course timetable generator

Sanjeev Kumar and Rakesh Pandey

International Journal of Industrial and Systems Engineering, 2020, vol. 36, issue 1, 1-16

Abstract: Scheduling and planning are considered difficult combinatorial optimisation problems and belong to the NP-complete class. The university course timetabling problem (UCTP) is one such type of problem which is to be solved under various constraints. The purpose of this paper is to create a university course timetable generator to automate the university course scheduling process, which is one of the most challenging and cumbersome tasks for the administration. All modules of the proposed timetable generator are inter-linked in SQL database and implemented in C# programming on the .NET platform. The proposed university course timetable generator is tested on several randomly generated problem instances of various complexities to verify the efficiency. The outcomes of them signify the importance of the solver, as it is producing a conflict-free timetable by taking very less amount of time and primary memory.

Keywords: university course timetabling problem; UCTP; combinatorial optimisation; scheduling; timetable generator; C# programming; .NET; SQL server. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=109133 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:36:y:2020:i:1:p:1-16

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().