{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:27:52Z","timestamp":1742635672489,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/cec.2011.5949638","type":"proceedings-article","created":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T20:51:24Z","timestamp":1311195084000},"page":"339-346","source":"Crossref","is-referenced-by-count":11,"title":["Optimization of university course scheduling problem with a hybrid artificial bee colony algorithm"],"prefix":"10.1109","author":[{"given":"Adalet","family":"Oner","sequence":"first","affiliation":[]},{"given":"Sel","family":"Ozcan","sequence":"additional","affiliation":[]},{"given":"Derya","family":"Dengi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/16.4.347"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/12.4.307"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-5915.1977.tb01114.x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00091-1"},{"key":"ref11","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","volume":"2740","author":"merlot","year":"2002","journal-title":"Practice and Theory of Automated Timetabling IV Lecture Noes in Computer Science"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0957-4174(02)00017-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00048-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00101-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00209-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600469"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00082-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1996.149"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.0470305"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1980.116"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-8495-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1287\/inte.11.5.57"},{"key":"ref3","first-page":"136","article-title":"Solving the teacher assignment-course scheduling problem by a hybrid algorithm","volume":"1","author":"gunawan","year":"2007","journal-title":"International Journal of Computer Information and System Science and Engineering"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2003.10.061"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref5","article-title":"An idea based on honey bee swarm for numerical optimization","author":"karaboga","year":"2005","journal-title":"Technical report-tr06"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0957-4174(03)00004-6"},{"key":"ref7","first-page":"205","article-title":"Combining constraint programming and simulated annealing on university exam timetabling","author":"duong","year":"0","journal-title":"Proceedings of international conference RIVF'04 Hanoi"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2007.07.009"},{"key":"ref9","article-title":"A landscape analysis for a hybrid approximate algorithm on a timetabling problem","author":"chiarandini","year":"2003","journal-title":"TU Darmstadt Technical Report AIDA-03&#x2013;05"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.06.051"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1996.34"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/inte.24.3.109"},{"key":"ref21","article-title":"A hybrid genetic algorithm for examination timetabling problem","author":"weare","year":"1995","journal-title":"Computer Science Technical Report No NOTTCS-TR-1995&#x2013;8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.193"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90321-L"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-5915.1984.tb01226.x"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(84)90036-4"}],"event":{"name":"2011 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2011,6,5]]},"location":"New Orleans, LA, USA","end":{"date-parts":[[2011,6,8]]}},"container-title":["2011 IEEE Congress of Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5936494\/5949581\/05949638.pdf?arnumber=5949638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T03:25:39Z","timestamp":1497929139000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5949638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/cec.2011.5949638","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}