{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:52:13Z","timestamp":1776750733988,"version":"3.51.2"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2021QF036"],"award-info":[{"award-number":["ZR2021QF036"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52175490"],"award-info":[{"award-number":["52175490"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52205529"],"award-info":[{"award-number":["52205529"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The present-day globalized economy and diverse market demands have compelled an increasing number of manufacturing enterprises to move toward the distributed manufacturing pattern and the model of multi-variety and small-lot. Taking these two factors into account, this study investigates an extension of the distributed hybrid flowshop scheduling problem (DHFSP), called the distributed hybrid flowshop scheduling problem with consistent sublots (DHFSP_CS). To tackle this problem, a mixed integer linear programming (MILP) model is developed as a preliminary step. The NP-hard nature of the problem necessitates the use of the iterated F-Race (I\/F-Race) as the automated algorithm design (AAD) to compose a metaheuristic that requires minimal user intervention. The I\/F-Race enables identifying the ideal values of numerical and categorical parameters within a promising algorithm framework. An extension of the collaborative variable neighborhood descent algorithm (ECVND) is utilized as the algorithm framework, which is modified by intensifying efforts on the critical factories. In consideration of the problem-specific characteristics and the solution encoding, the configurable solution initializations, configurable solution decoding strategies, and configurable collaborative operators are designed. Additionally, several neighborhood structures are specially designed. Extensive computational results on simulation instances and a real-world instance demonstrate that the automated algorithm conceived by the AAD outperforms the CPLEX and other state-of-the-art metaheuristics in addressing the DHFSP_CS.<\/jats:p>","DOI":"10.1007\/s40747-023-01288-w","type":"journal-article","created":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T08:02:15Z","timestamp":1702627335000},"page":"2781-2809","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Automatic algorithm design of distributed hybrid flowshop scheduling with consistent sublots"],"prefix":"10.1007","volume":"10","author":[{"given":"Biao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Chao","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Lei-lei","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Yu-yan","family":"Han","sequence":"additional","affiliation":[]},{"given":"Jiang","family":"Hu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6443-9990","authenticated-orcid":false,"given":"Xu-chu","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"1288_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz R, Pan QK, Naderi B (2019) Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega 83:213\u2013222","journal-title":"Omega"},{"issue":"2","key":"1288_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s12597-020-00484-3","volume":"58","author":"A Ali","year":"2021","unstructured":"Ali A, Gajpal Y, Elmekkawy TY (2021) Distributed permutation flowshop scheduling problem with total completion time objective. Opsearch 58(2):425\u2013447","journal-title":"Opsearch"},{"issue":"3","key":"1288_CR3","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.ejor.2019.10.004","volume":"282","author":"P Alfaro-Fern\u00e1ndez","year":"2020","unstructured":"Alfaro-Fern\u00e1ndez P, Ruiz R, Pagnozzi F, St\u00fctzle T (2020) Automatic algorithm design for hybrid flowshop scheduling problems. Eur J Oper Res 282(3):835\u2013845","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1288_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s40747-019-00122-6","volume":"6","author":"K Gao","year":"2020","unstructured":"Gao K, Huang Y, Sadollah A, Wang L (2020) A review of energy-efficient scheduling in intelligent production systems. Complex Intell Syst 6(2):237\u2013249","journal-title":"Complex Intell Syst"},{"issue":"5","key":"1288_CR5","doi-asserted-by":"publisher","first-page":"2235","DOI":"10.1007\/s40747-021-00400-2","volume":"7","author":"J Cai","year":"2021","unstructured":"Cai J, Lei D (2021) A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time. Complex Intell Syst 7(5):2235\u20132253","journal-title":"Complex Intell Syst"},{"key":"1288_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.eswa.2017.09.032","volume":"92","author":"KC Ying","year":"2018","unstructured":"Ying KC, Lin SW (2018) Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert Syst Appl 92:132\u2013141","journal-title":"Expert Syst Appl"},{"issue":"23\u201324","key":"1288_CR7","doi-asserted-by":"publisher","first-page":"7023","DOI":"10.1080\/00207543.2013.774506","volume":"51","author":"M Cheng","year":"2013","unstructured":"Cheng M, Mukherjee NJ, Sarin SC (2013) A review of lot streaming. Int J Prod Res 51(23\u201324):7023\u20137046","journal-title":"Int J Prod Res"},{"key":"1288_CR8","doi-asserted-by":"crossref","unstructured":"Balaprakash P, Birattari M, St\u00fctzle T (2007) Improvement strategies for the F-Race algorithm: sampling design and iterative refinement. In: International workshop on hybrid metaheuristics. Springer, Berlin, pp 108\u2013122","DOI":"10.1007\/978-3-540-75514-2_9"},{"key":"1288_CR9","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, C\u00e1ceres LP, Birattari M, St\u00fctzle T (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358","journal-title":"Oper Res Perspect"},{"issue":"2","key":"1288_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1162\/evco_a_00263","volume":"28","author":"LC Bezerra","year":"2020","unstructured":"Bezerra LC, Manuel L (2020) Automatically designing state-of-the-art multi-and many-objective evolutionary algorithms. Evol Comput 28(2):195\u2013226","journal-title":"Evol Comput"},{"key":"1288_CR11","first-page":"185","volume":"13","author":"M Colak","year":"2021","unstructured":"Colak M, Keskin GA (2021) An extensive and systematic literature review for hybrid flowshop scheduling problems. Int J Ind Eng Comput 13:185\u2013222","journal-title":"Int J Ind Eng Comput"},{"issue":"1","key":"1288_CR12","first-page":"67","volume":"10","author":"T Lee","year":"2019","unstructured":"Lee T, Loong Y (2019) A review of scheduling problem and resolution methods in flexible flow shop. Int J Ind Eng Comput 10(1):67\u201388","journal-title":"Int J Ind Eng Comput"},{"key":"1288_CR13","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 (2021) A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots. Appl Soft Comput 106:107305","journal-title":"Appl Soft Comput"},{"key":"1288_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107819","volume":"238","author":"B Zhang","year":"2022","unstructured":"Zhang B, Pan QK, Meng LL, Lu C, Mou JH, Li JQ (2022) An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots. Knowl-Based Syst 238:107819","journal-title":"Knowl-Based Syst"},{"key":"1288_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108745","volume":"173","author":"BG Y\u0131lmaz","year":"2022","unstructured":"Y\u0131lmaz BG, Y\u0131lmaz \u00d6F (2022) Lot streaming in hybrid flowshop scheduling problem by considering equal and consistent sublots under machine capability and limited waiting time constraint. Comput Ind Eng 173:108745","journal-title":"Comput Ind Eng"},{"issue":"6","key":"1288_CR16","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1109\/TETCI.2020.3022372","volume":"5","author":"JJ Wang","year":"2020","unstructured":"Wang JJ, Wang L (2020) A bi-population cooperative memetic algorithm for distributed hybrid flow-shop scheduling. IEEE Trans Emerg Top Comput Intell 5(6):947\u2013961","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"1288_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106638","volume":"147","author":"Y Li","year":"2020","unstructured":"Li Y, Li X, Gao L, Meng L (2020) An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times. Comput Ind Eng 147:106638","journal-title":"Comput Ind Eng"},{"key":"1288_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101190","volume":"75","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem. Swarm Evol Comput 75:101190","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"1288_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/TETCI.2022.3174915","volume":"7","author":"Z Shao","year":"2022","unstructured":"Shao Z, Shao W, Pi D (2022) LS-HH: a learning-based selection hyper-heuristic for distributed heterogeneous hybrid blocking flowshop scheduling. IEEE Trans Emerg Top Comput Intell 7(1):111\u2013127","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"1288_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117555","volume":"204","author":"C Lu","year":"2022","unstructured":"Lu C, Liu Q, Zhang B, Yin L (2022) A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop. Expert Syst Appl 204:117555","journal-title":"Expert Syst Appl"},{"key":"1288_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101058","volume":"71","author":"L Meng","year":"2022","unstructured":"Meng L, Gao K, Ren Y, Zhang B, Sang H, Chaoyong Z (2022) Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm Evol Comput 71:101058","journal-title":"Swarm Evol Comput"},{"key":"1288_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108200","volume":"169","author":"XR Tao","year":"2022","unstructured":"Tao XR, Pan QK, Gao L (2022) An efficient self-adaptive artificial bee colony algorithm for the distributed resource-constrained hybrid flowshop problem. Comput Ind Eng 169:108200","journal-title":"Comput Ind Eng"},{"issue":"4","key":"1288_CR23","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1080\/00207543.2022.2031331","volume":"61","author":"J Cai","year":"2022","unstructured":"Cai J, Lei D, Wang J, Wang L (2022) A novel shuffled frog-leaping algorithm with reinforcement learning for distributed assembly hybrid flow shop scheduling. Int J Prod Res 61(4):1233\u20131251","journal-title":"Int J Prod Res"},{"key":"1288_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107309","volume":"158","author":"D Bai","year":"2021","unstructured":"Bai D, Bai X, Yang J, Zhang X, Ren T, Xie C, Liu B (2021) Minimization of maximum lateness in a flowshop learning effect scheduling with release dates. Comput Ind Eng 158:107309","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1288_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, V\u00e1zquez-Rodr\u00edguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1\u201318","journal-title":"Eur J Oper Res"},{"key":"1288_CR26","first-page":"89","volume":"303","author":"QK Pan","year":"2017","unstructured":"Pan QK, Gao L, Li XY, Gao KZ (2017) Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl Math Comput 303:89\u2013112","journal-title":"Appl Math Comput"},{"key":"1288_CR27","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cor.2019.06.009","volume":"111","author":"H \u00d6ztop","year":"2019","unstructured":"\u00d6ztop H, Tasgetiren MF, Eliiyi DT, Pan QK (2019) Metaheuristic algorithms for the hybrid flowshop scheduling problem. Comput Oper Res 111:177\u2013196","journal-title":"Comput Oper Res"},{"issue":"6","key":"1288_CR28","doi-asserted-by":"publisher","first-page":"1900","DOI":"10.1016\/j.cor.2008.06.007","volume":"36","author":"MF Tasgetiren","year":"2009","unstructured":"Tasgetiren MF, Pan QK, Liang YC (2009) A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Comput Oper Res 36(6):1900\u20131915","journal-title":"Comput Oper Res"},{"key":"1288_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108672","volume":"173","author":"A Amirteimoori","year":"2022","unstructured":"Amirteimoori A, Mahdavi I, Solimanpur M, Ali SS, Tirkolaee EB (2022) A parallel hybrid PSO-GA algorithm for the flexible flow-shop scheduling with transportation. Comput Ind Eng 173:108672","journal-title":"Comput Ind Eng"},{"key":"1288_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106432","volume":"161","author":"B Zhang","year":"2024","unstructured":"Zhang B, Meng L, Lu C, Han Y, Sang HY (2024) Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem. Comput Oper Res 161:106432","journal-title":"Comput Oper Res"},{"key":"1288_CR31","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.swevo.2019.01.002","volume":"45","author":"K Peng","year":"2019","unstructured":"Peng K, Pan QK, Gao L, Li X, Das S, Zhang B (2019) A multi-start variable neighbourhood descent algorithm for hybrid flowshop rescheduling. Swarm Evol Comput 45:92\u2013112","journal-title":"Swarm Evol Comput"},{"key":"1288_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101179","volume":"75","author":"Y Yu","year":"2022","unstructured":"Yu Y, Zhang FQ, Yang GD, Wang Y, Huang JP, Han YY (2022) A discrete artificial bee colony method based on variable neighborhood structures for the distributed permutation flowshop problem with sequence-dependent setup times. Swarm Evol Comput 75:101179","journal-title":"Swarm Evol Comput"},{"key":"1288_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.119548","volume":"217","author":"B Zhang","year":"2023","unstructured":"Zhang B, Lu C, Meng LL, Han YY, Sang HY, Jiang XC (2023) Reconfigurable distributed flowshop group scheduling with a nested variable neighborhood descent algorithm. Expert Syst Appl 217:119548","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-023-01288-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01288-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01288-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T15:35:00Z","timestamp":1711812900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01288-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1288"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01288-w","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"assertion":[{"value":"15 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2023","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"}}]}}