Scheduling tasks persist in our daily functioning and as academia, abounds more in University circle as hard-NP constraint satisfaction tasks. Many studies exist with the objective of resolving the many conflicted constraints that exists in a timetable schedule using various algorithms. Many of such algorithms simply search the domain space for a goal state that satisfies the problem constraints. Our study yields an outcome assignment that provides a complete, feasible and optimal academic schedule that satisfies medium cum hard constraints for the Federal University of Petroleum Resource Effurun in Delta State of Nigeria using memetic algorithm. Results showed that model converges after 4minutes and 29seconds; while its convergence time depends on use of belief space to ensure agents do not violate model bounds, encoding scheme used amongst others. The schedule considers both instructors and students' preference as medium constraints of high priority.
展开▼
