{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:06:21Z","timestamp":1762430781314},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642420535"},{"type":"electronic","value":"9783642420542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-42054-2_9","type":"book-chapter","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T10:25:29Z","timestamp":1383042329000},"page":"66-73","source":"Crossref","is-referenced-by-count":4,"title":["A Two Stage Approach for High School Timetabling"],"prefix":"10.1007","author":[{"given":"Moh\u2019d Khaled Yousef","family":"Shambour","sequence":"first","affiliation":[]},{"given":"Ahamad Tajudin","family":"Khader","sequence":"additional","affiliation":[]},{"given":"Ahmed","family":"Kheiri","sequence":"additional","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","first-page":"1","volume":"16","author":"D.A. Abramson","year":"1999","unstructured":"Abramson, D.A., Dang, H., Krisnamoorthy, M.: Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research\u00a016(1), 1\u201322 (1999)","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-010-0769-z","volume":"194","author":"M.A. Al-Betar","year":"2012","unstructured":"Al-Betar, M.A., Khader, A.T.: A harmony search algorithm for university course timetabling. Annals of Operations Research\u00a0194(1), 3\u201331 (2012)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10462-010-9201-y","volume":"36","author":"O.M. Alia","year":"2011","unstructured":"Alia, O.M., Mandava, R.: The variants of the harmony search algorithm: an overview. Artificial Intelligence Review\u00a036(1), 49\u201368 (2011)","journal-title":"Artificial Intelligence Review"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-27242-4_4","volume-title":"Swarm, Evolutionary, and Memetic Computing","author":"M.A. Awadallah","year":"2011","unstructured":"Awadallah, M.A., Khader, A.T., Al-Betar, M.A., Bolaji, A.: Nurse rostering using modified harmony search algorithm. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds.) SEMCCO 2011, Part II. LNCS, vol.\u00a07077, pp. 27\u201337. Springer, Heidelberg (2011)"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-008-0088-2","volume":"12","author":"T. Birbas","year":"2009","unstructured":"Birbas, T., Daskalaki, S., Housos, E.: School timetabling for quality student and teacher schedules. Journal of Scheduling\u00a012(2), 177\u2013197 (2009)","journal-title":"Journal of Scheduling"},{"key":"9_CR6","unstructured":"Domr\u00f6s, J., Homberger, J.: An evolutionary algorithm for high school timetabling. In: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), pp. 485\u2013488 (2012)"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM Journal on Computing\u00a05(4), 691\u2013703 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/978-3-642-32639-4_66","volume-title":"Intelligent Data Engineering and Automated Learning - IDEAL 2012","author":"G.H.G. Fonseca","year":"2012","unstructured":"Fonseca, G.H.G., Brito, S.S., Santos, H.G.: A simulated annealing based approach to the high school timetabling problem. In: Yin, H., Costa, J.A.F., Barreto, G. (eds.) IDEAL 2012. LNCS, vol.\u00a07435, pp. 540\u2013549. Springer, Heidelberg (2012)"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"Z.W. Geem","year":"2001","unstructured":"Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: Harmony search. Simulation\u00a076(2), 60\u201368 (2001)","journal-title":"Simulation"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Hoang, D.C., Yadav, P., Kumar, R., Panda, S.: A robust harmony search algorithm based clustering protocol for wireless sensor networks. In: 2010 IEEE International Conference on Communications Workshops (ICC), pp. 1\u20135 (2010)","DOI":"10.1109\/ICCW.2010.5503895"},{"key":"9_CR11","unstructured":"Kheiri, A., \u00d6zcan, E., Parkes, A.J.: Hysst: Hyper-heuristic search strategies and timetabling. In: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), pp. 497\u2013499 (2012)"},{"key":"9_CR12","unstructured":"Kingston, J.H.: A software library for high school timetabling (2009), \n                  \n                    http:\/\/sydney.edu.au\/engineering\/it\/~jeff\/khe\/"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/11593577_13","volume-title":"Practice and Theory of Automated Timetabling V","author":"J.H. Kingston","year":"2005","unstructured":"Kingston, J.H.: A tiling algorithm for high school timetabling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 208\u2013225. Springer, Heidelberg (2005)"},{"key":"9_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-540-88636-5_63","volume-title":"MICAI 2008: Advances in Artificial Intelligence","author":"C. Lara","year":"2008","unstructured":"Lara, C., Flores, J.J., Calder\u00f3n, F.: Solving a school timetabling problem using a bee algorithm. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol.\u00a05317, pp. 664\u2013674. Springer, Heidelberg (2008)"},{"key":"9_CR15","series-title":"SCI","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-12090-9_26","volume-title":"Advances in Intelligent Information and Database Systems","author":"K.N.T.T. Minh","year":"2010","unstructured":"Minh, K.N.T.T., Thanh, N.D.T., Trang, K.T., Hue, N.T.T.: Using tabu search for solving a high school timetabling problem. In: Nguyen, N.T., Katarzyniak, R., Chen, S.-M. (eds.) Advances in Intelligent Information and Database Systems. SCI, vol.\u00a0283, pp. 305\u2013313. Springer, Heidelberg (2010)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Pillay, N.: A survey of school timetabling research. Annals of Operations Research, 1\u201333 (2013)","DOI":"10.1007\/s10479-013-1321-8"},{"key":"9_CR17","unstructured":"Post, G.: Benchmarking project for high school timetabling (2011), \n                  \n                    http:\/\/www.utwente.nl\/ctit\/hstt\/"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10479-010-0699-9","volume":"194","author":"G. Post","year":"2012","unstructured":"Post, G., Ahmadi, S., Daskalaki, S., Kingston, J.H., Kyngas, J., Nurmi, C., Ranson, D.: An xml format for benchmarks in high school timetabling. Annals of Operations Research\u00a0194(1), 385\u2013397 (2012)","journal-title":"Annals of Operations Research"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Post, G., Gaspero, L., Kingston, J.H., McCollum, B., Schaerf, A.: The third international timetabling competition. Annals of Operations Research, 1\u20137 (2013)","DOI":"10.1007\/s10479-013-1340-5"},{"key":"9_CR20","unstructured":"S\u00f8rensen, M., Kristiansen, S., Stidsen, T.R.: International timetabling competition 2011: an adaptive large neighborhood search algorithm. In: Proceedings of the Ninth International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012). pp. 489\u2013492 (2012)"},{"issue":"11","key":"9_CR21","doi-asserted-by":"publisher","first-page":"3472","DOI":"10.1016\/j.asoc.2012.05.029","volume":"12","author":"I.X. Tassopoulos","year":"2012","unstructured":"Tassopoulos, I.X., Beligiannis, G.N.: A hybrid particle swarm optimization based algorithm for high school timetabling problems. Applied Soft Computing\u00a012(11), 3472\u20133489 (2012)","journal-title":"Applied Soft Computing"},{"issue":"10","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1016\/S0305-0548(02)00083-7","volume":"30","author":"C. Valouxis","year":"2003","unstructured":"Valouxis, C., Housos, E.: Constraint programming approach for school timetabling. Computers and Operations Research\u00a030(10), 1555\u20131572 (2003)","journal-title":"Computers and Operations Research"},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"50","DOI":"10.4018\/jamc.2010040104","volume":"1","author":"D. Weyland","year":"2010","unstructured":"Weyland, D.: A rigorous analysis of the harmony search algorithm: How the research community can be misled by a \u201cnovel\u201d methodology. International Journal of Applied Metaheuristic Computing\u00a01(2), 50\u201360 (2010)","journal-title":"International Journal of Applied Metaheuristic Computing"},{"key":"9_CR24","unstructured":"Wilke, P., Killer, H.: Walk down jump up algorithm a new hybrid algorithm for timetabling problems. In: Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010), pp. 440\u2013446 (2010)"},{"issue":"7","key":"9_CR25","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1016\/j.asoc.2013.02.013","volume":"13","author":"Y. Yuan","year":"2013","unstructured":"Yuan, Y., Xu, H., Yang, J.: A hybrid harmony search algorithm for the flexible job shop scheduling problem. Applied Soft Computing\u00a013(7), 3259\u20133272 (2013)","journal-title":"Applied Soft Computing"},{"issue":"10","key":"9_CR26","doi-asserted-by":"publisher","first-page":"1678","DOI":"10.1016\/j.jss.2010.04.070","volume":"83","author":"D. Zou","year":"2010","unstructured":"Zou, D., Gao, L., Li, S., Wu, J., Wang, X.: A novel global harmony search algorithm for task assignment problem. Journal of Systems and Software\u00a083(10), 1678\u20131688 (2010)","journal-title":"Journal of Systems and Software"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-42054-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:49:26Z","timestamp":1558658966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-42054-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642420535","9783642420542"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-42054-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}