{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:59:00Z","timestamp":1761807540336,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121388"},{"type":"electronic","value":"9783642121395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12139-5_1","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T14:46:40Z","timestamp":1270046800000},"page":"1-10","source":"Crossref","is-referenced-by-count":12,"title":["Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling"],"prefix":"10.1007","author":[{"given":"Salwani","family":"Abdullah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalid","family":"Shaker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"McCollum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"McMullan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"1_CR1","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Kendall, G., Soubeiga, E.: A tabu search hyperheuristic for timetabling and rostering. Journal of Heuristics\u00a09(6), 451\u2013470 (2003)","journal-title":"Journal of Heuristics"},{"key":"1_CR2","series-title":"Natural Computing Series","volume-title":"Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization","author":"C. Sekhar Pedamallu","year":"2008","unstructured":"Sekhar Pedamallu, C., \u00d6zdamar, L.: Comparison of Simulated Annealing. In: Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization. Natural Computing Series. Springer, Heidelberg (2008)"},{"key":"1_CR3","unstructured":"Sekhar Pedamallu, C., \u00d6zdamar, L.: Investigating a hybrid simulated annealing and local search algorithm for constrained optimization. In: EJOR (2006) (in press), \n                  \n                    http:\/\/dx.doi.org\/0,1016\/j.ejor.2006.06.050"},{"key":"1_CR4","unstructured":"Abdullah, S., Burke, E.K., McCollum, B.: An Investigation of Variable Neighbourhood Search for Course Timetabling. In: The Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2005), New York, USA, July 18 -21, pp. 413\u2013427 (2005)"},{"key":"1_CR5","first-page":"153","volume-title":"Metaheuristics Progress in Complex Systems Optimization","author":"S. Abdullah","year":"2007","unstructured":"Abdullah, S., Burke, E.K., McCollum, B.: Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for University Course Timetabling. In: Metaheuristics Progress in Complex Systems Optimization, pp. 153\u2013169. Springer, Heidelberg (2007)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Burke, E.K., McCollum, B.: A Hybrid Evolutionary Approach to the University Course Timetabling Problem. In: IEEE Congres on Evolutionary Computation, pp. 1764\u20131768 (2007) ISBN: 1-4244-1340-0","DOI":"10.1109\/CEC.2007.4424686"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-540-72584-8_71","volume-title":"Computational Science \u2013 ICCS 2007","author":"P. McMullan","year":"2007","unstructured":"McMullan, P.: An Extended Implementation of the Great Deluge Algorithm for Course Timetabling. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol.\u00a04487, pp. 538\u2013545. Springer, Heidelberg (2007)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Ant Algorithms","author":"K. Socha","year":"2002","unstructured":"Socha, K., Knowles, J., Samples, M.: A max-min ant system for the university course timetabling problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 1\u201313. Springer, Heidelberg (2002)"},{"key":"1_CR9","first-page":"1","volume-title":"Proceedings of the 2008 IEEE Conference on Intelligent Systems (IS 2008)","author":"D. Landa-Silva","year":"2008","unstructured":"Landa-Silva, D., Obit, J.H.: Great Deluge with Nonlinear Decay Rate for Solving Course Timetabling Problems. In: Proceedings of the 2008 IEEE Conference on Intelligent Systems (IS 2008), pp. 8.11\u20138.18. IEEE Press, Los Alamitos (2008)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Hedar, A.-R., Fukushima, M.: Derivative-free filter simulated annealing method for constrained continuous global optimization. Journal of Global Optimization (2006) (to appear)","DOI":"10.1007\/s10898-005-3693-z"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Turabieh, H.: Generating university course timetable using genetic algorithms and local search. In: The Third 2008 International Conference on Convergence and Hybrid Information Technology ICCIT, vol.\u00a0I, pp. 254\u2013260 (2008)","DOI":"10.1109\/ICCIT.2008.379"},{"issue":"2","key":"1_CR12","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. Iin automated timetabling. European Journal of Operation Research\u00a0140(2), 266\u2013280 (2002)","journal-title":"European Journal of Operation Research"},{"key":"1_CR13","unstructured":"Lewis, R., Paechter, B., McCollum, B.: Post enrolment based course timetabling: A description of the problem model used for track two of the second international timetabling competition Technical Report, Cardiff University (2007)"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R. Lewis","year":"2008","unstructured":"Lewis, R.: A survey of metaheuristic based techniques for university timetabling problems. OR Spectrum\u00a030(1), 167\u2013190 (2008)","journal-title":"OR Spectrum"},{"issue":"1","key":"1_CR15","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.: 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"},{"issue":"1","key":"1_CR16","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(1), 177\u2013192 (2007)","journal-title":"European Journal of Operational Research"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-540-45157-0_22","volume-title":"Practice and Theory of Automated Timetabling IV","author":"O. Rossi-Doria","year":"2003","unstructured":"Rossi-Doria, O., Samples, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L.M., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., St\u00fctzle, T.: A comparison of the performance of different meta-heuristics on the timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 329\u2013354. Springer, Heidelberg (2003)"},{"key":"1_CR18","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-642-02962-2_63","volume-title":"Rough Sets and Knowledge Technology","author":"H. Turabieh","year":"2009","unstructured":"Turabieh, H., Abdullah, S., McCollum, B.: Electromagnetism-like Mechanism with Force Decay rate Great Deluge for the Course Timetabling problem. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds.) RSKT 2009. LNCS (LNAI), vol.\u00a05589, pp. 497\u2013504. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12139-5_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:03:32Z","timestamp":1619784212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12139-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121388","9783642121395"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12139-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}