Thesis Abstract

Thesis Overview

<p> </p><div><p><strong>1.0 INTRODUCTION</strong></p><p>The academic environment has gone so complex that an automated system may be required to automate certain aspects of the academic system. One such area of difficulty is timetable scheduling; those saddled with the responsibility of time table creation are always faced with challenges of creating effective system that will deliver its purpose.Automation has been seen as a way of enhancing Manual activities. For instance, Manual operations are characterized with some setbacks such as erroneous computation etc. with automation, those setbacks are either eliminated or reduced to barest minimal. To this effect application are being created to hide the manual operations and project automation.The general task of solving timetable scheduling problems is iterative and time consuming. In real world application, the participants to the timetable scheduling have conflicting preferences which make the search for an optimal solution a problem. In order to solve the problem it is necessary to find a compromise between all the parties involved in the requirement, usually conflicting (e.g. day, time). The constraints are related to the availability, timetabling and preference of each of the instructor, to rooms availability, number of student and curricula. In order to solve this problem for the particular case of university system, timetable scheduling has to adopt the computer-base approach. Computer-base approach enables the institution to automate certain manual task and work efficiently. Also, in the particular case of timetable scheduling, the automated system could find an optimal or a sub-optimal solution using mainly inter agent communication.</p><p><strong>1.1 PROBLEM DEFINITION</strong></p><p>The scheduling problem can be defined as a problem of finding the optimal sequence for evaluating a finite set of operation (task or job) under a certain set of constraints that must be satisfied.</p><p>A typical example of scheduling problem is timetable scheduling. The problems to be solved by timetable scheduling are mapped out below.</p><p>1) Maximize individual in timetable scheduling or other resources.</p><p>2) Minimize time required to complete the entire process for timetable scheduling.</p><p>3) Production of timetable and of conflict interest, place, etc. All these problems and more are to be solved so that the proposal solution for timetable scheduling will be an enchantment over the manual.</p><p><strong>1.1 AIM AND OBJECTIVES</strong></p><p>In solving problems of timetable scheduling, there is need for an effective and efficient techniques or methods.The only method proven to be effective and effective is the computer-based approach. The approach that automates all the manual concepts of timetable scheduling thereby eliminate all the problems associated with the manual technique.To this end, this project work is designed to introduce computer bases approach to the manual method of timetable scheduling.</p><p><strong>1.3 SCOPE OF THE STUDY</strong></p><p>Timetable scheduling is a complex and time consuming process. Generating timetable for all levels in a university system will definitely take a lot time. For the purpose of this work, time table creation will be based on degree programme only with focus on 100 and 200 level courses, this will be an effective way to start the process of time table creation.Also, the work will be made to run on the internet backbone this will make the application distributed and network based.</p><p><strong>1.4 LIMITATION OF THE STUDY</strong></p><p>The proposed development is a time consuming process to this end the project will be streamline to 100 and 200-degree programme due to time limitation.</p><p>Another problem is the inadequate research materials on the subject of timetable scheduling and creation. This project work made use of the little available materials.</p></div><h3></h3><br> <br><p></p>