Hyper-Heuristics for Scheduling Problems

Funded Research Project (TÜBİTAK)
Year: 2005-2006 Project Team: Emin Erkan Korkmaz (ekorkmaz [at] cse.yeditepe.edu.tr), Ender Özcan, Özgür Ülker, Burak Bilgin.  

Timetabling problems are constraint optimization problems proven to be NP complete. Researchers have mainly concentrated on the areas of university highschool course timetabling, examination timetabling and employee scheduling problems, such as, nurse rostering in health care instituitons. In this project, hyper-heuristic methods are used to tacle with various types of timetabling and scheduling problems.

Permanent link to this article: http://cse.yeditepe.edu.tr/en/research/projects/funded-research-projects/hyper-heuristics-for-scheduling-problems/