{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T08:15:18Z","timestamp":1772871318123,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"DOI":"10.1186\/s40537-025-01085-x","type":"journal-article","created":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T13:23:21Z","timestamp":1738416201000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A novel artificial intelligence search algorithm and mathematical model for the hybrid flow shop scheduling problem"],"prefix":"10.1186","volume":"12","author":[{"given":"Filip","family":"Vidojevi\u0107","sequence":"first","affiliation":[]},{"given":"Andrijana","family":"D\u017eami\u0107","sequence":"additional","affiliation":[]},{"given":"Du\u0161an","family":"D\u017eami\u0107","sequence":"additional","affiliation":[]},{"given":"Miroslav","family":"Mari\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"1085_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cor.2018.07.025","volume":"100","author":"C Yu","year":"2018","unstructured":"Yu C, Semeraro Q, Matta A. A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. Computers & Operations Research. 2018;100:211\u201329 (ISSN 0305-0548).","journal-title":"Computers & Operations Research"},{"key":"1085_CR2","doi-asserted-by":"crossref","unstructured":"Yong L, Zhantao L, Xiang L, Chenfeng P. Heuristics for the hybrid flow shop scheduling problem with sequence-dependent setup times. Mathematical Problems in Engineering, 2022;2022.","DOI":"10.1155\/2022\/8682203"},{"key":"1085_CR3","doi-asserted-by":"publisher","first-page":"1961","DOI":"10.1007\/s00170-014-6754-y","volume":"78","author":"L Sun","year":"2015","unstructured":"Sun L, Yu S. Scheduling a real-world hybrid flow shop with variable processing times using lagrangian relaxation. The International Journal of Advanced Manufacturing Technology. 2015;78:1961\u201370.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"1085_CR4","doi-asserted-by":"crossref","unstructured":"Blagojevi\u0107 V, Boji\u0107 D, Bojovi\u0107 M, Cvetanovi\u0107 M, Djordjevi\u0107 J, Djurdjevi\u0107 D, Furlan B, Gajin S, Jovanovi\u0107 Z, Mili\u0107ev D, Milutinovi\u0107 V, Nikoli\u0107 B, Proti\u0107 J, Punt M, Radivojevi\u0107 Z, Stanisavljevi\u0107 Z, Stojanovi\u0107 S, Tartalja I, Toma\u0161evi\u0107 M, Vuleti\u0107 P. Chapter one - a systematic approach to generation of new ideas for phd research in computing. In A.R. Hurson, V. Milutinovi\u0107, editors, Creativity in Computing and DataFlow SuperComputing, volume 104 of Advances in Computers, 2017;1\u201331. Elsevier.","DOI":"10.1016\/bs.adcom.2016.09.001"},{"issue":"6","key":"1085_CR5","doi-asserted-by":"publisher","first-page":"1755","DOI":"10.1016\/j.asoc.2012.01.011","volume":"12","author":"CJ Liao","year":"2012","unstructured":"Liao CJ, Tjandradjaja E, Chung TP. An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Applied Soft Computing. 2012;12(6):1755\u201364 (ISSN 1568-4946).","journal-title":"Applied Soft Computing"},{"key":"1085_CR6","doi-asserted-by":"crossref","unstructured":"Hajji MK, Hadda H, Dridi N. Makespan minimization for the two-stage hybrid flow shop problem with dedicated machines: A comprehensive study of exact and heuristic approaches. Computation. 2023;11(7). ISSN 2079-3197.","DOI":"10.3390\/computation11070137"},{"key":"1085_CR7","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.asoc.2018.08.002","volume":"72","author":"O Engin","year":"2018","unstructured":"Engin O, G\u00fc\u00e7l\u00fc A. A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Applied Soft Computing. 2018;72:166\u201376 (ISSN 1568-4946).","journal-title":"Applied Soft Computing"},{"key":"1085_CR8","doi-asserted-by":"crossref","unstructured":"Rolf B, Reggelin T, Nahhas A, M\u00fcller M, Lang S. Scheduling jobs in a two-stage hybrid flow shop with a simulation-based genetic algorithm and standard dispatching rules. In 2020 Winter Simulation Conference (WSC), 12 2020.","DOI":"10.1109\/WSC48552.2020.9384067"},{"issue":"3","key":"1085_CR9","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J Grabowski","year":"2000","unstructured":"Grabowski J, Pempera J. Sequencing of jobs in some production system. European Journal of Operational Research. 2000;125(3):535\u201350 (ISSN 0377-2217).","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1085_CR10","first-page":"10","volume":"8","author":"T Arthanari","year":"1971","unstructured":"Arthanari T, Ramamurthy K. An extension of two machines sequencing problem. Opsearch. 1971;8(1):10\u201322.","journal-title":"Opsearch"},{"issue":"1","key":"1085_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0377-2217(91)90148-O","volume":"51","author":"SA Brah","year":"1991","unstructured":"Brah SA, Hunsucker JL. Branch and bound algorithm for the flow shop with multiple processors. European Journal of Operational Research. 1991;51(1):88\u201399 (ISSN 0377-2217).","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1085_CR12","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0377-2217(97)00333-0","volume":"107","author":"M Portmann","year":"1998","unstructured":"Portmann M, Vignier A, Dardilhac D, Dezalay D. Branch and bound crossed with GA to solve hybrid flowshops. Eur J Oper Res. 1998;107(2):389\u2013400.","journal-title":"Eur. J. Oper. Res."},{"key":"1085_CR13","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/S0305-0483(01)00040-8","volume":"29","author":"E N\u00e9ron","year":"2001","unstructured":"N\u00e9ron E, Baptiste P, Gupta J. Solving hybrid flow shop problem using energetic reasoning and global operations. Omega. 2001;29:501\u201311.","journal-title":"Omega"},{"issue":"4","key":"1085_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"JND Gupta","year":"1988","unstructured":"Gupta JND. Two-stage, hybrid flowshop scheduling problem. The Journal of the Operational Research Society. 1988;39(4):359\u201364 (ISSN 01605682, 14769360).","journal-title":"The Journal of the Operational Research Society"},{"issue":"4","key":"1085_CR15","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.asoc.2010.03.008","volume":"10","author":"C Kahraman","year":"2010","unstructured":"Kahraman C, Engin O, Kaya \u0130hsan, \u00d6zt\u00fcrk RE. Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach. Applied Soft Computing. 2010;10(4):1293\u2013300 (ISSN 1568-4946. Optimisation Methods & Applications in Decision-Making Processes).","journal-title":"Applied Soft Computing"},{"issue":"1","key":"1085_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ijpe.2008.10.009","volume":"117","author":"MR Amin-Naseri","year":"2009","unstructured":"Amin-Naseri MR, Beheshti-Nia MA. Hybrid flow shop scheduling with parallel batching. International Journal of Production Economics. 2009;117(1):185\u201396 (ISSN 0925-5273).","journal-title":"International Journal of Production Economics"},{"key":"1085_CR17","doi-asserted-by":"crossref","unstructured":"Besbes W, Loukil T, Teghem J. Using genetic algorithm in the multiprocessor flow shop to minimize the makespan. In 2006 International Conference on Service Systems and Service Management, 2006;2:1228\u20131233.","DOI":"10.1109\/ICSSSM.2006.320684"},{"key":"1085_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","volume":"8","author":"C O\u011duz","year":"2005","unstructured":"O\u011duz C, Ercan MF. A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. Journal of Scheduling. 2005;8:323\u201351.","journal-title":"Journal of Scheduling"},{"issue":"6","key":"1085_CR19","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1016\/j.future.2004.03.014","volume":"20","author":"O Engin","year":"2004","unstructured":"Engin O, D\u00f6yen A. A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Generation Computer Systems. 2004;20(6):1083\u201395 (ISSN 0167-739X. Computational science of lattice Boltzmann modelling).","journal-title":"Future Generation Computer Systems"},{"issue":"8","key":"1085_CR20","doi-asserted-by":"publisher","first-page":"3729","DOI":"10.1016\/j.asoc.2013.03.006","volume":"13","author":"TP Chung","year":"2013","unstructured":"Chung TP, Liao CJ. An immunoglobulin-based artificial immune system for solving the hybrid flow shop problem. Applied Soft Computing. 2013;13(8):3729\u201336 (ISSN 1568-4946).","journal-title":"Applied Soft Computing"},{"key":"1085_CR21","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.neucom.2013.07.056","volume":"148","author":"Z Cui","year":"2015","unstructured":"Cui Z, Gu X. An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems. Neurocomputing. 2015;148:248\u201359 (ISSN 0925-2312).","journal-title":"Neurocomputing"},{"key":"1085_CR22","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1504\/IJAOM.2020.108263","volume":"12","author":"O Tosun","year":"2020","unstructured":"Tosun O, Tosun N, Mariappan Kadarkarainadar M. A literature review on hybrid flow shop scheduling. International Journal of Advanced Operations Management. 2020;12:156.","journal-title":"International Journal of Advanced Operations Management"},{"key":"1085_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.105977","volume":"121","author":"YJ Wang","year":"2023","unstructured":"Wang YJ, Wang GG, Tian FM, Gong DW, Pedrycz W. Solving energy-efficient fuzzy hybrid flow-shop scheduling problem at a variable machine speed using an extended nsga-ii. Engineering Applications of Artificial Intelligence. 2023;121: 105977 (ISSN 0952-1976).","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"1085_CR24","doi-asserted-by":"crossref","unstructured":"Li M, Wang GG, Yu H. Sorting-based discrete artificial bee colony algorithm for solving fuzzy hybrid flow shop green scheduling problem. Mathematics. 2021;9(18) ISSN 2227-7390.","DOI":"10.3390\/math9182250"},{"issue":"11","key":"1085_CR25","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P. Variable neighborhood search. Computers & Operations Research. 1997;24(11):1097\u2013100 (ISSN 0305-0548).","journal-title":"Computers & Operations Research"},{"key":"1085_CR26","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N, Perez-Britos D. Variable neighborhood decomposition search. Journal of Heuristics. 2001;7:335\u201350.","journal-title":"Journal of Heuristics"},{"key":"1085_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107305","volume":"106","author":"B Zhang","year":"2021","unstructured":"Zhang B, Pan QK, Meng LL, Zhang XL, Ren YP, Li JQ, Jiang XC. A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots. Applied Soft Computing. 2021;106: 107305 (ISSN 1568-4946).","journal-title":"Applied Soft Computing"},{"key":"1085_CR28","doi-asserted-by":"publisher","first-page":"8917","DOI":"10.1007\/s00500-019-04420-6","volume":"24","author":"S Wang","year":"2020","unstructured":"Wang S, Wu R, Chu F, Yu J. Variable neighborhood search-based methods for integrated hybrid flow shop scheduling with distribution. Soft Computing. 2020;24:8917\u201336.","journal-title":"Soft Computing"},{"key":"1085_CR29","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.asoc.2014.07.005","volume":"24","author":"J qing Li","year":"2014","unstructured":"qing Li J, ke Pan Q, tao Wang F. A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem. Applied Soft Computing. 2014;24:63\u201377 (ISSN 1568-4946).","journal-title":"Applied Soft Computing"},{"key":"1085_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro:2000103","volume":"34","author":"J Carlier","year":"2000","unstructured":"Carlier J, N\u00e9ron E. An exact method for solving the multi-processor flow-shop. RAIRO - Operations Research. 2000;34:1\u201325.","journal-title":"RAIRO - Operations Research"},{"key":"1085_CR31","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s00170-007-1048-2","volume":"35","author":"K Alayk\u00fdran","year":"2007","unstructured":"Alayk\u00fdran K, Engin O, D\u00f6yen A. Using ant colony optimization to solve hybrid flow shop scheduling problems. International Journal of Advanced Manufacturing Technology. 2007;35:541\u201350.","journal-title":"International Journal of Advanced Manufacturing Technology"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01085-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-025-01085-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01085-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T13:23:29Z","timestamp":1738416209000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-025-01085-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,1]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1085"],"URL":"https:\/\/doi.org\/10.1186\/s40537-025-01085-x","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,1]]},"assertion":[{"value":"29 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"23"}}