The ford fulkerson algorithm on a case study of the dissertation scheduling problem

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 t...

Full description

Saved in:

Bibliographic Details
Main Author:	Raja Mohd. Nazir, Raja Nadiah
Format:	Thesis
Language:	English
Published:	2013
Subjects:	Unspecified
Online Access:	http://eprints.utm.my/id/eprint/33176/1/RajaNadiahBintiRajaMohdNazirMFS2013.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.33176
record_format	uketd_dc
spelling	my-utm-ep.331762017-06-20T01:27:46Z The ford fulkerson algorithm on a case study of the dissertation scheduling problem 2013 Raja Mohd. Nazir, Raja Nadiah Unspecified 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 2013 Thesis http://eprints.utm.my/id/eprint/33176/ http://eprints.utm.my/id/eprint/33176/1/RajaNadiahBintiRajaMohdNazirMFS2013.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:82497?queryType=vitalDismax&query=+The+ford+fulkerson+algorithm+on+a+case+study+of+the+dissertation+scheduling+problem&public=true masters Universiti Teknologi Malaysia, Faculty of Science Faculty of Science
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	Unspecified
spellingShingle	Unspecified Raja Mohd. Nazir, Raja Nadiah The ford fulkerson algorithm on a case study of the dissertation scheduling problem
description	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
format	Thesis
qualification_level	Master's degree
author	Raja Mohd. Nazir, Raja Nadiah
author_facet	Raja Mohd. Nazir, Raja Nadiah
author_sort	Raja Mohd. Nazir, Raja Nadiah
title	The ford fulkerson algorithm on a case study of the dissertation scheduling problem
title_short	The ford fulkerson algorithm on a case study of the dissertation scheduling problem
title_full	The ford fulkerson algorithm on a case study of the dissertation scheduling problem
title_fullStr	The ford fulkerson algorithm on a case study of the dissertation scheduling problem
title_full_unstemmed	The ford fulkerson algorithm on a case study of the dissertation scheduling problem
title_sort	ford fulkerson algorithm on a case study of the dissertation scheduling problem
granting_institution	Universiti Teknologi Malaysia, Faculty of Science
granting_department	Faculty of Science
publishDate	2013
url	http://eprints.utm.my/id/eprint/33176/1/RajaNadiahBintiRajaMohdNazirMFS2013.pdf
_version_	1747816097937096704

The ford fulkerson algorithm on a case study of the dissertation scheduling problem

Similar Items