ABSTRACT
Lecture timetabling is a very important process in any educational institution. It is an open-ended program in which courses must be arranged around a set of time slot ’T’ and remains so that some constraints are satisfied. It constitutes a class of difficult-to-solve optimization problems that lacks analytical solution method. Data gathering on the current system was analysed to create a requirement definition for the improved timetable system. Literature review was carried out to search the best approach that can help to solve the problem in the timetable system. Genetic Algorithm has been implemented in the Timetable Management System. This is because Genetic Algorithm is able to produce a feasible timetable system. Java, XML and PHP programming languages were used in developing the solution. MySQL database was used as the back-end for the solution. The front-end solution will be implemented in an android mobile operating system for easier accessibility and proximity to users.
TABLE OF CONTENTS
TITLE PAGE …………………………………………………………………..………. i
APPROVAL PAGE ………………………………………………………..................... ii
DEDICATION ……………………………………………………………..................... iii
ACKNOWLEDGEMENT ……………………………………………………………... iv
ABSTRACT …………………………………………………………………………..... v
TABLE OF CONTENT ………………………………………………………………...vi
CHAPTER ONE: INTRODUCTION
1.1BACKGROUND OF THE STUDY ……………………………………..3
1.2STATEMENT OF THE PROBLEM …………………………………….4
1.3OBJECTIVES OF THE STUDY ………………………………………...4
1.4SIGNIFICANCE OF THE STUDY ……………………………………...5
1.5SCOPE OF THE STUDY ………………………………………………..6
1.6LIMITATION OF THE STUDY ………………………………………...6
1.7DEFINITION OF TERMS ……………………………………………….6
CHAPTER TWO: REVIEW OF RELATED LITERATURE
2.1REVIEW OF RELEVANT THEORIES AND TECHNOLOGIES ……...9
2.2TIMETABLING AS A NP-COMPLETE PROBLEM ………………….14
2.3BRIEF HISTORY OF GENETIC ALGORITHMS ……………………..15
2.4BASIS FOR A GENETIC ALGORITHM ………………………………19
2.5METHODS OF REPRESENTATION …………………………………..21
2.6METHODS OF SELECTION …………………………………………...23
2.7METHODS OF CHANGE ………………………………………………26
2.8STRENGTHS OF GENETIC ALGORITHMS ………………………….27
2.9LIMITATIONS OF GENETIC ALGORITHMS ………………………..35
CHAPTER THREE: SYSTEMS INVESTIGATION AND ANALYSIS
3.1ORGANOGRAM FOR COMPUTER SCIENCE DEPARTMENT …….. 46
3.2FACTS FINDING ………………………………………………………...48
3.3ANALYSIS ……………………………………………………………….48
3.4PROBLEM OF THE CURRENT SYSTEM ……………………………...49
3.5PROPOSING A NEW SYSTEM …………………………………………50
3.6ADVANTAGES OF THE PROPOSED SYSTEM ……………………….50
CHAPTER FOUR: SYSTEM DESIGN
4.1OBJECTIVES OF THE DESIGN …………………………………………52
4.2SYSTEM BLOCK DIAGRAM …………………………………………….53
4.3OUTPUT DESIGN …………………………………………………………54
4.4INPUT DESIGN ……………………………………………………………54
4.5PROGRAM DESIGN ………………………………………………………54
4.6DATABASE ………………………………………………………………..57
4.7DATABASE SPECIFICATION …………………………………………...57
4.8PROGRAM FLOWCHART ……………………………………………….58
4.9MODELLING THE SYSTEM …………………………………………….59
4.10CHOICE OF PROGRAMMING LANGUAGE …………………………...66
CHAPTER FIVE: SYSTEM DOCUMENTATION AND IMPLEMENTATION
5.1SYSTEM REQUIREMENTS ………………………………………………67
5.2HOW TO INSTALL ………………………………………………………..68
5.3TRAINING OF OPERATORS ……………………………………………..68
5.4IMPLEMENTATION METHOD …………………………………………..68
5.5REVIEW AND MAINTENANCE OF THE SYSTEM …………………….70
CHAPTER SIX: CONCLUSION, SUMMARY AND RECOMMENDATION
6.1 SUMMARY ……………………………………………………………………...72
6.2 PROBLEMS ENCOUNTERED ………………………………………………….72
6.3 CONCLUSION …………………………………………………………………...72
6.4 CONTRIBUTION TO KNOWLEDGE …………………………………………..72
6.5 RECOMMENDATION …………………………………………………………...73
REFERENCES ……………………………………………………………………………74
APPENDICES …………………………………………………………………………….78
Subscribe to access this work and thousands more