Automatic Timetable Generator

Main Article Content

S.P.Ramesh, Anuj Gangwar, Ketan Singh, Anookarsh Ayan

Abstract

The Automatic Time Table Generator is a solution for our colleges existing manual system. The machine will accept all of the necessary inputs and process them in order to produce the timetable. Many restrictions are needed to generate a good time table. Combinatorial problems are defined declaratively in terms of constraints in constraint programming. Constraints are relationships between problem variables that describe the solution space by placing constraints on the values that the variables will take at the same time. Since colleges have varying instructional strategies, the time table problem can take several form  Nevertheless, there are a number of entities and restrictions that are shared by both of these combinations. First and foremost, this project suggests using global constraints to model the basic core of College timetable issues. Then, using our logics, we're building a machine that can create the timetable automatically, taking into account all of the variables that go into creating a timetable, such as lectures, subjects, faculty, workload, and so on. Furthermore, the final product, or what we may call the consequence, must be free of all disputes.

Article Details

How to Cite
S.P.Ramesh, Anuj Gangwar, Ketan Singh, Anookarsh Ayan. (2021). Automatic Timetable Generator. Annals of the Romanian Society for Cell Biology, 19323–19331. Retrieved from http://www.annalsofrscb.ro/index.php/journal/article/view/8537
Section
Articles