Skip to Main Content
Many factor affected schedule arrangement. The factors made the problem more complicated. This research purposed to analyze and to implement problem solving of course scheduling in university. The problem was modeled using graph coloring technique and bee colony algorithm was used as coloring algorithm. First, the course scheduling problem in university was described. Some of solution precondition that might be fulfilled (hard constraint) and not to be fulfilled (soft constraint) would be determined. Next, reconstruction of conflict course graph was done. The reconstruction process was done together with room assembly process. Hence, the graph that was formed has included room candidates. The research also gave lecturer problem solving with priority as a soft constraint parameter. From testing result, this technique succeed to obtain the proper solution with course percentage that could be assembled at time slot up to 100% and violation to lecturer priority is 5.83% for 206 course data, and the amount of lecturer that had priority status is 30% from 89 lecturers. Comparison was done to previous research and conventional technique; this technique gave ability to solution placement at time slot that much better.