Prioritized Schedule Algorithm : Time Table Generation
Conference: Sixth International Conference on Computational Intelligence and Information Technology
AbstractAuthor’s have taken into consideration issues of task allocation and resource selection problem with respect to the minimum processing cost to be an NP-hard problem. The problem of timetable scheduling is described as a highly constrained NP-hard problem. A lot of complex constraints need to be addressed for development of an efficient algorithm to solve this problem. The hand operated system of Time table preparation in college is very monotonous and time consuming which results in either the same teacher ending up with more than one class at a time or a number of classes conflicting at the same classroom. Due to non-automatic perspective absolute utilization of resource has proven ineffective , In order to deal with such problem , mechanized system can be designed with computer aided Time table generator which will serve in many applications .The proposed design of algorithm has the ability to manage Students ,Lecturers, venues, slot and courses of the department, the data given as input is saved in a MYSQL database using a configurable database module and report generation module to generate the best combination of courses and slot for creating a feasible timetable for working days of week, making excellent application of all resource in a way which will be best suited for the constraints. |
CIIT - 2016 |