{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T14:46:57Z","timestamp":1785336417014,"version":"3.55.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10951-022-00747-5","type":"journal-article","created":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T05:02:58Z","timestamp":1658293378000},"page":"497-517","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Simulated annealing with penalization for university course timetabling"],"prefix":"10.1007","volume":"26","author":[{"given":"Kadri","family":"Sylejmani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edon","family":"Gashi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Ymeri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,20]]},"reference":[{"key":"747_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2015.07.002","volume":"65","author":"R Bellio","year":"2016","unstructured":"Bellio, R., Ceschia, S., Di Gaspero, L., Schaerf, A., & Urli, T. (2016). Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Computers & Operations Research, 65, 83\u201392.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"747_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11750-015-0366-z","volume":"23","author":"A Bettinelli","year":"2015","unstructured":"Bettinelli, A., Cacchiani, V., Roberti, R., & Toth, P. (2015). An overview of curriculum-based course timetabling. Top, 23(2), 313\u2013349.","journal-title":"Top"},{"key":"747_CR3","unstructured":"Bykov Y. (2003). The description of the algorithm for international timetabling competition. International Timetable Competition,"},{"issue":"1","key":"747_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-010-0737-7","volume":"194","author":"H Cambazard","year":"2012","unstructured":"Cambazard, H., Hebrard, E., O\u2019Sullivan, B., & Papadopoulos, A. (2012). Local search and constraint programming for the post enrolment-based course timetabling problem. Annals of Operations Research, 194(1), 111\u2013135.","journal-title":"Annals of Operations Research"},{"issue":"7","key":"747_CR5","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.cor.2011.09.014","volume":"39","author":"S Ceschia","year":"2012","unstructured":"Ceschia, S., Di Gaspero, L., & Schaerf, A. (2012). Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Computers & Operations Research, 39(7), 1615\u20131624.","journal-title":"Computers & Operations Research"},{"key":"747_CR6","unstructured":"Cordeau1, R. M., Cordeau, J. -F., Jaumard, B., & Morales, R. (2003). Efficient timetabling solution with tabu search."},{"key":"747_CR7","unstructured":"Di Gaspero, L. & Schaerf, A. (2003). Timetabling competition ttcomp 2002: solver description. International Timetabling Competition."},{"key":"747_CR8","unstructured":"Di Gaspero, L., McCollum, B., & Schaerf, A. (2007). The second international timetabling competition (itc-2007): Curriculum-based course timetabling (track 3). Citeseer: Technical report."},{"key":"747_CR9","unstructured":"Eckersley, A. (2004). An investigation of case-based heuristic selection for university timetabling."},{"key":"747_CR10","unstructured":"Efstratios, R., Eric, i., Robert, S., & Heche, J.-F. (2021). International timetabling competition 2019: A mixed integer programming approach for solving university timetabling problems."},{"key":"747_CR11","unstructured":"Er-rhaimini, K. (2021). Forest growth optimization for solving timetabling problems."},{"key":"747_CR12","unstructured":"Gashi, E., & Sylejmani, K. (2020). Simulated annealing with penalization for university course timetabling."},{"issue":"1","key":"747_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10479-010-0703-4","volume":"194","author":"MJ Geiger","year":"2012","unstructured":"Geiger, M. J. (2012). Applying the threshold accepting metaheuristic to curriculum based course timetabling. Annals of Operations Research, 194(1), 189\u2013202.","journal-title":"Annals of Operations Research"},{"issue":"6","key":"747_CR14","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1080\/01605682.2018.1468862","volume":"70","author":"SL Goh","year":"2019","unstructured":"Goh, S. L., Kendall, G., & Sabar, N. R. (2019). Simulated annealing with improved reheating and learning for the post enrolment course timetabling problem. Journal of the Operational Research Society, 70(6), 873\u2013888.","journal-title":"Journal of the Operational Research Society"},{"issue":"12","key":"747_CR15","doi-asserted-by":"publisher","first-page":"3074","DOI":"10.1016\/j.cor.2012.03.011","volume":"39","author":"A Gunawan","year":"2012","unstructured":"Gunawan, A., Ng, K. M., & Poh, K. L. (2012). A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem. Computers & Operations Research, 39(12), 3074\u20133088.","journal-title":"Computers & Operations Research"},{"key":"747_CR16","doi-asserted-by":"crossref","unstructured":"Henderson, D., Jacobson, S.H., & Johnson, A.W. (2003). The theory and practice of simulated annealing. In Handbook of metaheuristics, (pp. 287\u2013319). Springer.","DOI":"10.1007\/0-306-48056-5_10"},{"key":"747_CR17","doi-asserted-by":"crossref","unstructured":"Holm, D.\u00a0S., Mikkelsen, R.\u00a0\u00d8., S\u00f8rensen, M., & Stidsen, T.\u00a0R. (2021). A mip based approach for international timetabling competation 2019.","DOI":"10.1007\/s10951-022-00724-y"},{"key":"747_CR18","unstructured":"Holm, D.\u00a0S\u00f8., Mikkelsen, R. \u00d8., S\u00f8rensen, M., & Stidsen, T. J. R. (2020). A mip formulation of the international timetabling competition 2019 problem."},{"key":"747_CR19","doi-asserted-by":"crossref","unstructured":"Kalender, M., Kheiri, A., \u00d6zcan, E., & Burke, E.\u00a0K. (2012). A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem. In 2012 12th UK workshop on computational intelligence (UKCI), (pp. 1\u20138). IEEE","DOI":"10.1109\/UKCI.2012.6335754"},{"issue":"5\u20136","key":"747_CR20","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S Kirkpatrick","year":"1984","unstructured":"Kirkpatrick, S. (1984). Optimization by simulated annealing: Quantitative studies. Journal of Statistical Physics, 34(5\u20136), 975\u2013986.","journal-title":"Journal of Statistical Physics"},{"key":"747_CR21","unstructured":"Kostuch, P. (2003). Timetabling competition-sa-based heuristic. International Timetabling Competition."},{"key":"747_CR22","unstructured":"Lemos, A., Monteiro, P.\u00a0T., & Lynce, I. (2021). Itc-2019: A maxsat approach to solve university timetabling problems."},{"issue":"3","key":"747_CR23","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/j.ejor.2005.02.065","volume":"174","author":"A Lim","year":"2006","unstructured":"Lim, A., Rodrigues, B., & Zhang, X. (2006). A simulated annealing and hill-climbing algorithm for the traveling tournament problem. European Journal of Operational Research, 174(3), 1459\u20131478.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"747_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., & Hao, J.-K. (2010). Adaptive tabu search for course timetabling. European Journal of Operational Research, 200(1), 235\u2013244.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"747_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M Lundy","year":"1986","unstructured":"Lundy, M., & Mees, A. (1986). Convergence of an annealing algorithm. Mathematical Programming, 34(1), 111\u2013124.","journal-title":"Mathematical Programming"},{"key":"747_CR26","volume-title":"Fundamentals of software engineering","author":"R Mall","year":"2018","unstructured":"Mall, R. (2018). Fundamentals of software engineering. Delhi: PHI Learning Pvt. Ltd."},{"key":"747_CR27","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.cor.2016.06.018","volume":"76","author":"I M\u00e9ndez-D\u00edaz","year":"2016","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P., & Miranda-Bront, J. J. (2016). An ilp based heuristic for a generalization of the post-enrollment course timetabling problem. Computers & Operations Research, 76, 195\u2013207.","journal-title":"Computers & Operations Research"},{"key":"747_CR28","unstructured":"M\u00fcller, T., Rudov\u00e1, H., & M\u00fcllerov\u00e1, Z. (2018). University course timetabling and international timetabling competition 2019. In Proceedings of 12th international conference on the practice and theory of automated timetabling (PATAT), (p.\u00a027)."},{"issue":"1","key":"747_CR29","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T M\u00fcller","year":"2009","unstructured":"M\u00fcller, T. (2009). Itc 2007 solver description: a hybrid approach. Annals of Operations Research, 172(1), 429.","journal-title":"Annals of Operations Research"},{"key":"747_CR30","doi-asserted-by":"crossref","unstructured":"Nadel, A. (2019). Anytime weighted maxsat with improved polarity selection and bit-vector optimization. In 2019 Formal methods in computer aided design (FMCAD), (pp. 193\u2013202). IEEE.","DOI":"10.23919\/FMCAD.2019.8894273"},{"key":"747_CR31","doi-asserted-by":"crossref","unstructured":"Nagata, Y. (2018). Random partial neighborhood search for the post-enrollment course timetabling problem. Computers & Operations Research,90, 84\u201396.","DOI":"10.1016\/j.cor.2017.09.014"},{"key":"747_CR32","unstructured":"Paechter, B., Gambardella, L. M., & Rossi-Doria, O. (2002). The first international timetabling competition. http:\/\/www.idsia.ch\/Files\/ttcomp2002,"},{"issue":"3","key":"747_CR33","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/ijoc.4.3.311","volume":"4","author":"JM Stern","year":"1992","unstructured":"Stern, J. M. (1992). Simulated annealing with a temperature dependent penalty function. ORSA Journal on Computing, 4(3), 311\u2013319.","journal-title":"ORSA Journal on Computing"},{"issue":"15","key":"747_CR34","doi-asserted-by":"publisher","first-page":"3003","DOI":"10.1103\/PhysRevLett.82.3003","volume":"82","author":"W Wenzel","year":"1999","unstructured":"Wenzel, W., & Hamacher, K. (1999). Stochastic tunneling approach for global minimization of complex potential energy landscapes. Physical Review Letters, 82(15), 3003.","journal-title":"Physical Review Letters"},{"issue":"2","key":"747_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1504\/IJCSM.2015.069461","volume":"6","author":"S Zheng","year":"2015","unstructured":"Zheng, S., Wang, L., Liu, Y., & Zhang, R. (2015). A simulated annealing algorithm for university course timetabling considering travelling distances. International Journal of Computing Science and Mathematics, 6(2), 139\u2013151.","journal-title":"International Journal of Computing Science and Mathematics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00747-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00747-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00747-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T09:06:49Z","timestamp":1694855209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00747-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["747"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00747-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"9 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}