{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:32:33Z","timestamp":1729643553260,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1109\/scis.2009.4927020","type":"proceedings-article","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T15:53:17Z","timestamp":1242748397000},"page":"90-94","source":"Crossref","is-referenced-by-count":12,"title":["Tabu exponential Monte-Carlo with counter heuristic for examination timetabling"],"prefix":"10.1109","author":[{"given":"Nasser R.","family":"Sabar","sequence":"first","affiliation":[]},{"given":"Masri","family":"Ayob","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00069-3"},{"key":"17","first-page":"445","author":"burke","year":"2004","journal-title":"Applications to timetabling Handbook of Graph Theory"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-008-0077-5"},{"key":"15","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/ICICIC.2006.541","article-title":"timetable scheduling using particle swarm optimization","volume":"3","author":"chu","year":"2006","journal-title":"International Conference on Innovative Computing Information and Control"},{"key":"16","first-page":"334","article-title":"fuzzy multiple ordering criteria for examination timetabling","author":"asmuni","year":"2005","journal-title":"The Practice and Theory of Automated Timetabling V Selected Papers from 5 th International Conference on the Practice and Theory of Automated Timetabling (PATAT V)"},{"key":"13","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1080\/07408170490438410","article-title":"a time-predefined local search approach to exam timetabling problems","volume":"36","author":"burke","year":"2004","journal-title":"IIE Transactions on Operations Engineering"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601830"},{"key":"11","first-page":"605","article-title":"a hybrid genetic algorithm for highly constrained timetabling problems","author":"burke","year":"1995","journal-title":"Proceedings of the 6th International Conference on Genetic Algorithms (ICGA6)"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32363-5_13"},{"key":"21","article-title":"hybrid variable neighbourhood approaches to university exam timetabling","author":"burke","year":"2007","journal-title":"Metaheuristic International Conference"},{"key":"20","first-page":"334","article-title":"a multi-start very large neighbourhood search approach with local search methods for examination timetabling","volume":"2006","author":"abdullah","year":"2006","journal-title":"ICAPS 2006 - Proceedings Sixteenth International Conference on Automated Planning and Scheduling"},{"key":"22","first-page":"198","article-title":"a practical examination timetabling problem at the universiti kebangsaan malaysia","volume":"7","author":"ayob","year":"2007","journal-title":"International Journal of Computer Science and Network Security"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602258"},{"key":"24","first-page":"334","article-title":"a multi-start very large neighbourhood search approach with local search methods for examination timetabling","volume":"2006","author":"abdullah","year":"2006","journal-title":"ICAPS 2006 - Proceedings Sixteenth International Conference on Automated Planning and Scheduling"},{"key":"25","first-page":"370","article-title":"solving exam timetabling problems with the flex-deluge algorithm. extended abstract","author":"burke","year":"2006","journal-title":"Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling"},{"key":"26","first-page":"351","article-title":"investigating ahuja-orlin's","volume":"29","author":"abdullah","year":"2007","journal-title":"Large Neighbourhood Search Approach for Examination Timetabling OR Spectrum"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.0470305"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74484-9_53"},{"key":"29","first-page":"132","article-title":"a monte carlo hyper-heuristic to optimize component placement sequencing for multi head placement machine","author":"ayob","year":"2003","journal-title":"The Proceedings of the International Conference on Intelligent Technologies (InTech'03)"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90167-5"},{"key":"2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","article-title":"a memetic algorithm for university exam timetabling","author":"burke","year":"1996","journal-title":"Lecture Notes in Computer Science"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00101-9"},{"key":"1","first-page":"3","article-title":"recent developments in practical examination timetabling","author":"carter","year":"1996","journal-title":"Lecture Notes in Computer Science"},{"key":"30","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","article-title":"multi-exchange neighborhood structures for the capacitated minimum spanning tree problem","volume":"91","author":"ahuja","year":"2001","journal-title":"Mathematical Programming Series B"},{"key":"7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-540-45157-0_14","article-title":"a hybrid algorithm for the examination timetabling problem","author":"merlot","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"key":"6","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-44691-5_20","article-title":"new algorithms for examination timetabling","author":"caramia","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-540-45157-0_13","article-title":"enhancing timetable solutions with local search methods","author":"burke","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"key":"31","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-44629-X_6","article-title":"examination timetables and tabu search with longer-term memory","author":"white","year":"2001","journal-title":"Lecture Notes in Computer Science"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.08.012"},{"key":"9","first-page":"199","article-title":"tabu search hyper-heuristic approach to the examination timetabling problem at university technology mara","author":"kendall","year":"2004","journal-title":"Proc 5th Int Conf Practice Theory Automated Timetabling (PATAT)"},{"key":"8","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-44629-X_7","article-title":"tabu search techniques for examination timetabling","author":"di gaspero","year":"2001","journal-title":"Lecture Notes in Computer Science"}],"event":{"name":"2009 IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched)","start":{"date-parts":[[2009,4,2]]},"location":"Nashville, TN, USA","end":{"date-parts":[[2009,3,30]]}},"container-title":["2009 IEEE Symposium on Computational Intelligence in Scheduling"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4911214\/4927001\/04927020.pdf?arnumber=4927020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:52:08Z","timestamp":1558320728000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4927020\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/scis.2009.4927020","relation":{},"subject":[],"published":{"date-parts":[[2009,3]]}}}