메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

논문 기본 정보

저자정보
(부산대학교) (부산대학교) (부산대학교) (부산대학교) (부산대학교) (부산대학교)
저널정보
대한산업공학회 대한산업공학회지 대한산업공학회지 제51권 제4호
오류 신고하기

피인용 0

검색

    초록·키워드

    This study proposes a constraint programming (CP) model to generate personalized course timetables for university students, addressing the limitations of existing university course timetabling problems (UCTP). The proposed model incorporates both hard constraints and student preferences including inter-building transition times and course ratings, to optimize timetable combinations. In this paper, we demonstrate the effectiveness of the model in successfully generating multiple high-quality timetabling solutions using curriculum data from an actual university. A sensitivity analysis reveals that the CP model consistently outperforms traditional Mixed Integer Linear Programming (MIP) and metaheuristic models in terms of solution quality and computational efficiency. The proposed model achieves search times 1.5-4 times faster than existing methods while maintaining solution diversity. The model's declarative constraint handling and efficient search capabilities make it particularly suitable for online service implementation. This research contributes to the academic literature by introducing a novel CP-based approach to optimize students’ timetables, and demonstrates its practical applicability to improve students’ academic planning and satisfaction.

    최근 본 자료 전체보기

      UCI(KEPA) : I410-151-25-02-093856788