Students in cyber universities can take every course because there are no physical constraints such as class rooms. On the other hand, cyber universities should take a heavy burden to schedule real-time exams in a designated time period. Any two courses a student takes must not be simultaneously allocated to a time slot in such a schedule. It is well known that the complexity of this kind of scheduling problem increases exponentially as the number of courses does. This research provides a heuristic method to make on-line real-time exam timetables with minimal exam time span. It considers the constraint of not allocating courses a student takes to simultaneous exam time and prioritizes courses by the number of students.
목차
Abstract 1. 서론 2. 관련 연구 3. 모델링 3.1 문제 개요 3.2 중복수강과 Adjacency Matrix 3.3 Adjacency Matrix의 그래프 표현 3.4 동일 타임슬럿에 배정 가능한 과목 집합 3.5 전체 타임슬럿의 최소화를 위한 시간 배정 4. 발견적 기법(Heuristic Approach) 4.1 타임슬럿의 배정 4.2 동시시험 가능 과목들의 동일 타임슬럿 배정 4.3 노드 인덱스 결정 규칙 5. 실험과 결과 6. 결론 및 추후연구 참고문헌
키워드
On-line Real Time Exam TimetableNP HardHeuristic Algorithm
저자
박찬권 [ Chankwon Park | 한양사이버대학교 경영학부 교수 ]
주저자, 교신저자