한국경영과학회지 (Journal of the Korean Operations Research and Management Science Society)
- 제15권2호
- /
- Pages.17-31
- /
- 1990
- /
- 1225-1119(pISSN)
- /
- 2733-4759(eISSN)
학위논문 심사스케쥴링에 관한 연구
A Thesis Committee Scheduling
초록
This problem analyzed in this paper is to specify a schedule for thesis committee allowing maximum committee members' preference over thesis topics and meeting time-slots while satisfying other related scheduling requirements such as prohibiting simultaneous assignment of a committee member to more than one committee at a time. Two mathematical programming applroaches are presented to solve the thesis committee scheduling problem in a professional graduate school. They include LP-based branch-and-bound approach with network subproblems. Characterization of the problem is analyzed to develop an efficient solution algorithm. Implementation and computational experiments are also performed for real size problems on an IBM PC/AT to show the relative performance of the propsoed approaches along with an ordinary ILP solution approach.
키워드