Final Exam Scheduler - FES

2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

Volumn 2, Issue , 2005, Pages 1356-1363

  Özcan, Ender ^a   Ersoy, Ersan ^b  

^a YEDITEPE UNIVERSITY   (Turkey)

^b ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; CONSTRAINT THEORY; DATA REDUCTION; OPTIMIZATION; SCHEDULING;

CONSTRAINT OPTIMIZATION PROBLEMS; DATA FORMAT; MEMTIC ALGORITHMS; TIMETABLING PROBLEMS;

PROBLEM SOLVING;

EID: 27144512842     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. Alkan, A. and Ozean, E. (2003) "Memetic Algorithms for Timetabling", Proc. of 2003 IEEE Congress on Evolutionary Computation, pp. 1796-1802.
2. Burke, E., Elliman, D., Ford, P., Weare, B. (1996a) "Examination Timetabling in British Universities- A Survey", The Practice and Theory of Automated Timetabling, Lecture Notes In Computer Science 1153, pages 76-90. Springer-Verlag.
3. Burke, E., Newall, J.P., and Weare, R.F. (1996b) "A Memetic Algorithm for University Exam Timetabling", Lecture Notes in Computer Science, 1153:241-250, Springer.
4. Burke, E. K., Pepper, P. A. and Kingston, J. H. (1997) "A Standard Data Format for Timetabling Instances", Springer Lecture Notes in Computer Science, 1408:213-222.
5. Burke, E.K., De Causmaecker, P., Petrovic, S., Vanden Berghe G. (2003a) "Variable Neighbourhood Search for Nurse Rostering Problems", in Metaheuristics: Computer Decision-Making (edited by Mauricio G.C. Resende and Jorge Pinho de Sousa), chapter 7, Kluwer, pp. 153-172.
6. Burke, E., Kendall, G., Newall, J., Hart, E., Ross, P. and Schulenburg, S. (2003b) "Hyper-heuristics: an emerging direction in modern search technology", Handbook of metaheuristics, chapter 16, pp. 457-474. Kluwer Academic Publishers.
7. Burke, E.K., De Causmaecker, P. and Vanden Berghe, G., Van Landeghem, H. (2004a) "The State of the Art of Nurse Rostering", Journal of Scheduling, 7:441-499.
8. Burke, E. and Newall, J. P. (2004b) 'Solving Examination Timetabling Problems through Adaption of Heuristic Orderings: Models and Algorithms for Planning and Scheduling Problems", (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz) Annals of Operations Research, vol. 129, no. 1-4, pp. 107-134(28).
9. Carter, M. W, Laporte, G. and Lee, S.T. (1996) "Examination timetabling: algorithmic strategies and applications.", Journal of the Operational Research Society, 47:373-383.
10. Enzhe, Y. and Sung, K. (2002) "A Genetic Algorithm for a University Weekly Courses Timetabling Problem", International Transactions in Operational Research, 9:703-717.
11. Even, S., Itai, A. and Shamir, A. (1976) "On the Complexity of Timetable and Multicommodity Flow Problems", SIAM J. Comput., 5(4):691-703.
12. Fang, H. L. (1994) "Genetic Algorithms in Timetabling and Scheduling", PhD thesis, Department of Artificial Intelligence, University of Edinburgh, Scotland.
13. Glover, F. "Tabu search - Part I". ORSA Journal on Computing, 1(3): 190-206, 1989.
14. Gaspero, L. Di and Schaerf, A. (2000) "Tabu Search Techniques for Examination Timetabling", LCNS archive Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling, pp. 104 -117.
15. Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading (MA).
16. Holland, J. H. (1975) Adaptation in Natural and Artificial Systems, Univ. Mich. Press.
17. Kingston, J.H. (2001) "Modeling timetabling problems with STTL", Springer LCNS, 2079:309.
18. Kirkpatrick, S., Gelatt, C., and Vecchi, M. (1983). "Optimization by simulated annealing", Science, vol. 220, no. 4598, pp. 671-680.
19. Krasnogor, N. (2002) "Studies on the Theory and Design Space of Memetic Algorithms", PhD Thesis, University of the West of England, Bristol, United Kingdom.
20. Leighton, F. T. (1979) "A graph coloring algorithm for large scheduling problems", Journal of Reasearch of the National Bureau of Standards, 84:489.
21. Lewis, R. and Paechter, B. (2004) "New Crossover Operators for Timetabling with Evolutionary Algorithms", 5th International Conference on Recent Advances in Soft Computing (RASC 2004), vol. 5, pp 189-195.
22. Merlot, L., Boland, N., Hughes, B. and Stuckey P. (2003) "A hybrid algorithm for the examination timetabling problem", Lecture Notes in Computer Science, vol. 2740, Gent, Belgium, Springer-Verlag, pp. 207-231.
23. Moscato, P. and Norman, M. G. (1992) "A Memetic Approach for the Traveling Salesman Problem Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems", Parallel Computing and Transputer Applications, pp. 177-186.
24. Ozcan, E. and Mohan, C. K. (1998) "Steady State Memetic Algorithm for Partial Shape Matching", LNCS, Evolutionary Programming VII, 7th International Conference, EP98, San Diego, CA, USA, Springer, Berlin, vol. 1447, pp. 527-536.
25. Ozcan, E. and Alkan, A., (2002) "Solving Time Tabling Problem using Genetic Algorithms", Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling, pp. 104-107.
26. Ozcan, E. and Onbasioglu, E. (2004) "Genetic Algorithms for Parallel Code Optimization", Proc. of 2004 IEEE Congress on Evolutionary Comp., vol. 2, pp. 1775-1781.
27. Ozcan, E. (2005a) "Towards an XML based standard for Timetabling Problems: TTML", Multidisciplinary Scheduling: Theory and Applications, 2005, Selected Volume of the 1st MISTA (2003), to appear.
28. Ozcan, E. (2005b) "Memetic Algorithms for Nurse Rostering", The 20th International Symposium on Computer and Information Sciences, in review.
29. Petrovic, S., Yang, Y., Dror, M. (2003) "Case-Based Initialisation of Metaheuristics for Examination Timetabling", pp. 137-154., Proc. of 1st Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2003), pp. 137-154.
30. Paquete, L. F. and Fonseca C. M. (2001) "A Study of Examination Timetabling with Multiobjective Evolutionary Algorithms", Proc. of the 4th Metaheuristics International Conference (MIC 2001), pp. 149-154, Porto.
31. Radcliffe, N. J. and Surry, P.D. (1994) "Formal memetic algorithms", Evolutionary Computing: AISB Workshop, Springer Verlag, LNCS 865, pp. 1-16.
32. Ross, P., Corne, D. and Fang, H-L. (1994a) "Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation", Proc. of PPSN III, pp. 556-565.
33. Ross, P., Corne, D. and Fang, H-L. (1994b) "Fast Practical Evolutionary Timetabling", Proc. of AISBWorkshop on Evolutionary Computation.
34. Schaerf, A. (1999) "A survey of automated timetabling", Artificial Intelligence Review, 13(2):87-127.
35. Terashima-Marín, H. (1998) "Combinations of GAs and CSP Strategies for Solving the Examination Timetabling Problem", PhD thesis, Computer Systems Engineering, Tecnológico Monterrey, Mexico.
36. Terashima-Marín, H., Ross, P. and Valenzuela-Rendón, M. (1999) "Clique-Based Crossover for Solving the Timetabling Problem with Gas", Proc. of the Congress on Evolutionary Computation, pp. 1200-1206.
37. Werra, D. De, (1985) 'An introduction to timetabling", European Journal of Operations Research, 19:151-162.
38. Wong, T., Cote, P. and Gely, P. (2002) "Final exam timetabling: a practical approach", Canadian Conference on Electrical and Computer Engineering, Winnipeg, CA, vol.2, pp. 726-731.