In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of con-straints. They are NP-completeness problems, which usu-ally lead to satisfactory but suboptimal solutions. As PSO has many successful applications in continuous optimiza-tion problems, the main contribution of this paper is to uti-lize PSO to solve the discrete problem of timetable schedul-ing. Experimental results confirm that PSO can be utilized to solve discrete problem as well.
展开▼
