Algorithm based on Hungarian Method for Final Exam Scheduling

Erdős, Szilvia [Erdős, Szilvia (informatika), szerző] Automatizálási és Alkalmazott Informatikai Tanszék (BME / VIK); 3in-BME Balatonfüredi Hallgatói Kutatócsoport (BME / VIK / EIT)

Angol nyelvű Tudományos Konferenciaközlemény (Könyvrészlet)
    • MTMT: 31361697
      The automatic generation of schedules has been in focus of researches for decades. Since small changes in the input have exponential impact on the tested state space, methods based on heuristics and artificial intelligence are the most successful. Final exam scheduling is a special subtask of the generation of schedules, where special requirements restrict the state space. The problem is examined with Hungarian method approach. A score system is elaborated, wherewith the goodness of the generated schedules is measurable and comparable. The algorithm is tested on a real test set, which contained the registration of 100 students on the finals of bachelor’s degree. The results show that for this complexity there is an acceptable solution, and with some improvements on the algorithm there can be solutions, which are better and fairer, than the manually compiled schedules.
      Hivatkozás stílusok: IEEEACMAPAChicagoHarvardCSLMásolásNyomtatás
      2021-10-20 19:11