| Summary: | 碩士 === 中原大學 === 工業與系統工程研究所 === 99 === University schedule arrangement for each semester is a routine operation. It is a quite time-consuming operation and also a very complex scheduling problem called a NP-complete (Non-deterministic Polynomial Time) problem.
In this study, we developed an integer programming model, and used Department of Industrial and Systems Engineering, Chung Yuan Christian University, as an example. The purpose is to arrange all the courses to time. Our objective is to maximize the quantity of courses that could arrange the teachers’ preference time, and satisfy every restricted condition. In this model, there are two types of constraints: hard constraint and soft constraint. The hard constraints must be satisfied without any violations, and the soft constrains are satisfied as far as possible. Finally, we solved the model by software ILOG OPL in feasible time. The effective time to complete the course arrangement and the discharge of the curriculum are in compliance with department regulations.
|
|---|
