{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T05:19:11Z","timestamp":1772083151703,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T00:00:00Z","timestamp":1716595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62373146"],"award-info":[{"award-number":["62373146"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2022JJ30265"],"award-info":[{"award-number":["2022JJ30265"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Talent of Lifting Engineering for Science and Technology in Hunan Province","award":["2022TJ-Q03"],"award-info":[{"award-number":["2022TJ-Q03"]}]},{"name":"the Outstanding Youth Project of Education Department of Hunan Province","award":["22B0476"],"award-info":[{"award-number":["22B0476"]}]},{"name":"the Key Project of Education Department of Hunan Province of china","award":["23A0382"],"award-info":[{"award-number":["23A0382"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The distributed permutation flow shop scheduling problem (DPFSP) is one of the hottest issues in the context of economic globalization. In this paper, a Q-learning enhanced fruit fly optimization algorithm (QFOA) is proposed to solve the DPFSP with the goal of minimizing the makespan. First, a hybrid strategy is used to cooperatively initialize the position of the fruit fly in the solution space and the boundary properties are used to improve the operation efficiency of QFOA. Second, the neighborhood structure based on problem knowledge is designed in the smell stage to generate neighborhood solutions, and the Q-learning method is conducive to the selection of high-quality neighborhood structures. Moreover, a local search algorithm based on key factories is designed to improve the solution accuracy by processing sequences of subjobs from key factories. Finally, the proposed QFOA is compared with the state-of-the-art algorithms for solving 720 well-known large-scale benchmark instances. The experimental results demonstrate the most outstanding performance of QFOA.<\/jats:p>","DOI":"10.1007\/s40747-024-01482-4","type":"journal-article","created":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T04:01:40Z","timestamp":1716609700000},"page":"5965-5988","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["An improved fruit fly optimization algorithm with Q-learning for solving distributed permutation flow shop scheduling problems"],"prefix":"10.1007","volume":"10","author":[{"given":"Cai","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9773-2280","authenticated-orcid":false,"given":"Lianghong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Cili","family":"Zuo","sequence":"additional","affiliation":[]},{"given":"Hongqiang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"1482_CR1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s12597-020-00484-3","volume":"58","author":"A Ali","year":"2020","unstructured":"Ali A, Gajpal Y, Elmekkawy TY (2020) Distributed permutation flowshop scheduling problem with total completion time objective. Opsearch 58:425\u2013447","journal-title":"Opsearch"},{"key":"1482_CR2","volume":"213","author":"G Alireza","year":"2023","unstructured":"Alireza G, Ali A, Mostafa H (2023) Efficient multi-objective meta-heuristic algorithms for energy-aware non-permutation flow shop scheduling problem. Expert Syst Appl 213:119077","journal-title":"Expert Syst Appl"},{"key":"1482_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.18280\/ts.360115","volume":"36","author":"KS Babu","year":"2019","unstructured":"Babu KS, Vemuru S (2019) Spectrum signals handoff in lte cognitive radio networks using reinforcement learning. Traitement du Signal 36:119\u2013125","journal-title":"Traitement du Signal"},{"key":"1482_CR4","volume":"149","author":"RH Chen","year":"2020","unstructured":"Chen RH, Yang B, Li S (2020) A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Comput Ind Eng 149:106778","journal-title":"Comput Ind Eng"},{"key":"1482_CR5","first-page":"169","volume":"11","author":"H Dong","year":"2022","unstructured":"Dong H, Wang ZB (2022) Distributed assembly replacement flow shop scheduling based on iiga. Manuf Technol Mach Tools 11:169\u2013176","journal-title":"Manuf Technol Mach Tools"},{"key":"1482_CR6","volume":"225","author":"SL Du","year":"2023","unstructured":"Du SL, Zhou WJ, Wu DK (2023) An effective discrete monarch butterfly optimization algorithm for distributed blocking flow shop scheduling with an assembly machine. Expert Syst Appl 225:120113","journal-title":"Expert Syst Appl"},{"key":"1482_CR7","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1080\/00207543.2014.948578","volume":"53","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan J (2015) A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 53:1111\u20131123","journal-title":"Int J Prod Res"},{"key":"1482_CR8","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.cie.2018.03.014","volume":"118","author":"V Fernandez-Viagas","year":"2018","unstructured":"Fernandez-Viagas V, Perez-Gonzalez P, Framinan J (2018) The distributed permutation flow shop to minimise the total flowtime. Comput Ind Eng 118:464\u2013477","journal-title":"Comput Ind Eng"},{"key":"1482_CR9","volume":"278","author":"Y Fu","year":"2021","unstructured":"Fu Y, Zhou M, Guo X (2021) Stochastic multi-objective integrated disassembly-reprocessing-reassembly scheduling via fruit fly optimization algorithm. J Clean Prod 278:123364","journal-title":"J Clean Prod"},{"key":"1482_CR10","volume":"123","author":"HW Guo","year":"2023","unstructured":"Guo HW, Sang HY, Zhang XJ (2023) An effective fruit fly optimization algorithm for the distributed permutation flowshop scheduling problem with total flowtime. Eng Appl Artif Intell 123:106347","journal-title":"Eng Appl Artif Intell"},{"key":"1482_CR11","doi-asserted-by":"crossref","first-page":"2333","DOI":"10.1007\/s00521-015-2070-1","volume":"27","author":"YZ Hsieh","year":"2016","unstructured":"Hsieh YZ, Su MC (2016) A q-learning-based swarm optimization algorithm for economic dispatch problem. Neural Comput Appl 27:2333\u20132350","journal-title":"Neural Comput Appl"},{"key":"1482_CR12","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1631\/FITEE.1601364","volume":"18","author":"L Huang","year":"2017","unstructured":"Huang L, Wang G, Bai T (2017) An improved fruit fly optimization algorithm for solving traveling salesman problem. Front Inform Technol Electron Eng 18:1525\u20131533","journal-title":"Front Inform Technol Electron Eng"},{"key":"1482_CR13","volume":"50","author":"IA Ibrahim","year":"2022","unstructured":"Ibrahim IA (2022) A hybrid wind driven-based fruit fly optimization algorithm for identifying the parameters of a double-diode photovoltaic cell model considering degradation effects. Sustain Energy Technol Assess 50:101685","journal-title":"Sustain Energy Technol Assess"},{"key":"1482_CR14","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1109\/JAS.2019.1911732","volume":"7","author":"L Jiang","year":"2020","unstructured":"Jiang L, Huang H, Ding Z (2020) Path planning for intelligent robots based on deep q-learning with experience replay and heuristic knowledge. IEEE\/CAA J Autom Sin 7:1179\u20131189","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"1482_CR15","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2020.106629","volume":"96","author":"X Jing","year":"2020","unstructured":"Jing X, Pan Q, Gao L (2020) An effective iterated greedy algorithm for the distributed permutation flowshop scheduling with due windows. Appl Soft Comput 96:106629","journal-title":"Appl Soft Comput"},{"key":"1482_CR16","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s11740-017-0716-9","volume":"11","author":"M Komaki","year":"2017","unstructured":"Komaki M, Malakooti B (2017) General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem. Prod Eng Res Dev 11:315\u2013329","journal-title":"Prod Eng Res Dev"},{"key":"1482_CR17","doi-asserted-by":"crossref","first-page":"6922","DOI":"10.1080\/00207543.2019.1571687","volume":"57","author":"JQ Li","year":"2019","unstructured":"Li JQ, Bai SC, Duan PY (2019) An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system. Int J Prod Res 57:6922\u20136942","journal-title":"Int J Prod Res"},{"key":"1482_CR18","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.cie.2016.07.027","volume":"99","author":"SW Lin","year":"2016","unstructured":"Lin SW, Ying KC (2016) Minimizing makespan for solving the distributed no-wait flowshop scheduling problem. Comput Ind Eng 99:202\u2013209","journal-title":"Comput Ind Eng"},{"key":"1482_CR19","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.104894","volume":"184","author":"T Meng","year":"2019","unstructured":"Meng T, Pan QK, Wang L (2019) A distributed permutation flow shop scheduling problem with the customer order constraint. Knowl-Based Syst 184:104894","journal-title":"Knowl-Based Syst"},{"key":"1482_CR20","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi B, Ruiz R (2010) The distributed permutation flowshop scheduling problem. Comput Oper Res 37:754\u2013768","journal-title":"Comput Oper Res"},{"key":"1482_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore E, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11:91\u201395","journal-title":"Omega"},{"key":"1482_CR22","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","volume":"124","author":"Q Pan","year":"2019","unstructured":"Pan Q, Gao L, Wang L (2019) Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Syst Appl 124:309\u2013324","journal-title":"Expert Syst Appl"},{"key":"1482_CR23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.knosys.2011.07.001","volume":"26","author":"WT Pan","year":"2012","unstructured":"Pan WT (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26:69\u201374","journal-title":"Knowl-Based Syst"},{"key":"1482_CR24","first-page":"1387","volume":"36","author":"B Qian","year":"2021","unstructured":"Qian B, She MZ, Hu R (2021) The hyperheuristic cross-entropy algorithm solves the fuzzy distributed pipeline green scheduling problem. Control Decis Mak 36:1387\u20131396","journal-title":"Control Decis Mak"},{"key":"1482_CR25","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s12293-021-00329-6","volume":"13","author":"H Qin","year":"2021","unstructured":"Qin H, Li T, Teng Y (2021) Integrated production and distribution scheduling in distributed hybrid fow shops. Memetic Comput 13:185\u2013202","journal-title":"Memetic Comput"},{"key":"1482_CR26","first-page":"136","volume":"13","author":"JF Ren","year":"2021","unstructured":"Ren JF, Ye CM, Li Y (2021) A new solution to distributed permutation flow shop scheduling problem based on nash q-learning. Adv Prod Eng Manag 13:136\u2013146","journal-title":"Adv Prod Eng Manag"},{"key":"1482_CR27","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz R, Pan Q, Naderi B (2019) Iterated greedy methods for the distributed permutation flowshop scheduling problem. Omega 83:213\u2013222","journal-title":"Omega"},{"key":"1482_CR28","doi-asserted-by":"crossref","first-page":"2023","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, Stutzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177:2023\u20132049","journal-title":"Eur J Oper Res"},{"key":"1482_CR29","doi-asserted-by":"crossref","first-page":"6867","DOI":"10.1002\/cpe.6867","volume":"11","author":"K Saminathan","year":"2022","unstructured":"Saminathan K, Thangavel R (2022) Energy efficient and delay aware clustering in mobile adhoc network: a hybrid fruit fly optimization algorithm and whale optimization algorithm approach. Concurr Comput Pract Exp 11:6867","journal-title":"Concurr Comput Pract Exp"},{"key":"1482_CR30","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.swevo.2018.12.001","volume":"44","author":"HY Sang","year":"2019","unstructured":"Sang HY, Pan QK, Li JQ (2019) Effective invasive weed optimization algorithms for distributed assembly permutation flow shop problem with total flowtime criterion. Swarm Evol Comput 44:64\u201373","journal-title":"Swarm Evol Comput"},{"key":"1482_CR31","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.knosys.2017.09.026","volume":"137","author":"W Shao","year":"2017","unstructured":"Shao W, Pi D, Shao Z (2017) Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms. Knowl-Based Syst 137:163\u2013181","journal-title":"Knowl-Based Syst"},{"key":"1482_CR32","volume":"145","author":"Z Shao","year":"2019","unstructured":"Shao Z, Pi D, Shao W (2019) Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment. Expert Syst Appl 145:113147","journal-title":"Expert Syst Appl"},{"key":"1482_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2017.10.041","volume":"428","author":"XN Shen","year":"2018","unstructured":"Shen XN, Minku LL, Marturi N (2018) A q-learning-based memetic algorithm for multi-objective dynamic software project scheduling. Inf Sci 428:1\u201329","journal-title":"Inf Sci"},{"key":"1482_CR34","volume":"135","author":"HB Song","year":"2023","unstructured":"Song HB, Yang YH, Lin J (2023) An effective hyper heuristic-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem. Appl Soft Comput 135:110022","journal-title":"Appl Soft Comput"},{"key":"1482_CR35","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278\u2013285","journal-title":"Eur J Oper Res"},{"key":"1482_CR36","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Pan QK, Kizilay D (2019) A variable block insertion heuristic for permutation flow shops with makespan criterion. In: 2017 IEEE congress on evolutionary computation, p 12","DOI":"10.3390\/a12050100"},{"key":"1482_CR37","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100716","volume":"57","author":"G Wang","year":"2020","unstructured":"Wang G, Gao L, Li X (2020) Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm. Swarm Evol Comput 57:100716","journal-title":"Swarm Evol Comput"},{"key":"1482_CR38","doi-asserted-by":"crossref","first-page":"5867","DOI":"10.1080\/00207543.2020.1794075","volume":"59","author":"HX Wang","year":"2021","unstructured":"Wang HX, Sarker BR, Li J (2021) Adaptive scheduling for assembly job shop with uncertain assembly times based on dual q-learning. Int J Prod Res 59:5867\u20135883","journal-title":"Int J Prod Res"},{"key":"1482_CR39","first-page":"1","volume":"50","author":"JJ Wang","year":"2018","unstructured":"Wang JJ, Wang L (2018) A knowledge-based cooperative algorithm for energy efficient scheduling of distributed flow-shop. IEEE Trans Syst Man Cybern Syst 50:1\u201315","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1482_CR40","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"37","author":"L Wang","year":"2010","unstructured":"Wang L, Pan QK, Suganthan PN (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37:509\u2013520","journal-title":"Comput Oper Res"},{"key":"1482_CR41","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.knosys.2019.03.028","volume":"176","author":"L Wang","year":"2019","unstructured":"Wang L, Xiong YN, Li SW (2019) New fruit fly optimization algorithm with joint search strategies for function optimization problems. Knowl-Based Syst 176:77\u201396","journal-title":"Knowl-Based Syst"},{"key":"1482_CR42","volume":"215","author":"Z Wang","year":"2023","unstructured":"Wang Z, Deng QW, Zhang LK (2023) Joint optimization of integrated mixed maintenance and distributed two-stage hybrid flow-shop production for multi-site maintenance requirements. Expert Syst Appl 215:119422","journal-title":"Expert Syst Appl"},{"key":"1482_CR43","first-page":"279","volume":"8","author":"C Watkins","year":"1992","unstructured":"Watkins C, Dayan P (1992) Q-learning. Mach Learn 8:279\u2013292","journal-title":"Mach Learn"},{"key":"1482_CR44","first-page":"803","volume":"36","author":"XL Yang","year":"2019","unstructured":"Yang XL, Hu R, Qian B (2019) Enhanced distribution estimation algorithm solves for distributed displacement flow workshop scheduling. Control Theory Appl 36:803\u2013815","journal-title":"Control Theory Appl"},{"key":"1482_CR45","volume":"135","author":"Y Yang","year":"2023","unstructured":"Yang Y, Zhang F, Huang J (2023) Acceleration-based artificial bee colony optimizer for a distributed permutation flowshop scheduling problem with sequence-dependent setup times. Appl Soft Comput 135:110029","journal-title":"Appl Soft Comput"},{"key":"1482_CR46","volume":"202","author":"YH Yang","year":"2022","unstructured":"Yang YH, Li X (2022) A knowledge-driven constructive heuristic algorithm for the distributed assembly blocking flow shop scheduling problem. Expert Syst Appl 202:117269","journal-title":"Expert Syst Appl"},{"key":"1482_CR47","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cor.2019.04.002","volume":"108","author":"G Zhang","year":"2019","unstructured":"Zhang G, Xing K (2019) Differential evolution metaheuristics for distributed limited-buffer flow shop scheduling with makespan criterion. Comput Oper Res 108:33\u201343","journal-title":"Comput Oper Res"},{"key":"1482_CR48","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.engappai.2018.09.005","volume":"76","author":"GH Zhang","year":"2018","unstructured":"Zhang GH, Xing KY, Cao F (2018) Discrete differential evolution algorithm for distributed blocking flow shop scheduling with makespan criterion. Eng Appl Artif Intell 76:96\u2013107","journal-title":"Eng Appl Artif Intell"},{"key":"1482_CR49","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/TSUSC.2017.2743704","volume":"4","author":"QC Zhang","year":"2019","unstructured":"Zhang QC, Lin M, Yang LT (2019) Energy-efficient scheduling for realtime systems based on deep q-learning model. IEEE Trans Sustain Comput 4:132\u2013141","journal-title":"IEEE Trans Sustain Comput"},{"key":"1482_CR50","doi-asserted-by":"crossref","first-page":"3260","DOI":"10.3390\/en12173260","volume":"12","author":"X Zhang","year":"2019","unstructured":"Zhang X, Liu X, Tang S (2019) Solving scheduling problem in a distributed manufacturing system using a discrete fruit fly optimization algorithm. Energies 12:3260","journal-title":"Energies"},{"key":"1482_CR51","volume":"200","author":"XH Zhang","year":"2022","unstructured":"Zhang XH, Liu XH, Cichon A (2022) Scheduling of energy-efficient distributed blocking flowshop using pareto-based estimation of distribution algorithm. Expert Syst Appl 200:116910","journal-title":"Expert Syst Appl"},{"key":"1482_CR52","first-page":"20","volume":"52","author":"F Zhao","year":"2021","unstructured":"Zhao F, Ma R, Wang L (2021) A self-learning discrete jaya algorithm for multi objective energy-efficient distributed no-idle flow-shop scheduling problem in heterogeneous factory system. IEEE Trans Cybern 52:20","journal-title":"IEEE Trans Cybern"},{"key":"1482_CR53","doi-asserted-by":"crossref","unstructured":"Zhao F, Zhao L, Wang L (2020) An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion. Expert Syst Appl 160:1136781\u201311367821","DOI":"10.1016\/j.eswa.2020.113678"},{"key":"1482_CR54","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s40747-021-00354-5","volume":"8","author":"FQ Zhao","year":"2022","unstructured":"Zhao FQ, Hu XT, Wang L (2022) A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem. Complex Intell Syst 8:141\u2013161","journal-title":"Complex Intell Syst"},{"key":"1482_CR55","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.eswa.2019.02.023","volume":"126","author":"FQ Zhao","year":"2019","unstructured":"Zhao FQ, Qin S, Zhang Y (2019) A hybrid bio-geography based optimization with variable neighborhood search mechanism for no-wait flow shop scheduling problem. Expert Syst Appl 126:321\u2013339","journal-title":"Expert Syst Appl"},{"key":"1482_CR56","doi-asserted-by":"crossref","first-page":"3362","DOI":"10.1007\/s10489-019-01457-w","volume":"49","author":"FQ Zhao","year":"2019","unstructured":"Zhao FQ, Xue FL, Zhang Y (2019) A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization. Appl Intell 49:3362\u20133382","journal-title":"Appl Intell"},{"key":"1482_CR57","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.eswa.2016.08.039","volume":"65","author":"X Zheng","year":"2016","unstructured":"Zheng X, Wang L (2016) A two-stage adaptive fruit fly optimization algorithm for unrelated parallel machine scheduling problem with additional resource constraints. Expert Syst Appl 65:28\u201339","journal-title":"Expert Syst Appl"},{"key":"1482_CR58","volume":"198","author":"NN Zhu","year":"2022","unstructured":"Zhu NN, Zhao FQ, Wang L (2022) A discrete learning fruit fly algorithm based on knowledge for the distributed no-wait flow shop scheduling with due windows. Expert Syst Appl 198:116921","journal-title":"Expert Syst Appl"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01482-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01482-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01482-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T15:06:17Z","timestamp":1726326377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01482-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,25]]},"references-count":58,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1482"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01482-4","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,25]]},"assertion":[{"value":"12 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2024","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 declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}