A constraint-based approach for examination timetabling using local repair techniques

David, P.

doi:10.1007/bfb0055888

Cited by 18 publications

(14 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In conclusion, a number of solution approaches originating from various disciplines have been proposed and satisfactory results were reported with various metaheuristics (Ersoy et al 2007), constraint based methods (David 1998), hyper heuristics (Kendall and Hussin 2005;Pillay and Banzhaf 2008), hybrid methods ) and others. A critical point that makes comparison of these approaches difficult stems from individual problem definition, as each institutional ETP is usually unique due to rules, regulations and quality factors incorporated.…”

Section: Introductionmentioning

confidence: 86%

An improved multi-staged algorithmic process for the solution of the examination timetabling problem

2010

View full text Add to dashboard Cite

The 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 (http://www.cs.qub.ac.uk/itc2007/) 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.

show abstract

Section: Introductionmentioning

confidence: 86%

An improved multi-staged algorithmic process for the solution of the examination timetabling problem

2010

View full text Add to dashboard Cite

show abstract

“…Indeed, these hybridisations are currently the most effective approaches on the standard Toronto benchmarks. This includes the effective integration of early timetabling techniques such as graph heuristics Burke et al 2005 and constraint-based techniques (Merlot et al 2003;David 1998;Duong and Lam 2004).…”

Section: The Examination Timetabling Problem: Algorithmsmentioning

confidence: 99%

A new model for automated examination timetabling

et al. 2011

View full text Add to dashboard Cite

Automated examination timetabling has been addressed by a wide variety of methodologies and techniques over the last ten years or so. Many of the methods in this broad range of approaches have been evaluated on a collection of benchmark instances provided at the University of Toronto in 1996. Whilst the existence of these datasets has provided an invaluable resource for research into examination timetabling, the instances have significant limitations in terms of their relevance to real-world examination timetabling in modern universities. This paper presents a detailed model which draws upon experiences of implementing examination timetabling systems in universities in Europe, Australasia and America. This model represents the problem that was presented in the 2nd International Timetabling Competition (ITC2007). In presenting this detailed new model, this paper describes the examination timetabling track introduced as part of the competition. In addition to the model, the datasets used in the competition are also based on current real-world instances introduced by EventMAP Limited. It is hoped that the interest generated as part of the competition will lead to the development, investigation and application of a host of novel and exciting techniques to address this important real-world search domain. Moreover, the motivating goal of this paper is to close the currently existing gap between theory and practice in examination timetabling by presenting the research community with a rigorous model which represents the complexity of the real-world situation. In this paper we describe the model and its motivations, followed by a full formal definition

show abstract

“…Dieser prüfungsrechtliche Gleichbehandlungsgrundsatz "gebietet, dass für vergleichbare Prüflinge soweit wie möglich vergleichbare Prüfungsbedingungen und Be wertungskriterien gelten". 10 Universitäre Prüfungsämter sind als Organe der Selbstverwaltungskörperschaft Uni versität und damit der vollziehenden Gewalt nach Art. 1 Abs.…”

Section: Problemstellungunclassified

“…Zur Erstellung eines mündlichen Prüfungsplanes am Prüfungsamt der WiSoFakultät werden die angegebenen Aktivitäten in der folgenden Reihenfolge bearbeitet: (1) Anmeldungen der Prüflinge bearbeiten, (2) Eingabe der Prüfungsdaten in den PC, (3) Erstellen der Teilnehmerlisten, (4) Zuordnung der Prüfer zu den Prüflingen, (5) Erfassen der Terminwünsche der Prüfer, (6) Zuordnung der Prüflinge zu den Prüfungstagen, (7) Zuordnung der Prüflinge zu den Prüfungszeiten und Festlegen der Termine der Prüfer, (8) Bekanntgabe des vorläufigen Planes bei den Prüfern, (9) Zuordnung der Räume, (10) 48 Letztere können beispielsweise das wiederholte Durchlaufen einzelner Phasen vorsehen. 49 Einen Überblick zur Evolution des Wasserfall-Modells liefert Chroust (1992).…”

Section: Problemstellungunclassified

Ein Decision Support System zur universitären Prüfungsplanung

Juretzka

Drexl

Schüphaus

2003

Hochschulmanagement

View full text Add to dashboard Cite

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte.

show abstract

A constraint-based approach for examination timetabling using local repair techniques

Cited by 18 publications

References 6 publications

An improved multi-staged algorithmic process for the solution of the examination timetabling problem

An improved multi-staged algorithmic process for the solution of the examination timetabling problem

A new model for automated examination timetabling

Ein Decision Support System zur universitären Prüfungsplanung

Contact Info

Product

Resources

About