An Heuristic Model for Optimizing Examination Schedules Which Have Day and Evening Courses.

White, George M.; Haddad, Michel

Notes FAQ Contact Us

Peer reviewed

ERIC Number: EJ293547

Record Type: Journal

Publication Date: 1983

Pages: N/A

Abstractor: N/A

ISBN: N/A

ISSN: N/A

EISSN: N/A

Available Date: N/A

An Heuristic Model for Optimizing Examination Schedules Which Have Day and Evening Courses.

White, George M.; Haddad, Michel

Computers and Education, v7 n4 p235-38 1983

Describes an algorithm used at the University of Ottawa to create examination schedules that are not only conflict free and minimize number of consecutive examinations for individual students, but provide for the scheduling of certain proper subsets of examinations into proper time slots and minimal overall number of consecutive examinations. (MBR)

Descriptors: Algorithms, Day Students, Evening Students, Higher Education, Models, Scheduling, Tests, Time Perspective

Publication Type: Reports - Descriptive; Journal Articles

Education Level: N/A

Audience: N/A

Language: English

Sponsor: N/A

Authoring Institution: N/A

Grant or Contract Numbers: N/A

Author Affiliations: N/A