{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T23:44:45Z","timestamp":1784245485171,"version":"3.55.0"},"reference-count":48,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0377-2217(02)00069-3","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:13:43Z","timestamp":1034284423000},"page":"266-280","source":"Crossref","is-referenced-by-count":280,"title":["Recent research directions in automated timetabling"],"prefix":"10.1016","volume":"140","author":[{"given":"Edmund Kieran","family":"Burke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanja","family":"Petrovic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00069-3_BIB1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0305-0548(92)90066-E","article-title":"Scheduling examinations to reduce second-order conflicts","volume":"19","author":"Balakrishnan","year":"1992","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB2","unstructured":"Bardadym, V.A., 1996. Computer-aided school and university timetabling: The new wave. In: Burke and Ross (1996) pp. 22\u201345"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB3","series-title":"Research and Development in Expert Systems IX, Proceedings of Expert Systems 92, The Twelfth Annual Technical Conference of the British Computer Society, Specialist Group on Expert Systems, 15\u201317 December 1992, London, UK","first-page":"225","article-title":"An application of case-based expert system technology to dynamic job-shop scheduling","author":"Bezirgan","year":"1993"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB4","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/S0377-2217(98)00364-6","article-title":"Constraint satisfaction problems: Algorithms and applications","volume":"119","author":"Brailsford","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/S0377-2217(02)00069-3_BIB5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"22","author":"Brelaz","year":"1979","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB6","series-title":"The Practice and Theory of Automated Timetabling II: Selected Papers from the 2nd International Conference on the Practice and Theory of Automated Timetabling, University of Toronto, August 20\u201322, 1997","volume":"vol. 1408","year":"1998"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB7","series-title":"The Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling, Napier University, August\/September 1995","volume":"vol. 1153","year":"1996"},{"issue":"1","key":"10.1016\/S0377-2217(02)00069-3_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/4235.752921","article-title":"A multi-stage evolutionary algorithm for the timetable problem","volume":"3","author":"Burke","year":"1999","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB9","doi-asserted-by":"crossref","unstructured":"Burke, E., Erben, W. (Eds.), 2001. The Practice and Theory of Automated Timetabling III: Selected Papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling, University of Applied Sciences, Konstanz, August 16\u201318, 2000. Springer Lecture Notes in Computer Science Series vol. 2079","DOI":"10.1007\/3-540-44629-X"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/08886504.1994.10782112","article-title":"A university timetabling system based on graph colouring and constraint manipulation","volume":"27","author":"Burke","year":"1994","journal-title":"Journal of Research on Computing in Education"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB11","series-title":"Proceedings of the 6th International Conference on Genetic Algorithms, Pittsburgh, USA, 15\u201319 July 1995","first-page":"605","article-title":"A hybrid genetic algorithm for highly constrained timetabling problems","author":"Burke","year":"1995"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB12","unstructured":"Burke, E.K., Elliman, D.G., Ford, P., Weare, R.F., 1996a. Examination timetabling in British Universities \u2013 A survey. In: Burke and Ross (1996) pp. 76\u201392"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB13","unstructured":"Burke, E.K., Newall, J.P., Weare, R.F., 1996b. A memetic algorithm for University exam timetabling. In: Burke and Ross (1996) pp. 241\u2013250"},{"issue":"9","key":"10.1016\/S0377-2217(02)00069-3_BIB14","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1093\/comjnl\/40.9.565","article-title":"Automated university timetabling: The state of the art","volume":"40","author":"Burke","year":"1997","journal-title":"The Computer Journal"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB15","series-title":"International ICSC Symposium on Engineering of Intelligent Systems EIS'98","first-page":"574","article-title":"A simple heuristically guided search for the timetable problem","author":"Burke","year":"1998"},{"issue":"1","key":"10.1016\/S0377-2217(02)00069-3_BIB16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1162\/evco.1998.6.1.81","article-title":"Initialisation strategies and diversity in evolutionary timetabling","volume":"6","author":"Burke","year":"1998","journal-title":"Evolutionary Computation"},{"issue":"2-3","key":"10.1016\/S0377-2217(02)00069-3_BIB17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0950-7051(00)00057-5","article-title":"Structured cases in CBR \u2013 Re-using and adapting cases for time-tabling problems","volume":"13","author":"Burke","year":"2000","journal-title":"Knowledge-Based Systems"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB18","unstructured":"Burke, E., Bykov, Y., Petrovic, S., 2001a. A multicriteria approach to timetabling problems. In: Burke and Erben (2001), pp. 118\u2013131"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB19","doi-asserted-by":"crossref","unstructured":"Burke, E., MacCarthy, B., Petrovic, S., Qu, R., 2001b. Case-based reasoning in course timetabling: An attribute graph approach. In: Aha, D.W., Watson, I., Yang, Q. (Eds.), Case-Based Reasoning Research and Development, Proceedings of the 4th International Conference on Case-Based Reasoning, ICCBR-2001, Vancouver, Canada, 30 July\u20132 August 2001. Springer-Verlag Lecture Notes in Artificial Intelligence vol. 2080, pp. 90\u2013104","DOI":"10.1007\/3-540-44593-5_7"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB20","unstructured":"Burke, E., MacCarthy, B., Petrovic, S., Qu, R., 2001c. Multi-retrieval in a structured case based reasoning approach for course timetabling problems. School of Computer Science and IT Technical Report, University of Nottingham, 2001"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB21","unstructured":"Carter, M.W., 1983. A decomposition algorithm for practical timetabling problems. Technical Paper 83-06, Department of Industrial Engineering, University of Toronto"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/opre.34.2.193","article-title":"A survey of practical applications of examination timetabling algorithms","volume":"34","author":"Carter","year":"1986","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB23","unstructured":"Carter, M.W., Laporte, G., 1996. Recent developments in practical examination timetabling. In: Burke and Ross (1996) pp. 3\u201321"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB24","unstructured":"Carter, M.W., Laporte, G., 1998. Recent developments in practical course timetabling. In: Burke and Carter (1998) pp. 3\u201319"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB25","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1057\/jors.1996.37","article-title":"Examination timetabling: Algorithmic strategies and applications","volume":"74","author":"Carter","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB26","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","article-title":"An introduction to timetabling","volume":"19","author":"de Werra","year":"1985","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB27","unstructured":"Di Gaspero, L., Schaerf, A., 2001. Tabu search techniques for examination timetabling. In: Burke and Erben (2001), pp. 104\u2013117"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB28","unstructured":"Fisher, J.G., Shier, D.R., 1983. A heuristic procedure for large-scale examination scheduling problems. Technical Report 417, Department of Mathematical Sciences, Clemson University"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB29","series-title":"Evolutionary Computing, Timetabling Section (3 papers)","volume":"vol. 993","year":"1995"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB30","series-title":"Case-Based Reasoning","author":"Kolodner","year":"1993"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB31","series-title":"Proceedings: Workshop on Case-Based Reasoning (DARPA), Pensacola Beach, Florida, San Mateo, CA","first-page":"285","article-title":"SMARTPlan: A case-based resource allocation and scheduling system","author":"Koton","year":"1989"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB32","series-title":"Case-Based Reasoning, Experiences and Future Directions","year":"1996"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB33","unstructured":"Messmer, B.T., 1995. Efficient graph matching algorithms for preprocessed model graph. Ph.D. Thesis, University of Bern, Switzerland"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB34","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0004-3702(94)00089-J","article-title":"CABINS: A framework of knowledge acquisition and iterative revision for schedule improvement and reactive repair","volume":"76","author":"Miyashita","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB35","series-title":"Proceedings of the International Conference on Parallel Computing and Transputer Applications","first-page":"177","article-title":"A \u201cMemetic\u201d approach for the travelling salesman problem \u2013 Implementation of a computational ecology for combinatorial optimisation on message passing systems","author":"Moscato","year":"1992"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB36","unstructured":"Newall, J.P., 1999. Hybrid methods for automated timetabling. Ph.D. Thesis, Department of Computer Science, University of Nottingham, UK"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB37","unstructured":"Paechter, B., Cumming, A., Luchian, H., 1995. The use of local search suggestion lists for improving the solution of timetabling problems with evolutionary algorithms. In: Burke and Ross (1996) pp. 86\u2013102"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB38","unstructured":"Paechter, B., Cumming, A., Norman, M.G., Luchian, H., 1996. Extensions to a memetic timetabling system. In: Burke and Ross (1996) pp. 251\u2013266"},{"issue":"4","key":"10.1016\/S0377-2217(02)00069-3_BIB39","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1080\/12460125.1995.10511660","article-title":"Eco-Ecodispatch: DSS for multicriteria loading of thermal power generators","volume":"4","author":"Petrovic","year":"1995","journal-title":"Journal of Decision Systems"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB40","series-title":"2001 Genetic and Evolutionary Computation Conference, San Fransisco, 2001, Tutorial Program","first-page":"193","article-title":"Tutorial on evolutionary scheduling and routing","author":"Ross","year":"2001"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB41","unstructured":"Ross, P., Hart, E. Corne, D., 1998. Some observations about GA-based exam timetabling. In: Burke and Carter (1998) pp. 115\u2013129"},{"issue":"2","key":"10.1016\/S0377-2217(02)00069-3_BIB42","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","article-title":"A survey of automated timetabling","volume":"13","author":"Schaerf","year":"1999","journal-title":"Artificial Intelligence Review"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB43","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1016\/S0925-5273(97)00141-2","article-title":"Case-based reasoning for production scheduling","volume":"56\u201357","author":"Schmidt","year":"1998","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB44","series-title":"A Plenary Talk in the Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling, University of Applied Sciences, Konstanz, August 16\u201318, 2000","first-page":"32","article-title":"Constrained satisfaction, not so constrained satisfaction and the timetabling problem","author":"White","year":"2000"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB45","first-page":"219","article-title":"Towards the construction of optimal examination timetables","volume":"17","author":"White","year":"1979","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB46","unstructured":"Wren, A., 1996. Scheduling, timetabling and rostering \u2013 A special relationship? In: Burke and Ross (1996) pp. 46\u201375"},{"key":"10.1016\/S0377-2217(02)00069-3_BIB47","series-title":"Multiple Criteria Decision Making","first-page":"262","article-title":"Compromise programming","author":"Zeleny","year":"1973"},{"issue":"4","key":"10.1016\/S0377-2217(02)00069-3_BIB48","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/0305-0548(74)90064-1","article-title":"A concept of compromise solutions and the method of displaced ideal","volume":"1","author":"Zeleny","year":"1974","journal-title":"Computers and Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702000693?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702000693?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T13:23:24Z","timestamp":1555161804000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702000693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0377221702000693"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00069-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}