DocumentCode
2448111
Title
Research on solution to course scheduling problems based on a hierarchical planning strategy
Author
Chen, Shifeng ; Zhang, Dezhen
Author_Institution
Sch. of Inf. Eng., Dalian Univ., Dalian, China
fYear
2011
fDate
14-16 Oct. 2011
Firstpage
263
Lastpage
267
Abstract
Course scheduling is a typical combinatorial optimization problem. One of the most important tasks of course scheduling is considering multiple constraints, such as conflict in teaching hours, meeting instructor preferences, and the continuity of teaching hours, etc. In this study, a hierarchical planning strategy in operations research is applied to an automatic course scheduling system to produce course timetables, of which the procedure is divided into three steps. Firstly, bind the elements that have mapping relationship and take into account the students´ and instructors´ conflict for a selected course. Secondly, classroom conflict and taboos are considered for a certain room. Finally, generate course arrangement records based on the result of the first two steps. It is shown in the experimental result that the automatic course scheduling system proposed in this paper not only enhances the course scheduling efficiency, but also increases students´ and instructors´ satisfaction.
Keywords
combinatorial mathematics; educational courses; optimisation; scheduling; teaching; automatic course scheduling system; combinatorial problem; hierarchical planning; instructor satisfaction; optimization; teaching; Algorithm design and analysis; Educational institutions; Laboratories; Planning; Processor scheduling; Scheduling; Automatic course scheduling system; Bind; Hierarchical planning; Mapping relationship; Multiple constraints;
fLanguage
English
Publisher
ieee
Conference_Titel
Soft Computing and Pattern Recognition (SoCPaR), 2011 International Conference of
Conference_Location
Dalian
Print_ISBN
978-1-4577-1195-4
Type
conf
DOI
10.1109/SoCPaR.2011.6089118
Filename
6089118
Link To Document