Loading...
Please wait, while we are loading the content...
Similar Documents
Time table Scheduling
| Content Provider | Indraprastha Institute of Information Technology, Delhi |
|---|---|
| Author | Vanjani, Akash |
| Abstract | Scheduling semester TimeTable and End-Semester Examination Schedule are major challenges which are faced by universities. In this project, I am only solving the former part i.e. to schedule the semester timetable. The TimeTable problem takes courses, instructors, instructors taking which courses, etc. as input and outputs a timetable which satis es all the constraints. The TimeTable problem has been proved to be NP-Complete. However, some restrictive versions of this problem can be solved in polynomial time. There are various approaches to solve this prob- lem. Some of them are vertex coloring, Integer Linear Program(ILP), logic programming(using Prolog) and ow network. As we know, graph coloring and ILP both are NP-Complete. So, TimeTable problem still remains NP-Complete. However, there is a speci c restricted version of TimeTable problem which can be reduced to ow network and therefore solvable in polynomial time. |
| File Format | |
| Language | English |
| Access Restriction | Authorized |
| Subject Keyword | Timetable Constraints Schedule |
| Content Type | Text |
| Educational Degree | Bachelor of Technology (B.Tech.) |
| Resource Type | Thesis |
| Subject | Data processing & computer science |
