{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T09:58:33Z","timestamp":1768989513926,"version":"3.49.0"},"reference-count":36,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1080\/10556781003664739","type":"journal-article","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T22:58:39Z","timestamp":1268434719000},"page":"281-294","source":"Crossref","is-referenced-by-count":15,"title":["A clique-based algorithm for constructing feasible timetables"],"prefix":"10.1080","volume":"26","author":[{"given":"Yongkai","family":"Liu","sequence":"first","affiliation":[{"name":"Xiamen University","place":["People's Republic of China"]},{"name":"University of Hong Kong","place":["Hong Kong"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Defu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Xiamen University","place":["People's Republic of China"]},{"name":"University of Hong Kong","place":["Hong Kong"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis Y.L.","family":"Chin","sequence":"additional","affiliation":[{"name":"Xiamen University","place":["People's Republic of China"]},{"name":"University of Hong Kong","place":["Hong Kong"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2010,3,11]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.37.1.98"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46787-5_6"},{"key":"e_1_3_2_4_1","first-page":"1","article-title":"Simulated annealing cooling schedules for the school timetabling problem","volume":"16","author":"Abramson D.","year":"1999","unstructured":"Abramson , D. , Krishnamoorthy , M. and Dang , H. 1999 . Simulated annealing cooling schedules for the school timetabling problem . Asia-Pac. J. Oper. Res. , 16 : 1 \u2013 22 .","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.04.035"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9025-3"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9025-3"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.08.010"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/355586.364824"},{"key":"e_1_3_2_11_1","volume-title":"Computer Science Tech. Rep. NOTTCS-TR-2001-6","author":"Burke E.","year":"2001","unstructured":"Burke , E. , Bykov , Y. , Newall , J. and Petrovic , S. 2001 . \u201c A time-predefined local search approach to exam timetabling problems \u201d . In Computer Science Tech. Rep. NOTTCS-TR-2001-6 , University of Nottingham ."},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.08.012"},{"key":"e_1_3_2_13_1","volume-title":"The Description of the Algorithm for International Timetabling competition","author":"Bykov Y.","year":"2002","unstructured":"Bykov , Y. 2002 . The Description of the Algorithm for International Timetabling competition Available at http:\/\/www.idsia.ch\/Files\/ttcomp2002\/results.htm"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601115"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1996.37"},{"key":"e_1_3_2_16_1","volume-title":"Efficient Timetabling Solution with Tabu Search","author":"Cordeau J.","year":"2002","unstructured":"Cordeau , J. , Jaumard , B. and Morales , R. 2002 . Efficient Timetabling Solution with Tabu Search Available at http:\/\/www.idsia.ch\/Files\/ttcomp2002\/results.htm"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.06.023"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00103-6"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.020"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77345-0_23"},{"key":"e_1_3_2_21_1","volume-title":"Genetic Algorithms and Grouping Problems","author":"Falkenauer E.","year":"1998","unstructured":"Falkenauer , E. 1998 . Genetic Algorithms and Grouping Problems , Chichester : Wiley ."},{"key":"e_1_3_2_22_1","volume-title":"Timetabling Competition TTComp 2002: Solver Description","author":"Gaspero L. D.","year":"2002","unstructured":"Gaspero , L. D. and Schaerf , A. 2002 . Timetabling Competition TTComp 2002: Solver Description Available at http:\/\/www.idsia.ch\/Files\/ttcomp2002\/results.htm"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.01.013"},{"key":"e_1_3_2_24_1","unstructured":"R. Lewis 2005. Available at http:\/\/www.emergentcomputing.org\/timetabling\/harderinstances"},{"key":"e_1_3_2_25_1","unstructured":"B. Paechter 2005. Available at http:\/\/www.idsia.ch\/Files\/ttcomp2002\/. Organized by Metaheuristics Network and sponsored by PATAT"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11593577_7"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.885162"},{"key":"e_1_3_2_28_1","first-page":"381","article-title":"A Simulated Annealing algorithm with a new Neighborhood Structure for the Timetabling Problem","author":"Liu Y.","year":"2009","unstructured":"Liu , Y. , Zhang , D. and Leung , S. C.H. 2009 . A Simulated Annealing algorithm with a new Neighborhood Structure for the Timetabling Problem . The 2009 World Summit on Genetic and Evolutionary Computation (GEC Summit) , : 381 \u2013 386 .","journal-title":"The 2009 World Summit on Genetic and Evolutionary Computation (GEC Summit)"},{"key":"e_1_3_2_29_1","first-page":"234","volume-title":"Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling","author":"Malim M. R.","year":"2006","unstructured":"Malim , M. R. , Khader , A. T. and Mustafa , A. 2006 . \u201c Artificial immune algorithms for university timetabling \u201d . In Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling , Edited by: Burke , E. K. and Rudova , H. 234 \u2013 245 . Czech Republic : Brno ."},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601495"},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45157-0_22"},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(02)00180-8"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2007.25"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00083-7"},{"key":"e_1_3_2_36_1","first-page":"41","article-title":"The upper bound for the chromatic number of a graph and its application to timetabling problems","volume":"11","author":"Welsh D. J.A.","year":"1967","unstructured":"Welsh , D. J.A. and Powell , M. B. 1967 . The upper bound for the chromatic number of a graph and its application to timetabling problems . Comput. J. , 11 : 41 \u2013 47 .","journal-title":"Comput. J."},{"key":"e_1_3_2_37_1","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001","unstructured":"West , D. B. 2001 . Introduction to Graph Theory , 2 , Prentice Hall .","edition":"2"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556781003664739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T20:23:09Z","timestamp":1768940589000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556781003664739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,11]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["10.1080\/10556781003664739"],"URL":"https:\/\/doi.org\/10.1080\/10556781003664739","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,11]]}}}