1. Abdullah, S., & Alzaqebah, M. (2014). An adaptive artificial bee colony and late acceptance hill-climbing algorithm for examination timetabling. Journal of Scheduling, 17, 249–262.
2. Abuhamdah, A. (2010). Experimental result of late acceptance randomized descent algorithm for solving course timetabling problems. International Journal of Computer Science and Network Security, 10, 192–200.
3. Boese, K. D., Kahng, A. B., & Muddu, S. (1994). A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters, 16, 101–113.
4. Burke E. K., & Bykov, Y. (2008). A late acceptance strategy in hill-climbing for exam timetabling problems: Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT2008), Montreal, Canada.
5. Burke E. K., & Bykov, Y. (2012). The Late Acceptance Hill Climbing heuristic. Technical report CSM-192, Computing Science and Mathematics, University of Stirling, UK.