Abstract
Exam timetabling is a computationally intractable problem, which requires heuristic techniques for producing good sub-optimal solutions within reasonable execution time. For large numbers of exams and students, sequential algorithms are likely to be time consuming. The purpose of this work is to present a parallel metaheuristic algorithm for producing good sub-optimal exam timetables in a reasonable time. Empirical results show that our proposed parallel scatter search algorithm yields good speedup. Also, they show that the parallel algorithm improves solution quality in comparison with the sequential algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.