An Efficient Heuristic Based University Timetabling/ Scheduling
the University Timetabling problem for a multicampus university is a challenging proposition especially where the faculty is a shared resource amongst campuses. To cater to this problem, a hierarchical heuristic solution is proposed. The heuristic solution is based on the concept of a timeslot that uses the principle of ‘correctness by design’. The constraints are handled by administrative processes at various levels of the hierarchy. A web based Java application facilitates concurrent use by multiple users across campuses and generates the timetable in constant time. Ways to handle the constraints and related sub-constraints, with ease, are discussed.
Aparna Rajesh M.V. Padmini K. Athre
University of Trinidad and Tobago, O’Meara, Trinidad
国际会议
2009 IEEE International Conference on Grey System and Intelligent Services(2009 IEEE灰色系统与服务科学国际会议)
南京
英文
1749-1754
2009-10-20(万方平台首次上网日期,不代表论文的发表时间)