dc.contributor.author |
Alzaeem, Mohammad Alqasim Bassam, |
dc.date.accessioned |
2017-08-30T14:28:49Z |
dc.date.available |
2017-08-30T14:28:49Z |
dc.date.issued |
2016 |
dc.date.submitted |
2016 |
dc.identifier.other |
b19012949 |
dc.identifier.uri |
http://hdl.handle.net/10938/11137 |
dc.description |
Thesis. M.E.M. American University of Beirut. Department of Industrial Engineering and Management, 2016. ET:6484 |
dc.description |
Advisor : Dr. Bacel Maddah, Associate Professor, Industrial Engineering and Management ; Committee members : Dr. Moueen Salameh, Professor, Industrial Engineering and Management ; Dr. Hussein Tarhini, Assistant Professor, Industrial Engineering and Management. |
dc.description |
Includes bibliographical references (leaves 51-53) |
dc.description.abstract |
This thesis aims to provide an effective method that helps university students in registering several classes having multiple sections each. With many classes to register (reaching 6 or 7 classes) and several sections per class (reaching 8 or 9 sections) this becomes a scheduling problem that is tedious to solve. The difficulty stems from finding available options (schedules) that comply to a mixture of hard constraints imposed by the university and soft constraints related to student’s preferences. This thesis describes the design and implementation of a constraint-based personal student course scheduler that utilizes graph theory. A special graph is constructed which consists of special vertices (referred to as super nodes) that represent the courses offered by the university. Each super node has sub-nodes representing sections of the class. The connectivity is defined among super nodes. Two super nodes are connected by an arc if they have no time conflict. Sub-nodes (sections) that belong to connected super-nodes can be part of the student schedule. This graph theory methodology allows generating all possible schedules for a student accounting for various constraints. We apply our method to generate student course schedules based on the course offerings of the American University of Beirut (AUB). This is developed using a user-friendly PHP application which runs online, and can be easily connected to a university student information system. |
dc.format.extent |
1 online resource (xii, 53 leaves) : illustrations |
dc.language.iso |
eng |
dc.relation.ispartof |
Theses, Dissertations, and Projects |
dc.subject.classification |
ET:006484 |
dc.subject.lcsh |
American University of Beirut -- Students -- Case studies. |
dc.subject.lcsh |
Graph theory. |
dc.subject.lcsh |
Algorithms. |
dc.subject.lcsh |
Scheduling -- Lebanon -- Beirut. |
dc.subject.lcsh |
Constraint databases. |
dc.title |
Generating feasible university student schedules via graph theory concepts - |
dc.type |
Thesis |
dc.contributor.department |
Faculty of Engineering and Architecture. |
dc.contributor.department |
Department of Industrial Engineering and Management, |
dc.contributor.institution |
American University of Beirut. |