@article {17605,
	title = {Late acceptance hill-climbing for high school timetabling},
	journal = {Journal of Scheduling},
	volume = {19},
	number = {4},
	year = {2016},
	pages = {453-465},
	abstract = {
	The application of the Late Acceptance Hill-Climbing (LAHC) to solve the High School Timetabling Problem is the subject of this manuscript. The original algorithm and two variants proposed here are tested jointly with other state-of-art methods to solve the instances proposed in the Third International Timetabling Competition. Following the same rules of the competition, the LAHC-based algorithms noticeably outperformed the winning methods. These results, and reports from the literature, suggest that the LAHC is a reliable method that can compete with the most employed local search algorithms.

},
	url = {https://link.springer.com/article/10.1007/s10951-015-0458-5},
	author = {George H. G. Fonseca and Haroldo G. Santos and Eduardo G. Carrano}
}
