{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T06:29:36Z","timestamp":1774160976132,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1023\/a:1018354324992","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T17:08:17Z","timestamp":1044551297000},"page":"275-298","source":"Crossref","is-referenced-by-count":55,"title":["Metaheuristics for High School Timetabling"],"prefix":"10.1007","volume":"9","author":[{"given":"Alberto","family":"Colorni","sequence":"first","affiliation":[]},{"given":"Marco","family":"Dorigo","sequence":"additional","affiliation":[]},{"given":"Vittorio","family":"Maniezzo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"150477_CR1","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"A. Abramson","year":"1991","unstructured":"A. Abramson, \u201cConstructing school timetables using simulated annealing: Sequential and parallel algorithms,\u201d Management Science, vol. 37, pp. 98-113, 1991.","journal-title":"Management Science"},{"key":"150477_CR2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1093\/comjnl\/16.4.347","volume":"16","author":"E.A. Akkonyunlu","year":"1973","unstructured":"E.A. Akkonyunlu, \u201cA linear algorithm for computing the optimum of university timetable,\u201d Computer Journal, vol. 16, pp. 347-350, 1973.","journal-title":"Computer Journal"},{"key":"150477_CR3","first-page":"496","volume-title":"Proc. of ICPTAT\u201995, 1st Int. Conf. on the Practice and Theory of Automated Timetabling","author":"E.K. Burke","year":"1995","unstructured":"E.K. Burke, J.P. Newall, and R.F. Weare, \u201cA memetic algorithm for university exam timetabling,\u201d in Proc. of ICPTAT\u201995, 1st Int. Conf. on the Practice and Theory of Automated Timetabling, Napier University, Edinburgh, UK, 1995, pp. 496-503."},{"key":"150477_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"M.W. Carter","year":"1986","unstructured":"M.W. Carter, \u201cA survey of practical applications of examination timetabling algorithms,\u201d Operations Research, vol. 34, pp. 193-202, 1986.","journal-title":"Operations Research"},{"key":"150477_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0377-2217(89)90269-5","volume":"40","author":"N. Chahal","year":"1989","unstructured":"N. Chahal and D. De Werra, \u201cAn interactive system for constructing timetables on a PC,\u201d European Journal of Operational Research, vol. 40, pp. 32-37, 1989.","journal-title":"European Journal of Operational Research"},{"key":"150477_CR6","first-page":"235","volume":"F82","author":"A. Colorni","year":"1990","unstructured":"A. Colorni, M. Dorigo, and V. Maniezzo, Genetic algorithms: A New Approach to the Timetable Problem, NATO ASI Series, Springer-Verlag, 1990, vol. F82, pp. 235-239.","journal-title":"Genetic algorithms: A New Approach to the Timetable Problem"},{"key":"150477_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/0377-2217(94)90009-4","volume":"57","author":"D. Costa","year":"1994","unstructured":"D. Costa, \u201cA tabu search algorithm for computing an operational timetable,\u201d European Journal of Operational Research, vol. 57, pp. 98-110, 1994.","journal-title":"European Journal of Operational Research"},{"key":"150477_CR8","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G.A. Croes","year":"1958","unstructured":"G.A. Croes, \u201cA method for solving traveling salesman problems,\u201d Operations Research, vol. 6, pp. 791-812, 1958.","journal-title":"Operations Research"},{"key":"150477_CR9","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/363958.363986","volume":"7","author":"J. Csima","year":"1961","unstructured":"J. Csima and C.C. Gotleib, \u201cTests on a computer method for construction of school timetables,\u201d Communications of the ACM, vol. 7, pp. 160-163, 1961.","journal-title":"Communications of the ACM"},{"key":"150477_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. de Werra","year":"1985","unstructured":"D. de Werra, \u201cAn introduction to timetabling,\u201d European Journal of Operational Research, vol. 19, pp. 151- 162, 1985.","journal-title":"European Journal of Operational Research"},{"key":"150477_CR11","first-page":"21","volume-title":"Proc. of ICPTAT\u201995, 1st Int. Conf. on the Practice and Theory of Automated Timetabling","author":"W. Erben","year":"1995","unstructured":"W. Erben and J. Keppler, \u201cA genetic algorithm solving a weekly course-timetabling problem,\u201d in Proc. of ICPTAT\u201995, 1st Int. Conf. on the Practice and Theory of Automated Timetabling, Napier University, Edinburgh, UK, 1995, pp. 21-32."},{"issue":"4","key":"150477_CR12","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A. Itai, and A. Shamir, \u201cOn the complexity of timetable and multicommodity flow problems,\u201d SIAM Journal of Computing, vol. 5, no.4, pp. 691-703, 1976.","journal-title":"SIAM Journal of Computing"},{"key":"150477_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0305-0548(85)90045-0","volume":"12","author":"J.A. Ferland","year":"1985","unstructured":"J.A. Ferland and S. Roy, \u201cTimetabling problem for university as assignment of activities to resources,\u201d Computers and Operations Research, vol. 12, pp. 207-218, 1985.","journal-title":"Computers and Operations Research"},{"key":"150477_CR14","unstructured":"P. Gianoglio, \u201cApplication of neural networks to timetable construction,\u201d in Proc. of the Third Int. Workshop on Neural Networks and Their Applications."},{"key":"150477_CR15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover, \u201cTabu search-Part I,\u201d ORSA J. on Computing, vol. 1, pp. 190-206, 1989.","journal-title":"ORSA J. on Computing"},{"key":"150477_CR16","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover, \u201cTabu search-Part II,\u201d ORSA J. on Computing, vol. 2, pp. 4-32, 1990.","journal-title":"ORSA J. on Computing"},{"key":"150477_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0166-218X(92)90248-9","volume":"35","author":"A. Hertz","year":"1992","unstructured":"A. Hertz, \u201cFinding a feasible course schedule using tabu search,\u201d Discrete Applied Mathematics, vol. 35, pp. 255-270, 1992.","journal-title":"Discrete Applied Mathematics"},{"key":"150477_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","volume":"54","author":"A. Hertz","year":"1992","unstructured":"A. Hertz, \u201cTabu search for large scale timetabling problems,\u201d European Journal of Operational Research, vol. 54, pp. 39-47, 1992.","journal-title":"European Journal of Operational Research"},{"key":"150477_CR19","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"J.H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press: Ann Arbor, Michigan, 1975. Reprinted by MIT Press, 1992."},{"key":"150477_CR20","doi-asserted-by":"crossref","unstructured":"W. Junginger, \u201cCourse scheduling by genetic algorithms,\u201d in Evolutionary Algorithms in Management Applications, J. Biethahn and V. Niessen (Eds.), Springer Verlag, 1995, pp. 357-370.","DOI":"10.1007\/978-3-642-61217-6_21"},{"key":"150477_CR21","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, \u201cOptimization by simulated annealing,\u201d Science, vol. 220, pp. 671-680, 1983.","journal-title":"Science"},{"key":"150477_CR22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/comjnl\/12.4.307","volume":"12","author":"N.H. Lawrie","year":"1969","unstructured":"N.H. Lawrie, \u201cAn integer programming model for a school timetabling problem,\u201d Computer Journal, vol. 12, pp. 307-316, 1969.","journal-title":"Computer Journal"},{"issue":"1","key":"150477_CR23","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/0377-2217(93)E0128-K","volume":"81","author":"V. Maniezzo","year":"1995","unstructured":"V. Maniezzo, A. Colorni, and M. Dorigo, \u201cAlgodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem,\u201d European Journal of Operational Research, vol. 81 no.1, pp. 188-205, 1995.","journal-title":"European Journal of Operational Research"},{"key":"150477_CR24","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, \u201cEquation of state calculations by fast computing machines,\u201d J. of Chemical Physics, vol. 21, pp. 1087-1092, 1953.","journal-title":"J. of Chemical Physics"},{"key":"150477_CR25","doi-asserted-by":"crossref","unstructured":"Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer Verlag, 1992.","DOI":"10.1007\/978-3-662-02830-8"},{"key":"150477_CR26","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF02022564","volume":"41","author":"P. Moscato","year":"1993","unstructured":"P. Moscato, \u201cAn introduction to population approaches for optimization and hierarchical objective functions: Discussion on the role of tabu search,\u201d Annals of Operations Research, vol. 41, pp. 85-121, 1993.","journal-title":"Annals of Operations Research"},{"key":"150477_CR27","unstructured":"H. Muhlenbein, \u201cParallel genetic algorithms, population genetics and combinatorial optimization, in Proc. of the Third Int. Conf. on Genetic Algorithms, Morgan Kaufmann, 1989, pp. 124-129."},{"key":"150477_CR28","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/0377-2217(82)90012-1","volume":"9","author":"J.M. Mulvey","year":"1982","unstructured":"J.M. Mulvey, \u201cA classroom\/time assignment model,\u201d European Journal of Operational Research, vol. 9, pp. 64-70, 1982.","journal-title":"European Journal of Operational Research"},{"key":"150477_CR29","first-page":"202","volume-title":"Proc. of ICPTAT\u201995, 1st Int. Conf. on the Practice and Theory of Automated Timetabling","author":"D.C. Rich","year":"1995","unstructured":"D.C. Rich, \u201cA smart genetic algorithm for university timetabling,\u201d in Proc. of ICPTAT\u201995, 1st Int. Conf. on the Practice and Theory of Automated Timetabling, Napier University, Edinburgh, UK, 1995, pp. 202-216."},{"key":"150477_CR30","volume-title":"Proc. of ICPTAT\u201995, 1st Int. Conf. on the Practice and Theory of Automated Timetabling","author":"A. Schaerf","year":"1995","unstructured":"A. Schaerf and M. Schaerf, \u201cLocal search techniques for high school timetabling,\u201d in Proc. of ICPTAT\u201995, 1st Int. Conf. on the Practice and Theory of Automated Timetabling, Napier University, Edinburgh, UK, 1995."},{"key":"150477_CR31","unstructured":"E. Taillard, \u201cRobust taboo search for the quadratic assignment problem,\u201d Report ORPW 90\/10, DMA, Swiss Federal Institute of Technology of Lausanne, 1990."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018354324992.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018354324992\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018354324992.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:05:21Z","timestamp":1752375921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018354324992"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["150477"],"URL":"https:\/\/doi.org\/10.1023\/a:1018354324992","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}