Article2004

Combining Constraint Programming and Simulated Annealing on University Exam Timetabling.

51 citations0/0 files stored

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 Healthcare Operations and Scheduling Optimization Constraint Satisfaction and Optimization

Abstract

In this paper, we present a solution method for examination timetabling, consisting of two phases: a constraint programming phase to provide an initial solution and a simulated annealing phase with Kempe chain neighborhood. The second phase is equipped with some refined mechanisms that help to determine crucial cooling schedule parameters. We perform preliminary experiments of the algorithm on real data sets.

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 — 51 citations exist upstream.

References

1991Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms 2004A time-predefined local search approach to exam timetabling problems 2003A Hybrid Algorithm for the Examination Timetabling Problem 1996Recent developments in practical examination timetabling 2001Tabu Search Techniques for Examination Timetabling 1995A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems 1994Fast practical evolutionary timetabling 1996Constraint logic programming for examination timetabling

Cited by

2010Fuzzy Genetic Heuristic for University Course Timetable Problem 2013A hybrid self-adaptive bees algorithm for examination timetabling problems

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.