Automatic Time–Table

generator

-Manu Gupta
-Lucky Rajpoot
-Alfiya Mirza
-Manoj K. Kanaujia

11/8/10 (batch A11)

11
Problem Definition
Timetabling is the allocation, subject to
constraints, of given resources to objects being
placed in space time, in such a way as to satisfy
as nearly as possible a set of desirable
objectives.

11/8/10 22
NP complete problem.
At present, science has no analytical solution
method for this type of problem, other than
exhaustive search, which however cannot be
applied but only to toy problems, due to the
immense search spaces of real problem cases.

11/8/10 33
Hard and soft constraints
Hard constraints are those constraints that
must be rigidly fulfilled.
Soft constraints are those that it is desirable to
be fulfilled to the possible extent, but are not
fully essential for a valid solution.

Therefore, soft constraints can also be seen

as optimization objectives for the search
algorithm.

11/8/10 44
Three common strategies to search
for a solution

Genetic Algorithms
Neural networks
Dynamic programming

11/8/10 55
Which strategy are we
following?

We are not going to use any of the three

strategies.

11/8/10 66
Then?
Considering the history of research on the
solution to this problem we reached a
conclusion that a fully automated software will
be either very hard or impossible to develop.
So we aim to make a semi automated software
with a little human intervention.

11/8/10 77
What we did till now?
Research work
Manually created a time table
Planning
Interface design
Database design
Database connectivity/creation

11/8/10 88
Research work
Research paper presented in “2009
international conference in recent technologies
in communication and computing” copyright
2009 IEEE.
Research paper presented in California state
university.
Spent lot of time understanding the problem
and its manual solution with OC, time table,
Dept of CS & IT, MIT, Moradabad.

11/8/10 99
Manually created time
table
Considering a smaller problem (almost half of
original) we tried to create time table.
Our test case had
3 years with 2 batches each
16 teachers
6 lecture rooms
3 tutorial rooms
3 lab. Rooms
Teaching
11/8/10 load per week was around 20 (as it is1010
We got a clear idea of
What is the problem.
How its solved manually.
How can we solve it.
What problems will we face.

11/8/10 1111
 Database Design

Initially three tables will be in database

Class : sections and batches of each year

Room : List of available rooms
Teaching load : Its what we call KUNDLI in
practice

11/8/10 1212
For each tuple in “Room” table, a table will be
created representing room time table of the
corresponding room

For each tuple in “Class” table, table will be

created representing master time table.

For each unique “faculty name” in “teaching

load” table, table will be created, representing
teacher’s time table.

11/8/10 1313
 Interface design
&
Database
connectivity/creation

11/8/10 1414