Work2005

Final Exam Scheduler - FES

32 citations0/0 files storedIEEE Congress on Evolutionary Computation (CEC)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Scheduling and Timetabling Solutions Metaheuristic Optimization Algorithms Research Constraint Satisfaction and Optimization

Abstract

Timetabling problems are constraint optimization problems proven to be NP-complete. Furthermore, evaluation of violations is costly, and there is no common data format for representing timetabling problem instances. In this paper, a framework for designing memetic algorithms (MAs) to solve timetabling problems is described and a tool, named final exam scheduler (FES) is introduced. FES is the first tool that accepts timetabling markup language (TTML) documents as input. It utilizes an MA with an adaptive violation directed hierarchical hill climbing method for solving examination timetabling problem instances. Experimental results on a set of benchmark data indicate the success of MA.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 32 citations exist upstream.

References

2004The State of the Art of Nurse Rostering 1999A Survey of Automated Timetabling 1985An introduction to timetabling 1996Examination Timetabling: Algorithmic Strategies and Applications 1996A memetic algorithm for university exam timetabling 2003A Hybrid Algorithm for the Examination Timetabling Problem 2001Tabu Search Techniques for Examination Timetabling 2004Solving Examination Timetabling Problems through Adaption of Heuristic Orderings

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.