Raja Mohd. Nazir, Raja Nadiah (2013) The ford fulkerson algorithm on a case study of the dissertation scheduling problem. Masters thesis, Universiti Teknologi Malaysia, Faculty of Science.

PDF
78kB 
Official URL: http://dms.library.utm.my:8080/vital/access/manage...
Abstract
Scheduling problem are often hard and time consuming to solve. It is considered as one of the most difficult problem. Therefore, the development of a network model for timetabling problem is necessary to solve the problem by determining the maximum flow in the network. The purpose of this study is to develop a schedule of students versus examiner for proposal presentation exercise at Mathematical Sciences Department, Faculty of Science, UTM. In this research one of the network flow algorithm called Ford Fulkerson algorithm is applied in order to find the maximum flow of the network. Given a set of constraint consisting of a set of programs, a set of students, a set of lecturers, a set of days and periods and a set of classrooms, the problem is to assign programs to students, students to lecturer, lecturer to days and period, and lecturer to classroom subject to a set of hard and soft constraints. The computer software, MATLAB version 7.11.0 will be used to generate the Ford Fulkerson Algorithm. This is because it manages to successfully satisfy most of the constraints and optimizes the utilization of classrooms effectively and efficiently
Item Type:  Thesis (Masters) 

Additional Information:  Thesis (Sarjana Sains (Matematik))  Universiti Teknologi Malaysia, 2013; Supervisor : Assoc. Prof. Dr. Rohanin Ahmad, Pn. Rashidah Ahmad 
Subjects:  Unspecified 
Divisions:  Science 
ID Code:  33176 
Deposited By:  Kamariah Mohamed Jong 
Deposited On:  20 Jun 2017 09:25 
Last Modified:  20 Jun 2017 09:27 
Repository Staff Only: item control page