Course allocation using dynamic programming / Nor Farisha Nazihah Mohamed Sani, Nurfatin Syahirah Ros@Rostam and Nursyahirah Azmi

Course allocation is one important aspects of teaching process. In the most teaching units, the task for allocating teaching is generally done by manually. Hence, it consumes a lot of time and inaccurate number of courses given for the lecturer. Due to these problems arising from course allocation i...

Full description

Saved in:
Bibliographic Details
Main Authors: Mohamed Sani, Nor Farisha Nazihah, Ros@Rostam, Nurfatin Syahirah, Azmi, Nursyahirah
Format: Student Project
Language:English
Published: 2019
Subjects:
Online Access:http://ir.uitm.edu.my/id/eprint/39392/1/39392.pdf
http://ir.uitm.edu.my/id/eprint/39392/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Course allocation is one important aspects of teaching process. In the most teaching units, the task for allocating teaching is generally done by manually. Hence, it consumes a lot of time and inaccurate number of courses given for the lecturer. Due to these problems arising from course allocation in a university, it effects the lecturers where many lecturers carried excess work load while others carried less. Hence, a study on course allocation was conducted to solve course allocation problem. Therefore, the objectives of this study are to analyse course allocation of lecturers according to the position and to formulate Dynamic Programming model for course allocation that maximize the number of contact hours of lecturers. A Dynamic Programming model was developed for allocating contact hours among lecturers which subject to considered constraints. In Dynamic Programming, there will be several state for each stage. This study used forward Dynamic Programming which has five stages and 33 states. The problem is solved recursively where the solution from previous stage will be used in the next stage. Hence, the result of this study indicated that all contact hours of lecturers in each level of courses is maximized.