{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:40:56Z","timestamp":1740807656807,"version":"3.38.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T00:00:00Z","timestamp":1735862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T00:00:00Z","timestamp":1735862400000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00521-024-10941-5","type":"journal-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T17:00:18Z","timestamp":1735923618000},"page":"5635-5653","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Course time scheduling problem for distance education considering server load balancing: a case of an engineering faculty"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9874-7588","authenticated-orcid":false,"given":"Hac\u0131 Mehmet","family":"Alaka\u015f","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3424-2967","authenticated-orcid":false,"given":"Mehmet","family":"P\u0131narba\u015f\u0131","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6112-9460","authenticated-orcid":false,"given":"Bedirhan","family":"Sar\u0131mehmet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5282-3138","authenticated-orcid":false,"given":"Tamer","family":"Eren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,3]]},"reference":[{"key":"10941_CR1","doi-asserted-by":"publisher","first-page":"657","DOI":"10.21923\/jesd.331259","volume":"5","author":"N Bedir","year":"2017","unstructured":"Bedir N, Eren T, Dizdar EN (2017) Ergonomik ergonomik personel \u00e7izelgeleme ve perakende sekt\u00f6r\u00fcnde bir uygulama. M\u00fchendis Bilimleri ve Tasar Derg. 5:657\u2013673. https:\/\/doi.org\/10.21923\/jesd.331259","journal-title":"M\u00fchendis Bilimleri ve Tasar Derg."},{"key":"10941_CR2","doi-asserted-by":"publisher","first-page":"7525","DOI":"10.1002\/er.5480","volume":"44","author":"EH \u00d6zder","year":"2020","unstructured":"\u00d6zder EH, \u00d6zcan E, Eren T (2020) Sustainable personnel scheduling supported by an artificial neural network model in a natural gas combined cycle power plant. Int J Energy Res 44:7525\u20137547. https:\/\/doi.org\/10.1002\/er.5480","journal-title":"Int J Energy Res"},{"key":"10941_CR3","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia - Pac J Op Res 18:193\u2013242","journal-title":"Asia - Pac J Op Res"},{"issue":"3","key":"10941_CR4","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1109\/TASE.2019.2953669","volume":"17","author":"Z Zhao","year":"2019","unstructured":"Zhao Z, Liu S, Zhou M, Guo X, Qi L (2019) Decomposition method for new single-machine scheduling problems from steel production systems. IEEE Trans Autom Sci Eng 17(3):1376\u20131387. https:\/\/doi.org\/10.1109\/TASE.2019.2953669","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"10941_CR5","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/J.OCEANENG.2017.11.044","volume":"148","author":"J Cullum","year":"2018","unstructured":"Cullum J, Binns J, Lonsdale M, Abbassi R, Garaniya V (2018) Risk-based maintenance scheduling with application to naval vessels and ships. Ocean Eng 148:476\u2013485. https:\/\/doi.org\/10.1016\/J.OCEANENG.2017.11.044","journal-title":"Ocean Eng"},{"key":"10941_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/J.APM.2018.11.008","volume":"67","author":"Y Qin","year":"2019","unstructured":"Qin Y, Wang ZX, Chan FT, Chung SH, Qu T (2019) A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem. Appl Math Model 67:491\u2013509. https:\/\/doi.org\/10.1016\/J.APM.2018.11.008","journal-title":"Appl Math Model"},{"key":"10941_CR7","doi-asserted-by":"publisher","unstructured":"Chu S.C., Chen Y.T., Ho J.H. (2006) Timetable Scheduling Using Particle Swarm Optimization, In: first \u0131nternational conference on \u0131nnovative computing, \u0131nformation and control-Volume I (ICICIC\u201906), 324\u2013327. https:\/\/doi.org\/10.1109\/ICICIC.2006.541.","DOI":"10.1109\/ICICIC.2006.541"},{"key":"10941_CR8","doi-asserted-by":"publisher","unstructured":"Sigl B., Golub M., Mornar V. (2003) Solving timetable scheduling problem using genetic algorithms, in: Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003. 519\u2013524. https:\/\/doi.org\/10.1109\/ITI.2003.1225396.","DOI":"10.1109\/ITI.2003.1225396"},{"issue":"2","key":"10941_CR9","first-page":"119","volume":"19","author":"T Eren","year":"2004","unstructured":"Eren T, G\u00fcner E (2004) \u00d6\u011frenme etkili ak\u0131\u015f tipi \u00e7izelgelemede ortalama ak\u0131\u015f zaman\u0131n\u0131n enk\u00fc\u00e7\u00fcklenmesi. J Faculty Eng Archit Gazi Univ 19(2):119\u2013124","journal-title":"J Faculty Eng Archit Gazi Univ"},{"key":"10941_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/J.ESWA.2010.06.051","volume":"38","author":"DF Shiau","year":"2011","unstructured":"Shiau DF (2011) A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences. Expert Syst Appl 38:235\u2013248. https:\/\/doi.org\/10.1016\/J.ESWA.2010.06.051","journal-title":"Expert Syst Appl"},{"key":"10941_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10479-015-2094-z","volume":"252","author":"AE Phillips","year":"2017","unstructured":"Phillips AE, Walker CG, Ehrgott M, Ryan DM (2017) Integer programming for minimal perturbation problems in university course timetabling. Ann Oper Res 252:283\u2013304. https:\/\/doi.org\/10.1007\/s10479-015-2094-z","journal-title":"Ann Oper Res"},{"key":"10941_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/J.ESWA.2019.02.026","volume":"127","author":"SI Hossain","year":"2019","unstructured":"Hossain SI, Akhand MAH, Shuvo MIR, Siddique N, Adeli H (2019) Optimization of university course scheduling problem using particle swarm optimization with selective search. Expert Syst Appl 127:9\u201324. https:\/\/doi.org\/10.1016\/J.ESWA.2019.02.026","journal-title":"Expert Syst Appl"},{"key":"10941_CR13","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10462-015-9437-7","volume":"44","author":"S Larabi Marie-Sainte","year":"2015","unstructured":"Larabi Marie-Sainte S (2015) A survey of particle swarm optimization techniques for solving university examination timetabling problem. Artif Intell Rev 44:537\u2013546. https:\/\/doi.org\/10.1007\/s10462-015-9437-7","journal-title":"Artif Intell Rev"},{"issue":"6","key":"10941_CR14","doi-asserted-by":"publisher","first-page":"6410","DOI":"10.48084\/etasr.3832","volume":"10","author":"H Alghamdi","year":"2020","unstructured":"Alghamdi H, Alsubait T, Alhakami H, Baz A (2020) A review of optimization algorithms for university timetable scheduling. Eng, Technol Appl Sci Res 10(6):6410\u20136417. https:\/\/doi.org\/10.48084\/etasr.3832","journal-title":"Eng, Technol Appl Sci Res"},{"issue":"4","key":"10941_CR15","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.21923\/jesd.1118603","volume":"11","author":"ME G\u00fcrkan","year":"2023","unstructured":"G\u00fcrkan ME, \u015eim\u015fek AB (2023) A course t\u0131metabl\u0131ng formulat\u0131on under pandem\u0131c cons\u0131derat\u0131ons. J Eng Sci Design 11(4):1335\u20131347. https:\/\/doi.org\/10.21923\/jesd.1118603","journal-title":"J Eng Sci Design"},{"issue":"1","key":"10941_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.29137\/umagd.1118493","volume":"15","author":"HM Alaka\u015f","year":"2023","unstructured":"Alaka\u015f HM, U\u011furlu M (2023) Hedef programlama ile uzaktan e\u011fitim ders program\u0131 \u00e7izelgeleme problemi ve bir \u00f6rnek uygulama. Int J Eng Res Develop 15(1):49\u201363. https:\/\/doi.org\/10.29137\/umagd.1118493","journal-title":"Int J Eng Res Develop"},{"key":"10941_CR17","doi-asserted-by":"publisher","unstructured":"Parera S., Sukmana H.T., Wardhani L.K. (2016) Application of genetic algorithm for class scheduling (Case study: Faculty of science and technology UIN Jakarta), in: 2016 4th International Conference on Cyber and IT Service Management, 1\u20135. https:\/\/doi.org\/10.1109\/CITSM.2016.7577525.","DOI":"10.1109\/CITSM.2016.7577525"},{"issue":"1","key":"10941_CR18","first-page":"9","volume":"1","author":"A Yurtsal","year":"2019","unstructured":"Yurtsal A, Kaynar O (2019) Ders programi \u00e7izelgeleme probleminin genetik algoritma ile optimizasyonu. J Infor Syst Manag Res 1(1):9\u201314","journal-title":"J Infor Syst Manag Res"},{"issue":"1","key":"10941_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4314\/ajst.v7i1.55191","volume":"7","author":"AR Mushi","year":"2006","unstructured":"Mushi AR (2006) Tabu search heuristic for university course timetabling problem. Afr J Sci Technol 7(1):34\u201340. https:\/\/doi.org\/10.4314\/ajst.v7i1.55191","journal-title":"Afr J Sci Technol"},{"issue":"1","key":"10941_CR20","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 JK (2010) Adaptive tabu search for course timetabling. Eur J Oper Res 200(1):235\u2013244. https:\/\/doi.org\/10.1016\/J.EJOR.2008.12.007","journal-title":"Eur J Oper Res"},{"key":"10941_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10479-012-1078-5","volume":"194","author":"C Nothegger","year":"2012","unstructured":"Nothegger C, Mayer A, Chwatal A, Raidl GR (2012) Solving the post enrolment course timetabling problem by ant colony optimization. Ann Oper Res 194:325\u2013339. https:\/\/doi.org\/10.1007\/s10479-012-1078-5","journal-title":"Ann Oper Res"},{"issue":"1","key":"10941_CR22","first-page":"12","volume":"9","author":"K Nguyen","year":"2012","unstructured":"Nguyen K, Nguyen P, Tran N (2012) A hybrid algorithm of harmony search and bees algorithm for a university course timetabling problem. Int J Comput Sci Issues (IJCSI) 9(1):12\u201317","journal-title":"Int J Comput Sci Issues (IJCSI)"},{"issue":"1","key":"10941_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0377-2217(03)00099-7","volume":"153","author":"MP Carrasco","year":"2004","unstructured":"Carrasco MP, Pato MV (2004) A comparison of discrete and continuous neural network approaches to solve the class\/teacher timetabling problem. Eur J Oper Res 153(1):65\u201379. https:\/\/doi.org\/10.1016\/S0377-2217(03)00099-7","journal-title":"Eur J Oper Res"},{"key":"10941_CR24","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10732-018-9371-3","volume":"24","author":"M Lindahl","year":"2018","unstructured":"Lindahl M, S\u00f8rensen M, Stidsen TR (2018) A fix-and-optimize matheuristic for university timetabling. J Heuristics 24:645\u2013665. https:\/\/doi.org\/10.1007\/s10732-018-9371-3","journal-title":"J Heuristics"},{"key":"10941_CR25","doi-asserted-by":"publisher","unstructured":"E Aycan T Ayav 2009 Solving the course scheduling problem using simulated annealing, 2009 IEEE international advance computing conference IACC 2009 462 466 https:\/\/doi.org\/10.1109\/IADCC.2009.4809055","DOI":"10.1109\/IADCC.2009.4809055"},{"key":"10941_CR26","first-page":"166","volume":"3","author":"C Ta\u015f","year":"2018","unstructured":"Ta\u015f C, Bedir N, Eren T (2018) 0\u20131 Tamsay\u0131l\u0131 programlama ile ders programi \u00e7izelgeleme probleminin \u00e7\u00f6z\u00fcm\u00fc: bir y\u00fcksek\u00f6\u011fretim kurumunda uygulama. Harran Univ J Eng. 3:166\u2013175","journal-title":"Harran Univ J Eng."},{"issue":"1","key":"10941_CR27","doi-asserted-by":"publisher","first-page":"7597062","DOI":"10.1155\/2016\/7597062","volume":"2016","author":"V Pereira","year":"2016","unstructured":"Pereira V, Gomes Costa H (2016) Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro. Adv Oper Res 2016(1):7597062. https:\/\/doi.org\/10.1155\/2016\/7597062","journal-title":"Adv Oper Res"},{"issue":"3","key":"10941_CR28","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0305-0483(99)00056-0","volume":"28","author":"J Boronico","year":"2000","unstructured":"Boronico J (2000) Quantitative modeling and technology driven departmental course scheduling. Omega 28(3):327\u2013346. https:\/\/doi.org\/10.1016\/S0305-0483(99)00056-0","journal-title":"Omega"},{"issue":"4","key":"10941_CR29","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0305-0548(97)00048-8","volume":"25","author":"MA Badri","year":"1998","unstructured":"Badri MA, Davis DL, Davis DF, Hollingsworth J (1998) A multi-objective course scheduling model: combining faculty preferences for courses and times. Comput Oper Res 25(4):303\u2013316. https:\/\/doi.org\/10.1016\/S0305-0548(97)00048-8","journal-title":"Comput Oper Res"},{"issue":"1","key":"10941_CR30","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/0377-2217(95)00204-9","volume":"94","author":"MA Badri","year":"1996","unstructured":"Badri MA (1996) A two-stage multiobjective scheduling model for [faculty-course-time] assignments. Eur J Oper Res 94(1):16\u201328. https:\/\/doi.org\/10.1016\/0377-2217(95)00204-9","journal-title":"Eur J Oper Res"},{"key":"10941_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-013-9399-6","volume":"44","author":"CK Teoh","year":"2015","unstructured":"Teoh CK, Wibowo A, Ngadiman MS (2015) Review of state of the art for metaheuristic techniques in academic scheduling problems. Artif Intell Rev 44:1\u201321. https:\/\/doi.org\/10.1007\/s10462-013-9399-6","journal-title":"Artif Intell Rev"},{"key":"10941_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2023.109561","volume":"184","author":"CB Mallari","year":"2023","unstructured":"Mallari CB, San Juan JL, Li R (2023) The university coursework timetabling problem: an optimization approach to synchronizing course calendars. Comput Ind Eng 184:109561. https:\/\/doi.org\/10.1016\/j.cie.2023.109561","journal-title":"Comput Ind Eng"},{"key":"10941_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123383","volume":"248","author":"K Xiang","year":"2024","unstructured":"Xiang K, Hu X, Yu M, Wang X (2024) Exact and heuristic methods for a university course scheduling problem. Expert Syst Appl 248:123383. https:\/\/doi.org\/10.1016\/j.eswa.2024.123383","journal-title":"Expert Syst Appl"},{"key":"10941_CR34","doi-asserted-by":"publisher","unstructured":"Mitsui H., Sugihara H., Koizumi H., (2004) A scheduling method of distance learning classes including remote experiments, in: 18th International Conference on Advanced Information Networking and Applications, 1: 439\u2013444 https:\/\/doi.org\/10.1109\/AINA.2004.1283949.","DOI":"10.1109\/AINA.2004.1283949"},{"key":"10941_CR35","doi-asserted-by":"publisher","unstructured":"Irene H.S.F., Deris S., Hashim M., Zaiton S. (2009) University course timetable planning using hybrid particle swarm optimization, \u0130n: Proceedings of the First ACM\/SIGEVO Summit on Genetic and Evolutionary Computation - GEC \u201809, ACM Press, New York, New York, USA, p. 239. https:\/\/doi.org\/10.1145\/1543834.1543868.","DOI":"10.1145\/1543834.1543868"},{"key":"10941_CR36","first-page":"403","volume":"11","author":"A Anwar","year":"2021","unstructured":"Anwar A, Rochman DD, Ferdian R (2021) Parallel machine scheduling with shortest processing time (SPT) and longest processing time (LPT) to minimize makespan at PT. ABC, Rev Int Geograph Edu Online 11:403\u2013407","journal-title":"ABC, Rev Int Geograph Edu Online"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10941-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-10941-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-10941-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T16:23:23Z","timestamp":1740759803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-10941-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,3]]},"references-count":36,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10941"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-10941-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2025,1,3]]},"assertion":[{"value":"2 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}