You are on page 1of 5

International Journal of Scientific & Engineering Research, Volume 9, Issue 8, August-2018 809

ISSN 2229-5518

An Automated Scheduling System for University


Lectures and Examinations
Iwara ARIKPO1, Abigail OKOKON2

Abstract— Scheduling has been a real-life combinatorial problem over the years. University timetabling, which is part of time scheduling,
represents a difficult optimization problem, which most universities are grappling with; hence, developing software systems that automate
timetabling has also been a challenging task. The aim of this study was to develop an automated system that can simplify the lecture and
examination timetabling in the University. The system was designed with an object-oriented analysis and design approach using the unified
modelling language. The resulting web application was implemented using the Java Enterprise Edition version 6, with MySQL Server as
the backend database system. The resultant software schedules lectures and examinations interactively and in batches for the eleven
departments of the Faculty of Science at the University of Calabar, Nigeria. Lectures are scheduled randomly in timeslots, satisfying the
constraints provided in the system. The output of the resulting timetable is by far better than the manual approach, eliminating venue and
time clashes in the process.

Index Terms— scheduling, automated, timetabling, lecture, examination, algorithm, software

——————————  ——————————
1 INTRODUCTION 2 LITERATURE REVIEW

IJSER
CHEDULING is a real-life combinatorial problem that is
concerned with programming a certain number of events Many researchers have shown great interest in the area of
within a specific timeframe. [1], report that, the general scheduling and timetabling. A wide variety of studies, from
area of scheduling has been the subject of intense research for the field of operations research and artificial intelligence,
several years now. Researchers have studied literally
have addressed the spectrum of university timetabling
thousands of scheduling problems. Generally, scheduling
problems [5].
problems involve tasks that must schedule on machines,
subject to certain constraints to optimize some objective
function [2]. [3], defined scheduling as “establishing the Evolutionary techniques have been applied to solve the
timing for performing a task”. Scheduling problems arise in timetable scheduling problem. Methodologies like Genetic
many areas of human endeavour, such as transportation, Algorithms (GAs) and Evolutionary Algorithms (EAs) have
workforce (e.g. Nurse scheduling), education, sports, and so been used with mixed success. Researchers have employed
on. Scheduling and timetabling are synonymous; however, the many different approaches over the years in an attempt to
two can be viewed as two separate activities, with the term generate ‘optimal’ timetabling solutions subject to a list of
scheduling used as a generic term to cover specific types of constraints.
problems in this domain. Timetabling can therefore, be
considered as a special case of generic scheduling [1]. In [6], have developed a mathematical programming model for
Universities, scheduling problems often, arise in the course of faculty lecture assignments, where each variable represented a
generating lecture and examination timetables, and are
full teacher schedule, with the problem formulated as a set of
referred to as timetabling. The term timetabling describes the
partitioning problems with side constraints. [7] conducted a
allocation, subject to constraints, of given resources to objects
being placed in space-time, in such a way as to satisfy or research in Germany on the school timetabling problem. This
nearly satisfy a desirable set of possible objectives [4]. Solving study, it will be noted, described software implementations
a university timetabling problem manually often requires a lot and the underlying approaches utilized by the German
of time and resources in terms of manhours and losses due to institutions, most of which were based on direct heuristics. [8]
clashes and cancellations. The focus of this study is the stated the various timetabling problems in a formal way and
development of an automated timetabling system for
provided different formulations for them. [9] surveyed the
scheduling lectures and examinations.
approaches to the examination timetabling problem with a
focus on approaches that are based on the reduction to graph
colouring problems. [10] surveyed the application of genetic
algorithms to timetabling. [11] addressed what the study
termed “Quantitative Modelling and Technology Driven
International Journal of Scientific & Engineering Research, Volume 9, Issue 8, August-2018 810
ISSN 2229-5518

Departmental Lecture Scheduling”. [12] studied “Decision


