![]() ![]() We used the concept of bin packing heuristics to assign examination to room with respect to the capacity. In this paper, graph coloring heuristics are employed to schedule examinations at each step during timetable construction. These constraints provide an additional challenge in solving the examination timetabling problem, mainly at UUM. Moreover, splitting examination across several rooms and a number of hard constraints such as no mixed duration of examination within individual periods, clashes free schedule and room capacity requirement are also need to be adhered. Besides, the introduced datasets also consider a new constraint that has never been modeled before in timetabling literature, which is lecturer's preference. The propriety system is unable to do the examination timetabling automatically. Until recently, examination timetabling in UUM is done manually with a little guidance from spreadsheet computer software for checking clashes. This dataset differs from the others reported in the literature with respect to its size, complexity and constraints. This paper presents a real-world, capacitated examination timetabling problem from Universiti Utara Malaysia (UUM), Malaysia. ![]() Examination timetabling is a well-studied combinatorial optimization problem involving scheduling a set of examinations into a restricted number of time-slots while satisfying a defined set of constraints. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |