Assigning proctors to exams using scatter search. (c2006)

LAUR Repository

Show simple item record

dc.contributor.author Zeidan, Moujab Moustapha
dc.date.accessioned 2011-05-13T07:46:05Z
dc.date.available 2011-05-13T07:46:05Z
dc.date.copyright 2006 en_US
dc.date.issued 2011-05-13
dc.date.submitted 2006-06-27
dc.identifier.uri http://hdl.handle.net/10725/459
dc.description Includes bibliographical references (leaf 70). en_US
dc.description.abstract Scatter search is an evolutionary algorithm used to solve a multitude of real-life problems. It can be classified as a population-based methodology in the field of meta-heuristics. The main characteristic of scatter search is that it attempts to find improved solutions by combining others which are non-randomly generated. The scatter search methodology provides a general template consisting of five methods which can be fine-tuned to fit the specific problem under consideration. This flexibility has allowed the application of the scatter search to many combinatorial and optimization problems. One of the problems solved by the scatter search algorithm is the assignment of proctors to exams. This problem is encountered in every university at the time of final examinations when the scheduling of proctors is needed to oversee the students sitting for exams. This task has been reputed to be a very complex one because of the large number of exams and of the various constraints of this problem. Furthermore, when done manually, assigning proctors to exams is an extremely difficult and time consuming job for university staff responsible for this task and this entails that there is a need to automate the allocation of proctors to exams. The purpose of this project is to implement a computer-based decision support system that attempts to assign proctors to exams. The software was developed using Java, which is today's most advanced object-oriented language. The algorithm used is the scatter search methodology since it was found to provide good solutions for the problem under consideration. In addition, empirical results were obtained using real-life data and were found to give high-quality solutions that maximize the proctors' preferences while maintaining the fairness of the workload given to proctors. en_US
dc.language.iso en en_US
dc.subject Scattering (Mathematics) en_US
dc.subject Mathematical optimization en_US
dc.subject Evolutionary programming (Computer science) en_US
dc.title Assigning proctors to exams using scatter search. (c2006) en_US
dc.type Thesis en_US
dc.term.submitted Summer I en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.idnumber 198702220 en_US
dc.author.commembers Dr. Ibrahim Osman
dc.author.woa OA en_US
dc.description.physdesc 1 bound copy: xi, 70 leaves; ill.; 30 cm. available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Dr. Nashaat Mansour
dc.identifier.doi https://doi.org/10.26756/th.2006.20 en_US
dc.publisher.institution Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account