International Journal of Research In Science & Engineering
Volume: 1 Special Issue: 1
e-ISSN: 2394-8299
p-ISSN: 2394-8280
TITLE: A REVIEW ON TIME TABLE GENERATOR METHOD
Ashwini R. Dhamanwar1 , Prof. Chaitali S. Suratkar2
1
2
Ashwini R. Dhamanwar, Information Technology, JDIET,YTL, [email protected]
Prof. Chaitali S. Suratkar, Information Technology,JDIET,YTL, [email protected]
ABSTRACT
The manmade system of preparing time table in colleges with large number of student is very time consuming
and usually ends up with various classes clashing either at same room or with same teachers having more than
one class at a time. This is just because of common human errors which are very difficult to prevent in processes
such as these. To overcome these problems we usually taking the previous years time table and modifying it but
still it is a difficult to changes. To overcome all these problems we p ropose to make an automated system. The
system will take various inputs like details of students, subjects and class rooms and teachers available,
depending upon this information it will generate a possible time table, making optimal utilization of all res ources
in a way that will best suit any of constraints or college rules. List of subjects may include electives as well as core
subjects. The case is similar to schools and other educational institutions. So the paper’s aim is to develop a
general purpose which can efficiently generate best solutions.
1. INTRODUCTION
Time table scheduling has been in human requirements since they thought of managing time effectively.
It is widely used in schools, colleges and other fields of teaching and working like crash courses, couching centers,
training programs etc . In early days, time table scheduling was done manually with a single person or some group
involved in task of scheduling it with their hands, which take lot of effort and time. While scheduling even the
smallest constraints can take a lot of time and the case is even worse when the number of constraints or the amount
of data to deal with increases. In such cases perfectly designed time table is reused for whole generation without any
changes, proving to be dull in such situations. Other cases that can cause problem is when the number of
employers/workers are weak, resulting in rescheduling of time table. Institutions/Schools/Collages/Universities are
the regular users of such time tables. They need to schedule their course to meet the need of current duration and
facilities that are available to them. However, their schedule should meet the requirement of new course addition
and newly enrolled students to fresh batches. This may result in rescheduling the entire time table once again for its
entire batches and to be scheduled in shortest possible time before the batches course start. Another problem that
occur when scheduling time table for exams. When many batches have exam on same day, they need to be
schedules effectively taking into account all problems related to facilities that are available to conduct these exams
simultaneously
2.METHODS USED FOR TIME TABLE GENERATION
This provides an analysis of the automated timetable literature broadly organized by algorithmic technique.
It begins with a presentation of the major timetable solution generation algorithms that have persisted in the
literature.
2.1 Stimulating Annealing
This is search technique for finding solution to optimization problems. It is based upon correlation with
physical development of annealing .It is used as a technique to solve hard optimization problems. Most of the
time,this method is easy to apply because changes or moves in the solution space of the problem that is being solved
are easy derieved. In this optimization is performed without former knowledge of problem structure or any particular
solution approach . This method is easy to apply because the changes whatever we want that get easily
done.Changes done in uphill or downhill manner[3].
IJRISE| www.ijrise.org|[email protected] [97-102]
International Journal of Research In Science & Engineering
Volume: 1 Special Issue: 1
e-ISSN: 2394-8299
p-ISSN: 2394-8280
2.2 Genetic Algorithms
GAs have the property of implicit parallelism. GAs are randomised algorithms, in that they use operators
whose results are governed by probability. The results for such operations are based on the value of a random
number.This means GAs use probabilistic transition rules, not deterministic rules[1]. GAs operate on several
solutions simultaneously gathering information from current search points to a direct s ubsequent search.Their ability
to maintain multiple solutions concurrently makes them less susceptible to the convergence problem of local
maxima and noise.GAs work with according of the parameter set, not the parameters themselves. GAs search from a
population of points, not a single point .Long bit string encoding regarding when and where each class is to take
place is the most common genetic representation of time table generator. Preparing Time Table is most difficult task
in schools or collages therefore most of the time Time Table is prepared by using previous year time table.
Therefore problems arising like clashing of classes ,one teacher is allocated to two subject at a time,classhing of labs
etc.Therefore we are going to develop a software which will generate the timetable automatically.Genetic algorithm
and stimulating algorithm are use to implement this software[2].
3.DESIGN OF TIME TABLE GENERATION SYSTEM
This system consists two main components. first is data entry, verification, saving. second is timetable
generating algorithm. There are lots of modules and every module is responsible for specific task. User will enter
data of student and staff,classroom,subjects.Then all these information will check by data validation module.User
can change or update the dataThen timetable generation algorithm will get implemented by satisfying the
constraints.whenever there is a condition of getting number of possible solution the g enetic algorithm is applied.
This algorithm first takes number of teachers ,number of subjects and number of classroom on the basis of this
information test condition will generate.This create the result having no of possible solution from which the best
solution get selected.If the error occur such as classes clashing,two teacher allocated to same subject. To make a
error free timetable the system should satisfy the soft and hard constraint [1].
3.1Hard Constraints