Support Systems for University Lecture Scheduling”. His
work was centred on the development of a tool to provide
human-assisted timetabling. [13] presented a decision support
system using Analytic Hierarchy Process (AHP). [14] applied
genetic algorithms (GA) and sequential local search to
generate a lecture timetable. This study selected GA as a well-
suited tool for university course timetabling problem because
it is used to search large nonlinear solution spaces, where
there is a lack of expert knowledge, or the encoding is
difficult. [15] applied Modified GA and Cooperative GA to
solve the university timetable scheduling problem. Many
researchers have proposed different approaches such as,
simulated annealing ([16]; [17]), tabu search [18] and
evolutionary algorithms [19]; each solving a particular
timetabling problem.
Figure 2: Activity diagram for the automated

IJSER
timetabling system
3 MATERIALS AND METHODS
3.1 System design
The system design approach for this lectures and Scheduler Resource

-resource: Object -venue: Venue


examinations time scheduling is based on the object-oriented -course: Object
-schedule: Map
-time: String
-day: String

analysis and design (OOAD) methodology, using the unified


-mapCourseResource() -getResource()
-getSchedule()

modelling language (UML). The system design components DBHelper


-table_name: String
are presented in Figures 1 – 3. Course
-addTable(String)
-memberName Venue
-memberName
-memberName -memberName -venue_title: String
-course_title: String -addColumn(String: String) -venue_id: String
-course_id: String -getColumn() -status: String
-credit_unit: int -getTableSize() -getAttribute(String)
-level: int
-status: String
Schedule Lecture / Exam -getAttribute(String)

Register Department
Register Course

Department Faculty
Register Departmental Venue Register Faculty Venue
-department_title: String -faculty_title: String
-department_id: String -faculty_id: String
Dept -getAttribute(String) -getAttribute(String)
Admin Login
Figure 3: Class diagram for the automated timetabling
Reset Username Faculty system
Admin

View Timetable

The processing logic of the system, programmed as Servlets,


was implemented using the Java Web Technology running the
Student/
Lecturer Java Enterprise Edition version 6 (JEE6); while the user
Figure 1: Use case diagram for the automated timetabling interface and presentation logic was developed with Java
system Server Pages (JSP) and HTML. At the backend, the sever side
was deployed with Apache Tomcat, while the database system
was implemented on MySQL Server.
International Journal of Scientific & Engineering Research, Volume 9, Issue 8, August-2018 811
ISSN 2229-5518

4. RESULTS

The automated time scheduling system for University, handles


the creation of timetables, which undertakes the scheduling of
time for lectures and examinations, as well as the venues of
these activities for the entire Faculty, including joint lectures
involving multiple departments. As should be anticipated, the
system validates users, granting higher privileges to the
system administrators. Besides, the system provides database
management mechanisms to facilitate persistent data storage
as regards courses, examinations, lecture venues, departments,
Figure 6: Partial lecture timetable
and so on.

Lectures are scheduled randomly in timeslots, satisfying the


constraints provided in the system. The output of the
timetable when compared with the manual equivalent is
better; resolving venue and lecture time clashes whilst
adhering to the constraints defined in the systems model.

IJSER
Figures 4 – 7 are screenshots from the automated timetable
scheduling application.

Figure 4: Session login for users Figure 7: Code Listing for a segment of the Session
Management Servlet

5. CONCLUSION

The tasks of lecture and examination scheduling are a critical


component of any University Administration. The automation
of the timetabling problem has consequently attracted the
attention of several researchers. This study, in contribution to
efforts by other researchers, has developed a timetabling
system for lectures and examinations, which was tested within
the Faculty of Science, at the University of Calabar, Nigeria.
The authors believe that, with minor modifications, the
Figure 5: Administrator Panel
International Journal of Scientific & Engineering Research, Volume 9, Issue 8, August-2018 812
ISSN 2229-5518

software can be a useful tool for generating timetables for [6] McClure & Wells, C. (1984). A mathematical programming
other faculties in Universities. model for faculty course assignment: Decision Science.

[7] Junginger, W. (1986). Timetabling in Germany: A Survey.


