{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T13:50:34Z","timestamp":1782827434098,"version":"3.54.5"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.ins.2026.123843","type":"journal-article","created":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T23:30:31Z","timestamp":1782516631000},"page":"123843","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Distributed hybrid interleaving lot scheduling in automotive stamping workshop via dispersion-guided automatic design of constructive-improvement heuristics"],"prefix":"10.1016","volume":"756","author":[{"given":"Liang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying-li","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4148-8172","authenticated-orcid":false,"given":"Biao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1439-4832","authenticated-orcid":false,"given":"Lei-lei","family":"Meng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4175-088X","authenticated-orcid":false,"given":"Xi-ning","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/j.ins.2026.123843_b0005","doi-asserted-by":"crossref","first-page":"4447","DOI":"10.1007\/s10845-024-02484-2","article-title":"Smart scheduling for next generation manufacturing systems: a systematic literature review","volume":"36","author":"Chorghe","year":"2025","journal-title":"J. Intell. Manuf."},{"issue":"1","key":"10.1016\/j.ins.2026.123843_b0010","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1108\/AA-05-2014-043","article-title":"A decision model for kitting and line stocking with variable operator walking distances","volume":"35","author":"Lim\u00e8re","year":"2015","journal-title":"Assem. Autom."},{"issue":"1","key":"10.1016\/j.ins.2026.123843_b0015","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1108\/02635571111099749","article-title":"A methodology for selecting assembly systems feeding policy","volume":"111","author":"Caputo","year":"2011","journal-title":"Ind. Manag. Data Syst."},{"issue":"2","key":"10.1016\/j.ins.2026.123843_b0020","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10898-015-0298-z","article-title":"Two-stage, single-lot, lot streaming problem for a 1+ 2 hybrid flow shop","volume":"66","author":"Cheng","year":"2016","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.ins.2026.123843_b0025","doi-asserted-by":"crossref","unstructured":"Peng, Z., Xiao, R., Zheng, Y., & Li, S. (2025, April). A IHQL-LDTPSA to solve distributed heterogeneous permutation flow shop problem with lot streaming. In2025 6th International Conference on Computer Engineering and Application (ICCEA)(pp. 666-669). IEEE.","DOI":"10.1109\/ICCEA65460.2025.11102349"},{"issue":"1","key":"10.1016\/j.ins.2026.123843_b0030","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/TASE.2022.3151648","article-title":"Improved meta-heuristics for solving distributed lot-streaming permutation flow shop scheduling problems","volume":"20","author":"Pan","year":"2022","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1","key":"10.1016\/j.ins.2026.123843_b0035","doi-asserted-by":"crossref","first-page":"86","DOI":"10.23919\/CSMS.2024.0025","article-title":"Dynamic and heterogeneous identity-based cooperative co-evolution for distributed lot-streaming flowshop scheduling problem","volume":"5","author":"Wang","year":"2025","journal-title":"Compl. Syst. Model. Simul."},{"key":"10.1016\/j.ins.2026.123843_b0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.124874","article-title":"Memetic discrete differential evolution with domain knowledge for blocking scheduling distributed flow shop with lot-streaming constraints","volume":"255","author":"Wang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123843_b0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107305","article-title":"A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots","volume":"106","author":"Zhang","year":"2021","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"10.1016\/j.ins.2026.123843_b0050","doi-asserted-by":"crossref","first-page":"3818","DOI":"10.1109\/TCYB.2022.3164165","article-title":"Solving biobjective distributed flow-shop scheduling problems with lot-streaming using an improved Jaya algorithm","volume":"53","author":"Pan","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.ins.2026.123843_b0055","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.jmsy.2024.01.006","article-title":"Solving multi-objective hybrid flowshop lot-streaming scheduling with consistent and limited sub-lots via a knowledge-based memetic algorithm","volume":"73","author":"Zhu","year":"2024","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.ins.2026.123843_b0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125616","article-title":"An efficient Q-learning integrated multi-objective hyper-heuristic approach for hybrid flow shop scheduling problems with lot streaming","volume":"262","author":"Chen","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123843_b0065","article-title":"Lot streaming in hybrid flowshop scheduling problem by considering equal and consistent sublots under machine capability and limited waiting time constraint","volume":"173","author":"Y\u0131lmaz","year":"2022","journal-title":"Comput. Ind. Eng."},{"issue":"11","key":"10.1016\/j.ins.2026.123843_b0070","doi-asserted-by":"crossref","first-page":"3373","DOI":"10.3934\/jimo.2024058","article-title":"Comparison of lot streaming division methodologies for multi-objective hybrid flowshop scheduling problem by considering limited waiting time","volume":"20","author":"Y\u0131lmaz","year":"2024","journal-title":"J. Ind. Manage. Optim."},{"key":"10.1016\/j.ins.2026.123843_b0075","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107819","article-title":"An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots","volume":"238","author":"Zhang","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2026.123843_b0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2025.111199","article-title":"Stamping workshop scheduling optimization considering multiple constraints under time-of-use electricity pricing","volume":"206","author":"Yan","year":"2025","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.ins.2026.123843_b0085","doi-asserted-by":"crossref","DOI":"10.15837\/ijccc.2025.1.6874","article-title":"Intelligent scheduling of automotive stamping workshops based on an enhanced genetic algorithm","volume":"20","author":"Li","year":"2025","journal-title":"Int. J. Comput. Commun. Control"},{"issue":"21","key":"10.1016\/j.ins.2026.123843_b0090","doi-asserted-by":"crossref","first-page":"6597","DOI":"10.1080\/00207543.2021.1996652","article-title":"A node sequence-based ant colony optimisation algorithm for die scheduling problem with twin-crane transportation","volume":"60","author":"Zhang","year":"2022","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.ins.2026.123843_b0095","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110151","article-title":"Multi-objective evolutionary algorithm-enabled multi-stage collaborative scheduling for automotive production","volume":"191","author":"Zhang","year":"2024","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"10.1016\/j.ins.2026.123843_b0100","doi-asserted-by":"crossref","first-page":"1543","DOI":"10.1007\/s40684-021-00411-x","article-title":"Energy consumption evaluation in stamping workshops via a discrete event simulation-based approach","volume":"9","author":"Xiong","year":"2022","journal-title":"Int. J. Precis. Eng. Manuf. Green Technol."},{"key":"10.1016\/j.ins.2026.123843_b0105","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106866","article-title":"A job assignment scheduling algorithm with variable sublots for lot-streaming flexible job shop problem based on NSGAII","volume":"173","author":"Shao","year":"2025","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"10.1016\/j.ins.2026.123843_b0110","doi-asserted-by":"crossref","first-page":"2397","DOI":"10.1080\/00207543.2025.2578700","article-title":"A matheuristic for lot-streaming scheduling in a flexible job shop with variable sublots and intermingling settings","volume":"64","author":"Zhao","year":"2026","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.ins.2026.123843_b0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2023.107729","article-title":"Production costs and total completion time minimization for three-stage mixed-model assembly job shop scheduling with lot streaming and batch transfer","volume":"130","author":"Cheng","year":"2024","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.ins.2026.123843_b0120","doi-asserted-by":"crossref","DOI":"10.1109\/TSMC.2025.3613727","article-title":"Reinforcement learning assisting artificial bee colony algorithm for scheduling distributed assembly flowshops with batch delivery","author":"Li","year":"2025","journal-title":"IEEE Trans. Syst. Man Cybernet.: Sys."},{"key":"10.1016\/j.ins.2026.123843_b0125","doi-asserted-by":"crossref","unstructured":"Tian, Z., Jiang, X., Liu, W., Tian, G., Li, Z., & Liu, W. (2025). Energy-efficient lot-streaming scheduling method of multi-resource constrained flexible job shop.IEEE Transactions on Systems, Man, and Cybernetics: Systems.","DOI":"10.1109\/TSMC.2025.3593373"},{"key":"10.1016\/j.ins.2026.123843_b0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106432","article-title":"Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem","volume":"161","author":"Zhang","year":"2024","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.ins.2026.123843_b0135","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/s11655-013-1568-6","article-title":"The golden ratio and Loshu-Fibonacci Diagram: Novel research view on relationship of chinese medicine and modern biology","volume":"20","author":"Chen","year":"2014","journal-title":"Chin. J. Integr. Med."},{"issue":"5","key":"10.1016\/j.ins.2026.123843_b0140","doi-asserted-by":"crossref","first-page":"6692","DOI":"10.1109\/TII.2022.3192881","article-title":"A population-based iterated greedy algorithm for distributed assembly no-wait flow-shop scheduling problem","volume":"19","author":"Zhao","year":"2022","journal-title":"IEEE Trans. Ind. Inf."},{"issue":"11","key":"10.1016\/j.ins.2026.123843_b0145","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ins.2026.123843_b0150","first-page":"43","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","journal-title":"Oper. Res. Perspect."},{"key":"10.1016\/j.ins.2026.123843_b0155","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2022.101143","article-title":"An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem","volume":"74","author":"Wang","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.ins.2026.123843_b0160","article-title":"A hybrid measure-based state transition algorithm for robust multiobjective optimization","volume":"123291","author":"Li","year":"2026","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123843_b0165","article-title":"A semi-supervised deep forest framework based on margin distribution optimization for tabular data","volume":"123615","author":"Lyu","year":"2026","journal-title":"Inf. Sci."},{"issue":"5","key":"10.1016\/j.ins.2026.123843_b0170","doi-asserted-by":"crossref","first-page":"4805","DOI":"10.1007\/s40747-023-00984-x","article-title":"BRCE: bi-roles co-evolution for energy-efficient distributed heterogeneous permutation flow shop scheduling with flexible machine speed","volume":"9","author":"Huang","year":"2023","journal-title":"Complex Intell. Syst."},{"key":"10.1016\/j.ins.2026.123843_b0175","unstructured":"Sayah, A., Aqil, S., & Lahby, M. (2025, October). Advanced metaheuristics for bi-criteria optimization in a distributed blocking flow shop problem with setup times. InOperations Research Forum(Vol. 6, No. 4, p. 152). Cham: Springer International Publishing."},{"key":"10.1016\/j.ins.2026.123843_b0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111929","article-title":"Dual optimization approach in discrete hopfield neural network","volume":"164","author":"Guo","year":"2024","journal-title":"Appl. Soft Comput."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526007747?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526007747?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T13:42:54Z","timestamp":1782826974000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526007747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":36,"alternative-id":["S0020025526007747"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123843","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Distributed hybrid interleaving lot scheduling in automotive stamping workshop via dispersion-guided automatic design of constructive-improvement heuristics","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123843","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123843"}}