A time-predefined local search approach to exam timetabling problems

@inproceedings{Burke2001ATL,
  title={A time-predefined local search approach to exam timetabling problems},
  author={Edmund B. Burke and Yuri Bykov and James P. Newall and S. Petrovic},
  year={2001}
}
In recent years the computational power of computers has increased dramatically. This in turn has allowed search algorithms to execute more iterations in a given amount of real time. Does this necessarily always lead to an improvement in the quality of final solutions? This paper is devoted to the investigation of that question. We present two variants of local search algorithms where the search time can be set as an input parameter. These two approaches are: a time-predefined variant of… CONTINUE READING
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
114 Citations
44 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 114 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 44 references

A Survey of Practical Applications of Examination Timetabling Algorithms

  • M. W. Carter
  • Operations Research,
  • 1986
Highly Influential
1 Excerpt

Examination Timetabling using Set Variables

  • L. P. Reis, E. Oliveira
  • Proceedings of the 3rd International Conference…
  • 2000

Similar Papers

Loading similar papers…