A Review of Distributed Multi-Agent Systems Approach toSolve University Course Timetabling Problem

Scheduling is one the problems on which so many researcheshave been done over years and university course timetablingproblem which is a NP-hard problem is a type of schedulingproblem. On the other hand, timetabling process must be donefor each semester frequently which is an exhausting and timeconsuming task. University course timetabling problem performsthe allocation of whole events to timeslots and rooms byconsidering the list of hard and soft constraints presented in onesemester, so that no conflict is created in such allocations. In thisproblem, the hard constraints should not be violation under anycondition, but soft constraints should not be violation as much aspossible. The aim of this paper is to analyze a new approach tosolve university course timetabling problem called an approachbased on multi agent systems (Cooperative Search) in addition tobriefly study approaches based on operational researches, metaheuristicmethods and intelligent novel methods.

کلیدواژه ها:

University Course TimeTabling Problem (UCTTP) ، Approach Based on Multi-Agent Systems (Cooperative Search) ، Operational Researches Methods ، and Meta-heuristic methods ، Intelligence novel methods