Efficiency and Accuracy of Scheduling Algorithms for Final Year Project Evaluation Management System
Keywords:Scheduling Algorithm, Genetic Algorithm, Hill Climbing Algorithm, PSO Algorithm
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.
How to Cite
Copyright (c) 2023 Universiti Malaysia Pahang Publishing
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.