UB ScholarWorks

Course Scheduler: An Automated Schedule Generator

Show simple item record

dc.contributor.advisor Sobh, Tarek M. en_US
dc.contributor.author Sobh, Tarek M. en_US
dc.contributor.author Cousens, Rik en_US
dc.contributor.author Patel, Sarosh en_US
dc.date.accessioned 2014-07-16T16:35:46Z
dc.date.available 2014-07-16T16:35:46Z
dc.date.issued 2007-03-01 en_US
dc.identifier.citation T. M. Sobh, R. Counsens, S. Patel, "Course Scheduler: An Automated Schedule Generator," Advances in Computer Science and Engineering, vol. 1, no. 1, Mar. 2007.
dc.identifier.other b2065251-dd24-43e9-b7eb-515df9ce647b en_US
dc.identifier.uri https://scholarworks.bridgeport.edu/xmlui/handle/123456789/480
dc.description A typical problem in a college of engineering is trying to find the best set of courses to offer students in a given semester, taking into consideration which courses are needed by students, and the availability of instructors capable of teaching those classes. The optimal solution, of course, is to offer all courses that will allow all students to graduate in the minimum number of semesters. This allows students to finish their coursework quickly so that they can enter the work force. The job of determining which courses to schedule (usually done by a department chairperson) requires information about what the student-body needs and information about instructor availability/capability. The most difficult part of this process is to determine which instructors should teach which courses, and in which time-slots they should teach them, and still be able to satisfy all of the students. Selection of instructors is determined by the fact that an instructor knows the course material and that he/she is available to teach a given course. Instructors may have preferences as to what time of day to teach, or on which days of the week they would like to instruct the courses for which they are responsible. Instructors may not be available if they are already teaching too many courses, as defined by the individual learning-institution. There are several difficulties in determining when to offer a given course. For example, consider an engineering major senior who has taken almost all of the courses required to satisfy the requirements for his/her degree. Because he/she has nearly satisfied the degree-requirement, the student has a limited choice of courses to study. This is a problem for the department chairperson, since they must offer appropriate courses to the student to ensure he/she will have enough credits to graduate. This document will present a set of algorithms and software components which will aid a department chairperson in the scheduling process. en_US
dc.publisher Pushpa Publishing House en_US
dc.subject Optimization en_US
dc.subject Scheduling en_US
dc.subject Automated schedule generation en_US
dc.subject Accreditation en_US
dc.subject Course scheduling en_US
dc.subject Eating disorders en_US
dc.subject Obesity en_US
dc.title Course Scheduler: An Automated Schedule Generator en_US
dc.type Article en_US
dc.publication.issue 1 en_US
dc.publication.name Advances in Computer Science and Engineering en_US
dc.publication.volume 1 en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ScholarWorks

Advanced Search


My Account