Abstract
Scheduling lectures is tedious and frustrating work, and the problem of applying computers to this task is currently being investigated in many countries. Several of the published reports discuss theoretical solutions only (Gotlieb, 1963; Csima and Gotlieb, 1963; Sherman 1963). Other authors have achieved some practical success in constructing school or University class timetables (Appleby, Blake and Newman, 1961) in preparing examination tables (Broder, 1964; Cole, 1964) and in assigning students to sections of a class according to a previously prepared timetable (Bossert and Harmon, 1963). This paper describes algorithms for a heuristic approach starting with a blank timetable and making class-lecturer assignments so as to satisfy complex conditions. Two problems have been considered:
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
