Author:
Lewis Rhydian,Paechter Ben,Rossi-Doria Olivia
Publisher
Springer Berlin Heidelberg
Reference51 articles.
1. http://www.idsia.ch/Files/ttcomp2002/
2. http://www.emergentcomputing.org/timetabling/harderinstances
3. D. Abramson, “Constructing School Timetables using Simulated Annealing: Sequential and Parallel Algorithms, ”Management Science, vol. 37, pp. 98-113, 1991.
4. D. Abramson, H. Krishnamoorthy, and H. Dang,“ Simulated Annealing Cool-ing Schedules for the School Timetabling Problem, ”Asia-Pacific Journal of Operational Research, vol. 16, pp. 1-22, 1996.
5. H. Arntzen and A. Løkketangen, “A Tabu Search Heuristic for a University Timetabling Problem, ”in Metaheuristics: Progress as Real Problem Solvers, vol. 32, Computer Science Interfaces Series, T Ikabaki, K. Nonobe, and M. Yagiura, Eds. Berlin: Springer-Verlag, 2005, pp. 65-86.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献