{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:26:34Z","timestamp":1760707594150},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540307051"},{"type":"electronic","value":"9783540324218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593577_7","type":"book-chapter","created":{"date-parts":[[2005,11,5]],"date-time":"2005-11-05T07:32:45Z","timestamp":1131175965000},"page":"109-125","source":"Crossref","is-referenced-by-count":52,"title":["The University Course Timetabling Problem with a Three-Phase Approach"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Kostuch","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"http:\/\/www.idsia.ch\/Files\/ttcomp2002"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2298\/YJOR0302139B","volume":"13","author":"E. Burke","year":"2003","unstructured":"Burke, E., Bykov, Y., Newall, J., Petrovic, S.: A Time-Predefined Approach to Course Timetabling. Yugoslav J. Oper. Res. 13, 139\u2013151 (2003)","journal-title":"Yugoslav J. Oper. Res."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1057\/palgrave.jors.2601115","volume":"52","author":"M.W. Carter","year":"2001","unstructured":"Carter, M.W., Johnson, D.G.: Extended Clique Initialisation in Examination Timetabling. J. Oper. Res. Soc. 52, 538\u2013544 (2001)","journal-title":"J. Oper. Res. Soc."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BFb0055878","volume-title":"Practice and Theory of Automated Timetabling II","author":"M.W. Carter","year":"1998","unstructured":"Carter, M.W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol.\u00a01408, pp. 3\u201319. Springer, Heidelberg (1998)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Carter, M.W., Laporte, G., Chinneck, J.W.: A General Examination Scheduling System. Interfaces. 24, 109\u2013120 (1994)","DOI":"10.1287\/inte.24.3.109"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"47","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W., Laporte, G., Lee, S.-Y.: Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 47, 373\u2013383 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"7_CR7","unstructured":"Chiarandini, M., Socha, K., Birattari, M., Rossi-Doria, O.: An Effective Hybrid Approach for the University Course Timetabling Problem. Technical Report AIDA-03-05. FG Intellektik, TU Darmstadt (March 2003)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Deris, S., Omatu, S., Ohta, H.: Timetable Planning Using the Constraint-Based Reasoning. Comput. Oper. Res. 27, 819\u2013840 (2000)","DOI":"10.1016\/S0305-0548(99)00051-9"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/S0377-2217(96)00111-7","volume":"96","author":"D. Werra","year":"1997","unstructured":"de Werra, D.: The Combinatorics of Timetabling. Eur. J. Oper. Res. 96, 504\u2013513 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44629-X_7","volume-title":"Practice and Theory of Automated Timetabling III","author":"L. Gaspero Di","year":"2001","unstructured":"Di Gaspero, L., Schaerf, A.: Tabu Search Techniques for Examination Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 104\u2013117. Springer, Heidelberg (2001)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","first-page":"475","volume-title":"Practice and Theory of Automated Timetabling V","author":"L. Gaspero Di","year":"2005","unstructured":"Di Gaspero, L., Schaerf, A.: A Multineighbourhood Local Search Solver for the Timetabling competition TTComp 2002. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 475\u2013478. Springer, Heidelberg (2005)"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"B. Paechter","year":"1998","unstructured":"Paechter, B., Rankin, R.C., Cumming, A., Fogarty, T.C.: Timetabling the Classes of an Entire University with an Evolutionary Algorithm. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498. Springer, Heidelberg (1998)"},{"key":"7_CR14","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, New York (1998)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0055884","volume-title":"Practice and Theory of Automated Timetabling II","author":"P. Ross","year":"1998","unstructured":"Ross, P., Hart, E., Corne, D.: Some Observations About GA-based Exam Timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol.\u00a01408, pp. 115\u2013129. Springer, Heidelberg (1998)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-45157-0_22","volume-title":"Practice and Theory of Automated Timetabling IV","author":"O. Rossi-Doria","year":"2003","unstructured":"Rossi-Doria, O., Blum, C., Knowles, J., Sampels, M., Socha, K., Paechter, B.: A Local Search for the Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 124\u2013127. Springer, Heidelberg (2003)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-45157-0_22","volume-title":"Practice and Theory of Automated Timetabling IV","author":"O. Rossi-Doria","year":"2003","unstructured":"Rossi-Doria, O., Sampels, M., Chiarandini, M., Knowles, J., Manfrin, M., Mastrolilli, M., Paquete, L., Paechter, B.: A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 329\u2013351. Springer, Heidelberg (2003)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Schaerf, A.: A Survey of Automated Timetabling. Artif. Intell. Rev, 87\u2013127 (1999)","DOI":"10.1023\/A:1006576209967"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0360-8352(02)00180-8","volume":"44","author":"K.A. Smith","year":"2003","unstructured":"Smith, K.A., Abramson, D., Duke, D.: Hopfield Neural Networks for Timetabling: Formulations, Methods, and Comparative Results. Int. J. Comput. Indust. Eng. 44, 283\u2013305 (2003)","journal-title":"Int. J. Comput. Indust. Eng."},{"key":"7_CR20","unstructured":"Socha, K.: ${\\cal MAX}$ - ${\\cal MIN}$ Ant System for International Timetabling Competition. Technical Report TR\/IRIDIA\/2003-30. Universit\u00e9 Libre de Bruxelles, Belgium (September 2003)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Ant Algorithms","author":"K. Socha","year":"2002","unstructured":"Socha, K., Knowles, J., Sampels, M.: A Max\u2013Min Ant System for the University Timetabling Problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 1\u201313. Springer, Heidelberg (2002)"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"J.M. Thomson","year":"1998","unstructured":"Thomson, J.M., Dowsland, K.A.: A Robust Simulated Annealing Based Examination Timetabling System. Comput. Oper. Res. 25, 637\u2013648 (1998)","journal-title":"Comput. Oper. Res."},{"key":"7_CR23","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593577_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:49Z","timestamp":1605643369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593577_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540307051","9783540324218"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11593577_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}