Interfaces, 16(4), pp. 66-74.
6. FUTURE RESEARCH
[8] de Werra, D. (1985). An introduction to timetabling.
While this study has addressed the problem of time
European Journal of Operational Research, 19(1), pp. 151–162.
scheduling for intra faculty lectures and examinations in a
University, it is the view of the authors that, this has only [9] Carter, M. W. (1986). OR Practice – A Survey of Practical
provided opportunities for future research. For instance, the Applications of Examination Timetabling Algorithms.
application developed in this study, has not addressed time Operations Research, 34(2), pp. 193-202.
clashes for “carryover” students (those who offer lower level
[10] Ross, P., Corne, D. & Fang, H. (1994). Improving
failed courses while in higher levels). Another potential
evolutionary timetabling with delta evolution and
avenue for further research is the scheduling for multi-faculty
directed mutation. In: Davidor, Y., Manner, R., Schwefel,
venues, (i.e., those shared by multiple faculties). Addressing
H. (eds.): Proceedings of the 3rd International Conference on
these issues in a future research will enhance the efficiency of
Parallel Problem Solving from Nature, Springer, Berlin, pp.
this application and those developed by other researchers.
556-565.

IJSER
[11] Boronico, J. (2000). Quantitative modelling and
ACKNOWLEDGMENT technology driven departmental course scheduling.
Omega, 28(2), pp. 327-346.
The authors wish to thank all the Staff of the Faculty of Sci-
ence, and the Central Timetable Officers at the University of
[12] Pesenti, M. (2002). Decision Support System for University
Calabar, Nigeria, who provided the expert information during
the development of the timetabling application. Course Scheduling.

[13] Parthiban, P., Ganesh, K., Narayanan, S. & Dhanalakshmi,


REFERENCES R. (2004). In IEEE International Engineering Management
Conference: Preferences Based Decision-making Model (PDM)
[1] Sandhu, K. S. (2001). Requirements for the degree of
for Faculty Course Assignment Problem.
Doctor of Philosophy. School of Management. Nathan
Campus. Griffith University: Automating Class Schedule [14] Abdullah, S., Burke E. & McCollum, B. (2007). In CEC: A
Generation in the Context of a University Timetabling Hybrid Evolutionary Approach to the University Course
Information System. Timetabling Problem.

[2] Abdennadher S. & Edward M. (2007). Department of [15] Ghaemi, S., Mohammad T. V. & Ali A. (2007). Using a
Computer Science, 5th Settlement New Cairo City. Genetic Algorithm Optimizer Tool to Solve University
Constraint-Based Examination Timetabling for the German Timetable Scheduling Problem: Signal Processing and Its
University in Cairo. Applications. 9th International Symposium.

[3] Wight, O. W. (1984). Van Nostrand Reinhold Company, [16] da Fonseca, M., Martins, I., Ye, M., Constantino, M. &
NewYork: Production and Inventory Management in the Cadima, J. (2014). Modeling target volume flows in forest
Computer Age. harvest scheduling subject to maximum area restrictions.
Top, 22(1), pp. 343-362.
[4] Wren, A. (1996). Scheduling: timetabling and rostering – A
special relationship, pp. 46–75. [17] Zhang, D., Liu Y., M’Hallah R. & Leung S. C.H. (2010).
European Journal of Operational Research: A simulated
[5] Abdullah, S. (2006). Heuristic Approaches for University
annealing with a new neighbourhood structure based algorithm
Timetabling Problems. PhD thesis: The School of
for high school timetabling problems, 203(1), pp. 550-558.
Computer Science and Information Technology,
University of Nottingham.
International Journal of Scientific & Engineering Research, Volume 9, Issue 8, August-2018 813
ISSN 2229-5518

[18] Bello, G. S., Rangel, M. C. & Boeres, M. C. (2008). 7th Iwara ARIKPO1: Department of Computer Science, University
International Conference on the Practice and Theory of of Calabar, Nigeria. Email: iwara.arikpo@unical.edu.ng;
Automated Timetabling: An Approach for the Class Teacher iiarikpo@gmail.com
Timetabling Problem.

[19] Raghavjee, R. & Pillay N. (2010). In Second World


Congress on Nature & Biologically Inspired Computing:
Using genetic algorithms to solve the South African school
timetabling problem, pp. 286–292.

AUTHOR DETAILS:
Corresponding Author:

Abigail OKOKON2: Department of Computer Science,


University of Calabar, Nigeria.

IJSER

You might also like