Skip to content

Project on generating a timetable for university (NP-Hard problem)

License

Notifications You must be signed in to change notification settings

nihal1294/timetable

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

🆃🅸🅼🅴🆃🅰🅱🅻🅴 🅶🅴🅽🅴🆁🅰🆃🅾🆁

Timetable for a given section of a semester must contain details about the subjects taught hourly during the days of a week and the faculty members assigned to each subject. Timetables must be such that no two subjects taught by a single lecturer overlap. The problem of timetable scheduling is described as a highly-constrained NP-hard problem. It is known as the timetabling problem by most researchers. A lot of complex constraints need to be addressed for development of an efficient algorithm to solve this problem. Presently, in many institutions, the faculty in-charge has to manually assign hourly slots to every subject while satisfying various constraints. If an overlap/clash is found among the timetables, changes must be made manually using trial and error methods. This tends to take a considerable amount of time. With the help of software, this process can be simplified, thus reducing time spent. Various algorithms have been developed which provide techniques to generate timetables. This also simplifies error correction and future modification of timetables, aiding maintenance and usability.

Timetable Generator is a desktop application that provides a simple and quick way to generate a timetable for a university. The software is developed using Python 3 for the backend and QT for the GUI. An algorithm based on the heuristic approach described in __ was developed to satisfy the educational model setup at NMAMIT. Universities/colleges that come under Visvesvaraya Technological University(VTU) may also be able to use this with certain modifications and adjustments. This software was developed as major project during the final year of engineering. It was developed under the guidance of Mr. Ramesha Shettigar, Assistant Professor, Department of Computer Science, NMAMIT. The objective of this project was to solve the real life problem of timetable scheduling and generate a timetable without manual effort using the proposed algorithm. The project was found to be useful to our department and can be used by other departments. It can also be extended for use by an entire university. It has achieved the goals we had set out to accomplish- mainly reducing manual effort and generating satisfactory timetable schedules for both students and faculty.

About

Project on generating a timetable for university (NP-Hard problem)

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages