{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:51:21Z","timestamp":1725533481873},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_44","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"463-470","source":"Crossref","is-referenced-by-count":8,"title":["Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems"],"prefix":"10.1007","author":[{"given":"Nasser R.","family":"Sabar","sequence":"first","affiliation":[]},{"given":"Masri","family":"Ayob","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Qu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"Abdullah, S., Burke, E.K.: A Multi-Start Large Neighbourhood Search Approach with Local Search Methods for Examination Timetabling. In: Long, D., Smith, S.F., Borrajo, D., McCluskey, L. (eds.) ICAPS 2006, Cumbria, UK, pp. 334\u2013337 (2006)"},{"key":"44_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11593577_19","volume-title":"Practice and Theory of Automated Timetabling V","author":"H. Asmuni","year":"2005","unstructured":"Asmuni, H., Burke, E.K., Garibaldi, J.M., McCollum, B.: Fuzzy multiple heuristic orderings for examination timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 334\u2013353. Springer, Heidelberg (2005)"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-540-74484-9_53","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"M. Ayob","year":"2007","unstructured":"Ayob, M., Malik, A.M.A., Abdullah, S., Hamdan, A.R., Kendall, G., Qu, R.: Solving a Practical Examination Timetabling Problem: A Case Study. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part III. LNCS, vol.\u00a04707, pp. 611\u2013624. Springer, Heidelberg (2007)"},{"key":"44_CR4","first-page":"14","volume-title":"Proceeding of the Second International Conference on Genetic Algorithms (ICGA 1987)","author":"J. Baker","year":"1987","unstructured":"Baker, J.: Reducing Bias and Inefficiency in the Selection Algorithm. In: Proceeding of the Second International Conference on Genetic Algorithms (ICGA 1987), pp. 14\u201321. L. Erlbaum Associates Inc., Hillsdale (1987)"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1080\/07408170490438410","volume":"36","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., Bykov, Y., Newall, J.P., Petrovic, S.: A Time-Predefined Local Search Approach to Exam Timetabling Problems. IIE Transactions on Operations Engineering\u00a036, 509\u2013528 (2004)","journal-title":"IIE Transactions on Operations Engineering"},{"key":"44_CR6","unstructured":"Burke, E.K., Eckersley, A.J., McCollum, B., Petrovic, S., Qu, R.: Hybrid Variable Neighbourhood Approaches to University Exam Timetabling. European Journal of Operational Research (to appear)"},{"key":"44_CR7","first-page":"605","volume-title":"Proceedings of the 6th International Conference on Genetic Algorithms (ICGA 1995)","author":"E.K. Burke","year":"1995","unstructured":"Burke, E.K., Elliman, D.G., Weare, R.F.: A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems. In: Proceedings of the 6th International Conference on Genetic Algorithms (ICGA 1995), pp. 605\u2013610. Morgan Kaufmann, San Francisco (1995)"},{"key":"44_CR8","first-page":"445","volume-title":"Handbook of Graph Theory","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., Kingston, J., de Werra, D.: Applications to timetabling. In: Gross, J., Yellen, J. (eds.) Handbook of Graph Theory, pp. 445\u2013474. Chapman Hall\/CRC Press, Boca Raton (2004)"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-32363-5_13","volume-title":"Studies in Fuzziness and Soft Computing: Recent Advances in Memetic Algorithms and Related Search Technologies","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., Landa Silva, J.D.: The Design of Memetic Algorithms for Scheduling and Timetabling Problems. In: Hart, W.E., Krasnogor, N., Smith, J.E. (eds.) Studies in Fuzziness and Soft Computing: Recent Advances in Memetic Algorithms and Related Search Technologies, vol.\u00a0166, pp. 289\u2013312. Springer, Heidelberg (2004)"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E.K. Burke","year":"2007","unstructured":"Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A Graph-Based Hyper-Heuristic for Educational Timetabling Problems. European Journal of Operational Research\u00a0176, 177\u2013192 (2007)","journal-title":"European Journal of Operational Research"},{"key":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-45157-0_13","volume-title":"Practice and Theory of Automated Timetabling IV","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Newall, J.: Enhancing timetable solutions with local search methods. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 195\u2013206. Springer, Heidelberg (2003)"},{"key":"44_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","volume-title":"Practice and Theory of Automated Timetabling","author":"E.K. Burke","year":"1996","unstructured":"Burke, E.K., Newall, J.P., Weare, R.F.: A Memetic Algorithm for University Exam Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol.\u00a01153, pp. 241\u2013250. Springer, Heidelberg (1996)"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E.K. Burke","year":"2002","unstructured":"Burke, E.K., Petrovic, S.: Recent Research Directions in Automated Timetabling. European Journal of Operational Research\u00a0140, 266\u2013280 (2002)","journal-title":"European Journal of Operational Research"},{"key":"44_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44691-5_20","volume-title":"Algorithm Engineering","author":"M. Caramia","year":"2001","unstructured":"Caramia, M., Dell\u2019Olmo, P., Italiano, G.F.: New Algorithms for Examination Timetabling. In: N\u00e4her, S., Wagner, D. (eds.) WAE 2000. LNCS, vol.\u00a01982, pp. 230\u2013241. Springer, Heidelberg (2001)"},{"key":"44_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-61794-9_49","volume-title":"Practice and Theory of Automated Timetabling","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W., Laporte, G.: Recent Developments in Practical Examination Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol.\u00a01153, pp. 3\u201321. Springer, Heidelberg (1996)"},{"issue":"3","key":"44_CR16","doi-asserted-by":"publisher","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. Journal of Operational Research Society\u00a047(3), 373\u2013383 (1996)","journal-title":"Journal of Operational Research Society"},{"key":"44_CR17","unstructured":"Chu, S.C., Chen, Y.T., Ho, J.H.: Timetable Scheduling Using Particle Swarm Optimization. In: Proceedings of the 1st International Conference on Innovation computing, Information and Control, vol.\u00a03, pp. 324\u2013327 (2006)"},{"key":"44_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/11844297_40","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"P.H. Corr","year":"2006","unstructured":"Corr, P.H., McCollum, B., McGreevy, M.A.J., McMullan, P.: A New Neural Network Based Construction Heuristic for the Examination Timetabling Problem. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol.\u00a04193, pp. 392\u2013401. Springer, Heidelberg (2006)"},{"key":"44_CR19","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa, D., Hertz, A.: Ant can Colour Graphs. Journal of Operational Research Society\u00a048, 295\u2013305 (1997)","journal-title":"Journal of Operational Research Society"},{"key":"44_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. de Werra","year":"1985","unstructured":"de Werra, D.: An Introduction to Timetabling. European Journal of Operational Research\u00a019, 151\u2013162 (1985)","journal-title":"European Journal of Operational Research"},{"key":"44_CR21","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. Di Gaspero","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":"44_CR22","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1057\/palgrave.jors.2601830","volume":"56","author":"K. Dowsland","year":"2005","unstructured":"Dowsland, K., Thompson, J.: Ant Colony Optimisation for the Examination Scheduling Problem. Journal of the Operational Research Society\u00a056, 426\u2013439 (2005)","journal-title":"Journal of the Operational Research Society"},{"key":"44_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-77345-0_23","volume-title":"Practice and Theory of Automated Timetabling VI","author":"M. Eley","year":"2007","unstructured":"Eley, M.: Ant Algorithms for the Exam Timetabling Problem. In: Burke, E.K., Rudov\u00e1, H. (eds.) PATAT 2007. LNCS, vol.\u00a03867, pp. 364\u2013382. Springer, Heidelberg (2007)"},{"key":"44_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/11593577_16","volume-title":"Practice and Theory of Automated Timetabling V","author":"G. Kendall","year":"2005","unstructured":"Kendall, G., Hussin, N.M.: Tabu Search Hyper-Heuristic Approach to the Examination Timetabling Problem at University Technology MARA. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 199\u2013218. Springer, Heidelberg (2005)"},{"key":"44_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-45157-0_14","volume-title":"Practice and Theory of Automated Timetabling IV","author":"L.T.G. Merlot","year":"2003","unstructured":"Merlot, L.T.G., Borland, N., Hughes, B.D., Stuckey, P.J.: A Hybrid Algorithm for the Examination Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 207\u2013231. Springer, Heidelberg (2003)"},{"issue":"1","key":"44_CR26","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R. Qu","year":"2009","unstructured":"Qu, R., Burke, E.K., McCollum, B., Merlot, L.T.G., Lee, S.Y.: A Survey of Search Methodologies and Automated System Development for Examination Timetabling. Journal of Scheduling\u00a012(1), 55\u201389 (2009)","journal-title":"Journal of Scheduling"},{"key":"44_CR27","doi-asserted-by":"crossref","unstructured":"Socha, K., Sampels, M., Manfrin, M.: Ant Algorithms for the University Course Timetabling Problem with Regard to State-of-the-Art. In: Proceedings of the 3rd European Workshop on Evolutionary Computation in Combinatorial Optimisation, Essex, UK, pp. 334\u2013345 (2003)","DOI":"10.1007\/3-540-36605-9_31"},{"key":"44_CR28","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"J. Thompson","year":"1998","unstructured":"Thompson, J., Dowsland, K.: A Robust Simulated Annealing Based Examination Timetabling System. Computers Operations Research\u00a025, 637\u2013648 (1998)","journal-title":"Computers Operations Research"},{"key":"44_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-44629-X_6","volume-title":"Practice and Theory of Automated Timetabling III","author":"G.M. White","year":"2001","unstructured":"White, G.M., Xie, B.S.: Examination Timetables and Tabu Search with Longer-Term Memory. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 85\u2013103. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:53:24Z","timestamp":1714622004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}