{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T01:40:25Z","timestamp":1768700425974,"version":"3.49.0"},"reference-count":20,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,1,24]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Timetabling problems are specific types of scheduling problems that deal with assigning certain events to the timeslots. This assigning is subject to certain hard constraints that should be achieved to get a feasible timetable and soft constraints that must meet as many as possible during forming a feasible schedule. This paper introduces an adaptive tabu search. Eleven benchmark datasets of the year 2002 are applied to show the effectiveness of the introduced algorithm. These datasets consist of 5-small, 5-medium, and 1-large dataset. As compared to other methods from previous works, the proposed algorithm produces excellent timetables, in comparison with the algorithms as well as the current results, the mathematical results showed the high effectiveness of the suggested algorithm. It has a minor deficit on the medium or the small problem adaptive Tabu, and the tabu search relies on the tabu list and penalty cost when the change in the penalty cost is checked; if it is still unchanged for the period of iterations (1,000 iterations), the tabu list reduces automatically by (\u22122); furthermore, the tabu list remains constant.<\/jats:p>","DOI":"10.1515\/jisys-2022-0003","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T17:17:19Z","timestamp":1643735839000},"page":"168-176","source":"Crossref","is-referenced-by-count":6,"title":["Large-scale timetabling problems with adaptive tabu search"],"prefix":"10.1515","volume":"31","author":[{"given":"Fouad H.","family":"Awad","sequence":"first","affiliation":[{"name":"College of Computer Science & Information Technology, University of Anbar , Anbar , Iraq"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Al-kubaisi","sequence":"additional","affiliation":[{"name":"Computer Center University of Anbar , Anbar , Iraq"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maha","family":"Mahmood","sequence":"additional","affiliation":[{"name":"College of Computer Science & Information Technology, University of Anbar , Anbar , Iraq"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"2025120523411421963_j_jisys-2022-0003_ref_001","doi-asserted-by":"crossref","unstructured":"Osorio A, Esquivel M. A solution to the university course timetabling problem using a hybrid method based on genetic algorithms. Dyna. 2020;87(215):47\u201356.","DOI":"10.15446\/dyna.v87n215.85933"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_002","doi-asserted-by":"crossref","unstructured":"Amin R, Abshirini Z, Boshkani Zade M. Solving University course timetabling problem using parallel genetic algorithm. Int J Sci Res Comput Sci Eng. 2019;7.5:5\u201313.","DOI":"10.26438\/ijsrcse\/v7i5.513"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_003","doi-asserted-by":"crossref","unstructured":"Khiarak NJ, Zamani-Harghalani Y, Derakhshi M-RF. Combined multi-agent method to control inter-department common events collision for university courses timetabling. J Intell Syst. 2020;29(1):110\u201326. 10.1515\/jisys-2017-0249.","DOI":"10.1515\/jisys-2017-0249"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_004","doi-asserted-by":"crossref","unstructured":"Abu Doush I, Al-Betar MA, Awadallah MA, Hammouri AI, Al-Khatib RM, ElMustafa S, et al. Harmony search algorithm for patient admission scheduling problem. J Intell Syst. 2020;29(1):540\u201353. 10.1515\/jisys-2018-0094.","DOI":"10.1515\/jisys-2018-0094"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_005","doi-asserted-by":"crossref","unstructured":"Wei M, Yang Y, Su J, Li Q, Liang Z. Task reallocating for responding to design change in complex product design. J Intell Syst. 2019;28(1):57\u201376. 10.1515\/jisys-2016-0262.","DOI":"10.1515\/jisys-2016-0262"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_006","doi-asserted-by":"crossref","unstructured":"Abdullah S, Turabieh H, McCollum B, McMullan P. A hybrid metaheuristic approach to the university course timetabling problem. J Heuristics. 2012;18:1\u201323. 10.1007\/s10732-010-9154-y.","DOI":"10.1007\/s10732-010-9154-y"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_007","doi-asserted-by":"crossref","unstructured":"Bolaji AL, Okwonu FZ, Shola PB, Balogun BS, Adubisi OD. A modified binary pigeon-inspired algorithm for solving the multi-dimensional knapsack problem. J Intell Syst. 2021;30(1):90\u2013103. 10.1515\/jisys-2018-0450.","DOI":"10.1515\/jisys-2018-0450"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_008","doi-asserted-by":"crossref","unstructured":"Turabieh H, Abdullah S. Incorporating tabu search into memetic approach for enrolment-based course timetabling problems. 2009 2nd Conference on Data Mining and Optimization. Selangor, Malaysia: IEEE; 27\u201328 October 2009. p. 115\u20139.","DOI":"10.1109\/DMO.2009.5341901"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_009","doi-asserted-by":"crossref","unstructured":"Ayob M, Jaradat GH. Hybrid ant colony systems for course timetabling problems. 2nd Conference on Data Mining and Optimization. Selangor, Malaysia: IEEE; 27\u201328 October 2009. p. 120\u20136.","DOI":"10.1109\/DMO.2009.5341898"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_010","doi-asserted-by":"crossref","unstructured":"Sadaf Jat N, Yang SH. A memetic algorithm for the university course timetabling problem. 20th IEEE International Conference on Tools with Artificial Intelligence; 2008. p. 427\u201333.","DOI":"10.1109\/ICTAI.2008.126"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_011","doi-asserted-by":"crossref","unstructured":"Yang SH, Naseem Jat S. Genetic algorithms with guided and local search strategies for university course timetabling. IEEE Trans Systems, Man, Cybernetics-Part C: Appl Rev. January 2011;41(1):93\u2013106.","DOI":"10.1109\/TSMCC.2010.2049200"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_012","doi-asserted-by":"crossref","unstructured":"Jyoti M, Monga H, Baghla S. Reduction of inter-symbol interference using artifical neural network system in multicarrier OFDM system. Int J Wirel Microw Technol. 2018;8:10\u20138.","DOI":"10.5815\/ijwmt.2018.05.02"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_013","doi-asserted-by":"crossref","unstructured":"Abuhamdah A, Ayob M. Adaptive randomized descent algorithm using round robin for solving course timetabling problems. 10th International Conference on Intelligent Systems Design and Applications, IEEE; 2010. p. 1201\u20136.","DOI":"10.1109\/ISDA.2010.5687021"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_014","doi-asserted-by":"crossref","unstructured":"Azmi Al-Betar M, Tajudin Khader A, Yi Liao I. A harmony search with multi-pitch adjusting rate for the university course timetabling. Berlin Heidelberg: Springer-Verlag; 2010. p. 147\u201361.","DOI":"10.1007\/978-3-642-04317-8_13"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_015","doi-asserted-by":"crossref","unstructured":"Hossein Karami A, Hasanzadeh M. University course timetabling using a new hybrid genetic algorithm. 2nd International Conference on Computer and Knowledge Engineering (ICCKE); October 18\u201319 2012. p. 144\u20139.","DOI":"10.1109\/ICCKE.2012.6395368"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_016","doi-asserted-by":"crossref","unstructured":"Henry Obit J, Landa-Silva D. Computational study of non-linear great deluge for university course timetabling. Berlin Heidelberg: Springer-Verlag; 2010. p. 309\u201328.","DOI":"10.1007\/978-3-642-13428-9_14"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_017","doi-asserted-by":"crossref","unstructured":"Ghaith Jaradat M, Ayob M. Big bang-big crunch optimization algorithm to solve the course timetabling problem. 10th International Conference on Intelligent Systems Design and Applications. Selangor, Malaysia: Data Mining and Optimization Research Group The National University of Malaysia B.B.Bangi; p. 1448\u201352.","DOI":"10.1109\/ISDA.2010.5687114"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_018","doi-asserted-by":"crossref","unstructured":"Zheng N, Chen T, Lin F, Xu H. A hybrid heuristic algorithm for the intelligent transportation scheduling problem of the BRT system. J Intell Syst. 2015;24(4):437\u201348. 10.1515\/jisys-pp.2014-0134.","DOI":"10.1515\/jisys-2014-0134"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_019","doi-asserted-by":"crossref","unstructured":"Ceschia S, Di Gaspero L, Schaerf A. Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Comput Oper Res. 2012;39:1615\u201324.","DOI":"10.1016\/j.cor.2011.09.014"},{"key":"2025120523411421963_j_jisys-2022-0003_ref_020","doi-asserted-by":"crossref","unstructured":"Alirezaei E, Vahedi Z, Ghaznavi-Ghoushchi M. Parallel hybrid meta heuristic algorithm for university course timetabling problem. 20th Iranian Conference on Electrical Engineering, (ICEE2012). Tehran, Iran: IEEE; May 15\u201317 2012. p. 673\u20138.","DOI":"10.1109\/IranianCEE.2012.6292439"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2022-0003\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2022-0003\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:42:51Z","timestamp":1764978171000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2022-0003\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,1]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,3,14]]},"published-print":{"date-parts":[[2022,3,14]]}},"alternative-id":["10.1515\/jisys-2022-0003"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2022-0003","relation":{},"ISSN":["2191-026X"],"issn-type":[{"value":"2191-026X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,1]]}}}