No teacher or student must be assigned to more than one class.
There must be required number of periods for each subject.
Every subject must have required number of periods.
3.2 SOFT CONSTRAINTS


Subjects should be evenly distributed.
Same teacher should not have more than one period.
Fig-1:Timetable Generation System
IJRISE| www.ijrise.org|[email protected] [97-102]
International Journal of Research In Science & Engineering
Volume: 1 Special Issue: 1
e-ISSN: 2394-8299
p-ISSN: 2394-8280
Room s1
Day/Time
10.45
11.45
11.45
12.45
12.45
1.45
2.00
3.00
3.00
4.00
4.15
5.15
MON
TUES
THRS
FRI
SAT
23
3
9
15
24
14
13
0
5
10
1
19
0
8
17
21
22
18
16
4
0
2
6
0
7
20
0
12
11
0
Table-1:possible solutions for s1 room
This is possible solutions for s1 class such as this number of possible solutions will created and optimized
result we get. By using such solution the result generation will become easy.The final timetable is as follows.
MON
TUES
WED
THRS
FRI
10.45
Mr. A
Mr. B
Mrs. C
Mr. A
Mrs. D
11.45
WC
SE
NAS
WC
DWC
11.45
Mr. B
Mrs. C
Mr. A
Mrs. D
Mrs. C
12.45
SE
NAS
WC
DWC
NAS
12.45
Mrs. C
Mrs. D
Mr. B
Mr. B
1.45
NAS
DWC
SE
SE
2.00
Mrs. D
Mr. A
Mrs. D
3.00
DWC
WC
DWC
Table-2::Result
How the data flow through database is described in following diagram. Each process rep resent the working of user
with the interface and followed by its specified operation performed in the database. When one process finishes its
work the next process takes previous input and performed its work[4].
Fig-2:Data Flow Diagram
IJRISE| www.ijrise.org|[email protected] [97-102]
International Journal of Research In Science & Engineering
Volume: 1 Special Issue: 1
e-ISSN: 2394-8299
p-ISSN: 2394-8280
3.3 ER diagram
The database schema is represented by the ER Diagram. Every box represent a table. The table name is
given at the top and the fields are given at the bottom. The bold italics fields are the primary keys used, along with
field name its data type and length are given.
_ teachers table stores information of teachers such as teacher password and name.
_ subjects table stores information of subjects such as Subject- ID,
._center table store information of Center-ID
_ schedule store information of Sche-Timeslot
_student store information of Stud-Name,Stud-Age,etc
ER diagram is as follows
Fig-3: ER Diagram
3.4 Features
a)The system generates intermediate level as well many final results consists of time table, teacher timetable, room
wise time table, student time table etc..
b) It distributes workload of lectures equally among all the specified time slots.
c) It prioritizes time slots according to specified priority. If lecture cannot be adjusted then it can be moved up in
higher priority slot until adjusted accordingly.
d) User can make gap of the number of days among the lectures, it can dynamically be adjusted as well.
e) The time tabling algorithm tries to adjust courses to user customized slots according to specified time.
f) The time table software adjusts the periods for staff.
g) It tries to adjust the lectures of a subject on the same time within the weekdays.
h) All information is customized by the user.
i) It depicts the progress of subjects adjustment at intermediate result level and if clashes cannot be removed and
impossible to adjust then displays that course and number of lectures which cannot be adjusted.
j) Various algorithmic techniques have been ensure to improve the performance of the system.
4 CONCLUSION
Timetable Generator application will simplify the process of time table generation easily which may
otherwise needed to done using spread sheet manually possibly leading to constraints problem that are difficult to
determine when time table is generated manually.The intention of algorithm is to generate the time table
automatically is satisfied.To improve the efficiency search operation the algorithm incorporates lots of
techniques.It also addresses the important hard constraint.
IJRISE| www.ijrise.org|[email protected] [97-102]
International Journal of Research In Science & Engineering
Volume: 1 Special Issue: 1
e-ISSN: 2394-8299
p-ISSN: 2394-8280
REFERENCES
[1] Automated Class Scheduling Generation in the Context of a University Timetable Information System, Kuldeep
Singh Sandhu.
[2] A Genetic Algorithm Based University Timetabling System, Edmund Burke, David Elliman and Rupert Weare
[3] Artificial intelligence(Elain Rich,Kevin Knight,Shivashankar B Nair)
[4] “College Timetabling Information System”,Husain Gholoom.
[5]Michael W.Carter Gilbert Laporte,& Sau Yan Lee,Examination Timetabling Algorithmic Stratigies &
Application.Journal of Operational Research Society.
.
IJRISE| www.ijrise.org|[email protected] [97-102]