Efficiency and accuracy of scheduling algorithms for final year project evaluation management system

Scheduling algorithms play a crucial role in optimizing the efficiency and precision of scheduling tasks, finding applications across various domains to enhance work productivity, reduce costs, and save time. This research paper conducts a comparative analysis of three algorithms: genetic algorithm,...

Full description

Saved in:
Bibliographic Details
Main Authors: Loo, Chang Herng, Muhammad Zulfahmi Toh, Abdullah, Ahmad Fakhri, Ab. Nasir, Nur Shazwani, Kamaruddin, Nur Hafieza, Ismail
Format: Article
Language:English
Published: Penerbit UMP 2023
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/40076/1/Efficiency%20and%20Accuracy%20of%20Scheduling%20Algorithms%20for%20Final%20Year%20Project.pdf
http://umpir.ump.edu.my/id/eprint/40076/
https://doi.org/10.15282/mekatronika.v5i2.9973
https://doi.org/10.15282/mekatronika.v5i2.9973
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Scheduling algorithms play a crucial role in optimizing the efficiency and precision of scheduling tasks, finding applications across various domains to enhance work productivity, reduce costs, and save time. This research paper conducts a comparative analysis of three algorithms: genetic algorithm, hill climbing algorithm, and particle swarm optimization algorithm, with a focus on evaluating their performance in scheduling presentations. The primary goal of this study is to assess the effectiveness of these algorithms and identify the most efficient one for handling presentation scheduling tasks, thereby minimizing the system's response time for generating schedules. The research takes into account various constraints, including evaluator availability, student and evaluator affiliations within research groups, and student-evaluator relationships where a student cannot be supervised by one of the evaluators. Considering these critical parameters and constraints, the algorithm assigns presentation slots, venues, and two evaluators to each student without encountering scheduling conflicts, ultimately producing a schedule based on the allocated slots for both students and evaluators.