Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.authorΓκόγκος, Χρήστοςel_GR
dc.contributor.authorΑλεφραγκής, Παναγιώτηςel_GR
dc.contributor.authorΧούσος, Ευθύμιοςel_GR
dc.identifier.issn0254-5330 (Print)-
dc.identifier.issn1572-9338 (Online)-
dc.description.abstractThe efficient creation of examination timetables is a recurring and important problem for universities worldwide. Good timetables typically are characterized by balanced distances between consecutive exams for all students. In this contribution an approach for the examination timetabling problem as defined in the second International Timetabling Competition ( is presented. The solution approach is managed on the top level by GRASP (Greedy Randomized Adaptive Search Procedure) and it involves several optimization algorithms, heuristics and metaheuristics. A construction phase is executed first producing a relatively high quality feasible solution and an improvement phase follows that further ameliorates the produced timetable. Each phase consists of stages that are consumed in a circular fashion. The procedure produces feasible solutions for each dataset provided under the runtime limit imposed by the rules of the ITC07 competition. Results are presented and analyzed.el_GR
dc.format.extentσελ. 203-221el_GR
dc.subjectScheduling--Computer programsel_GR
dc.titleAn improved multi-staged algorithmic process for the solution of the examination timetabling problemel_GR
dc.subject.keywordSimulated annealingel_GR
dc.subject.keywordKempe chainsel_GR
dc.subject.keywordInteger programmingel_GR
dc.relation.journalAnnals of Operations Research;Vol. 194, Iss. 1-
item.fulltextΧωρίς πλήρες κείμενο-
Appears in Collections:Δημοσιεύσεις σε Περιοδικά
Show simple item record

Google ScholarTM



Items in CRIS are protected by copyright, with all rights reserved, unless otherwise indicated.