Browse > Article

A Template-based Interactive University Timetabling Support System  

Chang, Yong-Sik (Department of e-Business, Hanshin University)
Jeong, Ye-Won (Department of e-Business, Hanshin University)
Publication Information
Journal of Intelligence and Information Systems / v.16, no.3, 2010 , pp. 121-145 More about this Journal
Abstract
University timetabling depending on the educational environments of universities is an NP-hard problem that the amount of computation required to find solutions increases exponentially with the problem size. For many years, there have been lots of studies on university timetabling from the necessity of automatic timetable generation for students' convenience and effective lesson, and for the effective allocation of subjects, lecturers, and classrooms. Timetables are classified into a course timetable and an examination timetable. This study focuses on the former. In general, a course timetable for liberal arts is scheduled by the office of academic affairs and a course timetable for major subjects is scheduled by each department of a university. We found several problems from the analysis of current course timetabling in departments. First, it is time-consuming and inefficient for each department to do the routine and repetitive timetabling work manually. Second, many classes are concentrated into several time slots in a timetable. This tendency decreases the effectiveness of students' classes. Third, several major subjects might overlap some required subjects in liberal arts at the same time slots in the timetable. In this case, it is required that students should choose only one from the overlapped subjects. Fourth, many subjects are lectured by same lecturers every year and most of lecturers prefer the same time slots for the subjects compared with last year. This means that it will be helpful if departments reuse the previous timetables. To solve such problems and support the effective course timetabling in each department, this study proposes a university timetabling support system based on two phases. In the first phase, each department generates a timetable template from the most similar timetable case, which is based on case-based reasoning. In the second phase, the department schedules a timetable with the help of interactive user interface under the timetabling criteria, which is based on rule-based approach. This study provides the illustrations of Hanshin University. We classified timetabling criteria into intrinsic and extrinsic criteria. In intrinsic criteria, there are three criteria related to lecturer, class, and classroom which are all hard constraints. In extrinsic criteria, there are four criteria related to 'the numbers of lesson hours' by the lecturer, 'prohibition of lecture allocation to specific day-hours' for committee members, 'the number of subjects in the same day-hour,' and 'the use of common classrooms.' In 'the numbers of lesson hours' by the lecturer, there are three kinds of criteria : 'minimum number of lesson hours per week,' 'maximum number of lesson hours per week,' 'maximum number of lesson hours per day.' Extrinsic criteria are also all hard constraints except for 'minimum number of lesson hours per week' considered as a soft constraint. In addition, we proposed two indices for measuring similarities between subjects of current semester and subjects of the previous timetables, and for evaluating distribution degrees of a scheduled timetable. Similarity is measured by comparison of two attributes-subject name and its lecturer-between current semester and a previous semester. The index of distribution degree, based on information entropy, indicates a distribution of subjects in the timetable. To show this study's viability, we implemented a prototype system and performed experiments with the real data of Hanshin University. Average similarity from the most similar cases of all departments was estimated as 41.72%. It means that a timetable template generated from the most similar case will be helpful. Through sensitivity analysis, the result shows that distribution degree will increase if we set 'the number of subjects in the same day-hour' to more than 90%.
Keywords
Timetable; Case; Rule; Entropy;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Thompson, G. M., "Using information on unconstrained student demand to improve university course schedules", Journal of Operations Management, Vol.23, No.2(2005), 197-208.   DOI   ScienceOn
2 Wren, A., "Scheduling, Timetabling and Rostering- A Special Relationship?" In:Burke, E., Ross, P. (Eds), Practice and Theory of Automated Timetabling, 1995, Springer Lecture Notes in Computer Science Series, Springer, Berlin, Vol.1153(1996), 46-75.
3 Selim, S. M., "An algorithm for constructing a university faculty timetable", Computers and Education, Vol.6, No.4(1982), 323-332.   DOI   ScienceOn
4 Shannon, C. E., "A Mathematical Theory of Communication", The Bell System Technical Journal, Vol.27(1948), 623-656.   DOI
5 Burke, E. K., D. G. Elliman, and R. Weare, "A University Timetabling System based on Graph Colouring and Constraint Manipulation", Journal of Research on Computing in Education, Vol.27, No.1(1994), 1-18.   DOI
6 Pongcharoen, P., W. Promtet, P. Yenradee, and C. Hicks, "Stochastic Optimisation Timetabling Tool for university course scheduling", International Journal of Production Economics, Vol.112, No.2(2008), 903-918.   DOI   ScienceOn
7 Santiago-Mozos, R., S. Salcedo-Sanz, and M. DePrado-Cumplido, "Carlos Bouso no-Calz1onA two-phase heuristic evolutionary algorithm for personalizing course timetables :a case study in a Spanish university", Computers and Operations Research, Vol.32, No.7(2005), 1761-1776.   DOI   ScienceOn
8 Loo, E. H., T. N. Goh, and H. L. Ong, "A heuristic approach to scheduling university timetables", Computers and Education, Vol.10, No.3(1986), 379-388.   DOI   ScienceOn
9 Kang, L., G. H. von Schoenberg, and G. M. White, "Complete university timetabling using logic", Computers and Education, Vol.17, No.2(1991), 145-153.   DOI   ScienceOn
10 Fahrion, R. and G. Dollansky, "Construction of university faculty timetables using logic programming techniques", Discrete Applied Mathematics, Vol.35, No.3(1992), 221-236.   DOI   ScienceOn
11 Daskalaki, S., T. Birbas, and E. Housos, "An integer programming formulation for a case study in university timetabling", European Journal of Operational Research, Vol.153, No.1(2004), 117-135.   DOI   ScienceOn
12 이호종, 전건욱 "발견적 알고리즘을 이용한 강의 시간표 작성에 관한 연구", 한국국방경영분석 학회 학술대회논문집, 20권(2004), 104-137.
13 김대진, 김철현, "벌칙 함수에 기반한 유전 알고리즘을 사용한 강의 시간표의 자동 작성", 정보과학학회논문지, 2권 3호(1996), 317-325.
14 박유석, 김병재, "병렬 모집단 진화프로그램을 이용한 강의시간표", 공업경영학회지, 22권 52호(1999), 275-284.
15 Burke, E., K. Jackson, J. H. Kingston, and R. Weare, "Automated university timetabling: the state of the art", The Computer journal, Vol.40, No.9(1997), 565-571.   DOI   ScienceOn
16 Bardadym, V. A., "Computer-aided school and university Timetable:The new wave", In: Burke, E., Ross, P. (Eds), Practice and Theory of Automated Timetabling, 1995, Springer Lecture Notes in Computer Science Series, Springer, Berlin, Vol.1153(1996), 22-45.
17 신영수, "PC를 이용한 대학강의 시간표 작성에 관한 연구", 경영학연구, 17권 1호(1987), 125-140.
18 Deris, S., S. Omatu, H. Ohta, and P. Saad, "Incorporating constraint propagation in genetic algorithm for university timetable planning", Engineering Applications of Artificial Intelligence, Vol.12, No.3(1999), 241-253.   DOI   ScienceOn
19 윤상진, 전광진, "SCOT(Software for College Timetable) 소프트웨어의 개발 및 운용에 관한 연구", 경영교육논총, 14권(1997), 313-354
20 Dimopoulou, M. and P. Miliotis, "An automated university course timetabling system developed in a distributed environment:A case study", European Journal of Operational Research, Vol.153, No.1(2004), 136-147.   DOI   ScienceOn
21 Burke, E. K., J. Marecek, A. J. Parkes, and H. Rudova, "Decomposition, reformulation, and diving in university course timetabling", Computer and Operations Research, Vol.7 (2010), 582-597.
22 Chahal, N. and D. de Werra, "An interactive system for constructing timetables on a PC", European Journal of Operational Research, Vol.40, No.1(1989), 32-37   DOI   ScienceOn
23 Daskalaki, S. and T. Birbas , "Efficient solutions for a university timetabling problem through integer programming", European Journal of Operational Research, Vol.160, No.1(2005), 106-120.   DOI   ScienceOn
24 de Causmaecker, P., P. Demeester, and G. V. Berghe, "A decomposed metaheuristic approach for a real-world university timetabling timetabling problem", European Journal of Operational Research, Vol.195, No.1(2009), 30 7-318.   DOI   ScienceOn
25 Burke, E. K., B. L. MacCarthy, S. Petrovic, and R. Qu, "Multiple-Retrieval Case-Based Reasoning for Course Timetabling Problems", Journal of Operations Research Society, Vol.57, No.2(2006), 148-162.   DOI
26 Bruke, E. K. and S. Petrovic, "Recent research directions in automated timetabling", European Journal of Operationsl Research, Vol. 140, No.2(2002), 266-280.   DOI   ScienceOn
27 Burke, E. K., B. MacCarthy, S. Petrovic, and R. Qu, "Structured cases in case-based reasoning- reusing and adapting cases for timetabling problems", Knowledge-Based Systems, Vol.13(2000), 159-165.   DOI   ScienceOn
28 Kang, L. and G. M. White, "A logic approach to the resolution of constraints in timetabling", European Journal of Operational Research, Vol.61, No.3(1992), 306-317.   DOI   ScienceOn