References

Abdullah, S., E.K. Burke and B. McCollum, 2007. A hybrid evolutionary approach to the university course timetabling problem. Proceeding of the IEEE Congres on Evolutionary Computation, September 25-28, 2007, Singapore, pp: 1764-1768.

Abdullah, S., E.K. Burke and B. McCollum, 2007. Using a randomized iterative improvement algorithm with composite neighborhood structures. Proceeding of the 6th International Conference on Meta-Heuristic, September 25-28, 2007, Singapore, pp: 153-169.

Abdullah, S., E.K. Burke and B. McColum, 2005. An investigation of variable neighbourhood search for university course timetabling. Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, July 18-21, 2005, New York, USA., pp: 413-427.

Abdullah, S., K. Shaker, B. McCollum and P. McMullan, 2009. Construction of course timetables based on great deluge and tabu search. Proceedings of the 8th International Conference on Metaheuristic, July 13-16, 2009, Hamburg, Germany -.

Abuhamdah, A. and M. Ayob, 2009. Experimental result of particle collision algorithm for solving course timetabling problems. Int. J. Comput. Sci. Network Secur., 9: 134-142.
Direct Link  |  

Abuhamdah, A., 2010. Experimental result of late acceptance randomized descent algorithm for solving course timetabling problems. Int. J. Comput. Sci. Network Secur., 10: 192-200.
Direct Link  |  

Al-Betar, A.M. and A.T. Khader, 2009. A hybrid harmony search for university course timetabling. Proceedings of the Multidisciplinary International Conference on Scheduling: Theory and Applications, August 10-12, 2009, Dublin, Ireland -.

Al-Betar, A.M., A.T. Khader and T.A. Gani, 2008. A harmony search algorithm for university course timetabling. Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling, August 18-22, 2008, Montreal, Canada -.

Al-Betar, M.A., A.T. Khader and M. Zaman, 2012. University course timetabling using a hybrid harmony search metaheuristic algorithm. IEEE Trans. Syst. Man Cybernet. Part C: Appli. Rev., 42: 664-681.
CrossRef  |  

Al-Betar, M.Z., A.T. Khader and I.Y. Liao, 2010. A harmony search with multi-pitch adjusting rate for the university course timetabling. Recent Adv. Harmony Search Algorithm Stud. Comput. Intell., 2010: 147-161.
Direct Link  |  

Asmuni, H., E.K. Burke and J.M. Garibaldi, 2005. Fuzzy multiple heuristicordering for course timetabling. Proceeding of the 5th United Kingdom Workshop on Computational Intelligence, September 5-7, 2005, London, pp: 302-309.

Ayob, M. and G.M. Jaradat, 2009. Hybrid ant colony systems for course timetabling problems. Proceedings of the 2nd IEEE Conference on Data Mining and Optimization, October 27-28, 2009, Kajand, Malaysia, pp: 120-126.

Burke, E.K., B. McCollum, A. Meisels, S. Petrovic and R. Qu, 2007. A graph-based hyper-heuristic for educational timetabling problems. Eur. J. Oper. Res., 176: 177-192.
CrossRef  |  

Burke, E.K., G. Kendall and E. Soubeiga, 2003. A tabu-search hyper-heuristic for timetabling and rostering. J. Heuristics, 9: 451-470.

Carter, M. and G. Laporte, 1997. Recent developments in practical course timetabling. Proceedings of the 2nd International Conference on Practice and Theory of Automated Timetabling II, August 20-22, 1997, Toronto, Canada, pp: 3-19.

Cormen, T.H., C.E. Leiserson, R.L. Rivest and C. Stein, 2002. Introduction to Algorithms. MIT Press, Cambridge, UK.

Dueck, G., 1993. New optimization heuristics: The great deluge algorithm and the record-to-record travel. J. Comput. Phys., 104: 86-92.
Direct Link  |  

Gaw, A., P. Rattadilok and R.S. Kwan, 2005. Distributed Choice Function Hyperheuristics for Timetabling and Scheduling. In: Practice and Theory of Automated Timetabling V, Burke, E.K. and M. Trick (Eds.). Springer-Verlag, Berlin, Germany, pp: 51-67.

Gendreau, M., 2002. An Introduction to Tabu Search. In: Handbook of Metaheuristics, Glover, F. and G. Kochenberger (Eds.). Kluwer, Norwell, MA., USA., pp: 37-54.

Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Comput. Operat. Res., 13: 533-549.
CrossRef  |  

Jang, W.S., H. Kang and B.H. Lee, 2008. Hybrid simplex-harmony search method for optimization problems. Proceedings of the IEEE Congress on Evolutionary Computation, June 1-6, 2008, Hong Kong, pp: 4157-4164.

Jat, S.N. and S. Yang, 2009. A guided search genetic algorithm for the university course timetabling problem. Proceedings of the 4th Multidisciplinary International Conference on Scheduling: Theory and Applications, August 10-12, 2009, Dublin, Ireland, pp: 180-191.

Klein, P. and N. Young, 1999. On the number of iterations for Dantzig-Wolfe decomposition. Comput. Oper. Res., 26: 1195-1216.

Landa-Silva, D. and J.H. Obit, 2008. Great deluge with nonlinear decay rate for solving course timetabling problems. Proceedings of the 4th International IEEE Conference on Intelligent Systems, September 6-8, 2008, Varna, Bulgaria, pp: 8.11-8.18.

Landa-Silva, D. and J.H. Obit, 2009. Evolutionary Non-Linear Great Deluge for University Course Timetabling. In: Hybrid Artificial Intelligence Systems, Corchado, E., X. Wu, E. Oja, E. Hristozov and T. Jedlovcnik (Eds.). Springer-Verlag, Berlin, Germany, pp: 269-276.

Lewis, R., 2008. A survey of metaheuristic-based techniques for University Timetabling problems. OR Spectrum, 30: 167-190.
CrossRef  |  Direct Link  |  

McMullan, P., 2007. An extended implementation of the great deluge algorithm for course timetabling. Proceedings of the Part 1, 7th International Conference on Computer Science, May 27-30, 2007, Beijing, China, pp: 538-545.

Obit, J., D. Landa-Silva, D. Ouelhadj and M. Sevaux, 2009. Non-linear great deluge with learning mechanism for solving the course timetabling problem. Proceedings of the 8th International Conference on Metaheuristic, July 13-16, 2009, Hamburg, Germany, pp: 1-10.

Reeves, C.R., 1993. Improving the efficiency of tabu search for machine sequencing problems. J. Oper. Res. Soc., 44: 375-382.
CrossRef  |  Direct Link  |  

Rossi-Doria, O., C. Blum, J. Knowles, M. Samples, K. Socha and B. Paechter, 2002. A local search for the timetabling problem. Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling, August 21-23, 2002, Gent, Belgium, pp: 124-127.

Socha, K., J. Knowles and M. Samples, 2002. A max-min ant system for the university course timetabling problem. Proceedings of the 3rd International Workshop on Ant Algorithms, Lecture Notes in Computer Science, September 12-14, 2002, Springer Verlag, Germany, pp: 1-13.

Turabieh, H., S. Abdullah and B. McCollum, 2009. Electromagnetism-like mechanism with force decay rate great deluge for the course timetabling problem. Rough Sets Knowledge Technol., 5589: 497-504.
CrossRef  |  

Yang, S. and S.N. Jat, 2011. Genetic algorithms with guided and local search strategies for university course timetabling. IEEE Trans. Syst. Man Cybernetics PART C: Applicat. Rev., 41: 67-82.