{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:28:56Z","timestamp":1762338536919,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T00:00:00Z","timestamp":1686787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T00:00:00Z","timestamp":1686787200000},"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":["72188101"],"award-info":[{"award-number":["72188101"]}],"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":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Due to various interference factors, a pre-planned assembly scheme and its cycle time can be disturbed, resulting in the failure of product delivery on schedule. However, when assembly data of the production line can be obtained in real time, the balance of the assembly line could be dynamically adjusted in case of experiencing serious interferences to optimize its cycle time in time and improve its production efficiency. Therefore, this paper proposes a dynamic rebalancing framework by integrating real time manufacturing data into a novel serial two-stage adaptive alternate genetic fireworks algorithm for solving a stochastic type-II simple assembly line balancing problem (SSALBP-II). MES (manufacturing execution system) is used to obtain some real time data such as the resource status, operation information and task information and to judge abnormal phenomenon and the overdue delivery caused by interferences. On this basis, the stochastic type-II simple assembly line balance model is constructed, with a new serial two-stage adaptive alternate genetic fireworks algorithm (STAGFA). This new algorithm can incorporate both genetic algorithm and fireworks algorithm to solve the model according to the transformation of population diversity discrimination index. Through the comparison between STAGFA and other algorithms such as fireworks algorithm, genetic algorithm, other improved intelligent algorithms, it is proved that the STAGFA is effective and superior in solving the assembly line (re)balance problem. Then, the rebalanced scheme verified by simulation is dispatched to control the physical assembly line and realize dynamic rebalancing cycle time effectively.<\/jats:p>","DOI":"10.1007\/s40747-023-01091-7","type":"journal-article","created":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T03:28:01Z","timestamp":1686799681000},"page":"7075-7102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Integrating real-time manufacturing data into a novel serial two-stage adaptive alternate genetic fireworks algorithm for solving stochastic type-II simple assembly line balancing problem"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7023-7607","authenticated-orcid":false,"given":"Fei","family":"Peng","sequence":"first","affiliation":[]},{"given":"Li","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,15]]},"reference":[{"key":"1091_CR1","first-page":"1","volume":"2","author":"M Pnarba","year":"2020","unstructured":"Pnarba M, Alaka HM (2020) Balancing stochastic type-II assembly lines: chance-constrained mixed integer and constraint programming models[J]. Eng Optim 2:1\u201318","journal-title":"Eng Optim"},{"key":"1091_CR2","unstructured":"Bulut A (2012) Simple assembly line balancing problem (SALBP), Type 2."},{"issue":"1","key":"1091_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/0305215X.2018.1439944","volume":"51","author":"A Nourmohammadi","year":"2019","unstructured":"Nourmohammadi A, Eskandari H, Fathi M (2019) Design of stochastic assembly lines considering line balancing and part feeding with supermarkets. Eng Optim 51(1):63\u201383","journal-title":"Eng Optim"},{"key":"1091_CR4","unstructured":"Scholl A (1999) Balancing and sequencing of assembly lines (No. 10881). Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL)."},{"issue":"3","key":"1091_CR5","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1016\/j.ejor.2006.04.042","volume":"180","author":"K A\u011fpak","year":"2007","unstructured":"A\u011fpak K, G\u00f6k\u00e7en H (2007) A chance-constrained approach to stochastic line balancing problem. Eur J Oper Res 180(3):1098\u20131115","journal-title":"Eur J Oper Res"},{"key":"1091_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.omega.2017.06.008","volume":"78","author":"Y Bukchin","year":"2018","unstructured":"Bukchin Y, Raviv T (2018) Constraint programming for solving various assembly line balancing problems. Omega 78:57\u201368","journal-title":"Omega"},{"key":"1091_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105235","volume":"131","author":"Z Li","year":"2021","unstructured":"Li Z, Kucukkoc I, Tang Q (2021) Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem. Comput Oper Res 131:105235","journal-title":"Comput Oper Res"},{"key":"1091_CR8","doi-asserted-by":"crossref","unstructured":"Zhang Y, Hu X, Wu C (2018) Heuristic algorithm for type II two-sided assembly line rebalancing problem with multi-objective. In: MATEC web of conferences (Vol. 175, p. 03063). EDP Sciences.","DOI":"10.1051\/matecconf\/201817503063"},{"issue":"9","key":"1091_CR9","doi-asserted-by":"publisher","first-page":"3043","DOI":"10.1080\/00207543.2017.1402136","volume":"56","author":"Y Zhang","year":"2018","unstructured":"Zhang Y, Hu X, Wu C (2018) A modified multi-objective genetic algorithm for two-sided assembly line re-balancing problem of a shovel loader. Int J Prod Res 56(9):3043\u20133063","journal-title":"Int J Prod Res"},{"issue":"12","key":"1091_CR10","doi-asserted-by":"publisher","first-page":"3589","DOI":"10.1080\/00207543.2019.1633023","volume":"58","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, Hu X, Wu C (2020) Improved imperialist competitive algorithms for rebalancing multi-objective two-sided assembly lines with space and resource constraints. Int J Prod Res 58(12):3589\u20133617","journal-title":"Int J Prod Res"},{"issue":"16","key":"1091_CR11","doi-asserted-by":"publisher","first-page":"5324","DOI":"10.1080\/00207543.2018.1467061","volume":"56","author":"I Belassiria","year":"2018","unstructured":"Belassiria I, Mazouzi M, Elfezazi S, Cherrafi A, ELMaskaoui Z (2018) An integrated model for assembly line re-balancing problem. Int J Prod Res 56(16):5324\u20135344","journal-title":"Int J Prod Res"},{"key":"1091_CR12","doi-asserted-by":"crossref","unstructured":"Fathi M, Nourmohammadi A, Ng A, et al. (2019) An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem[J]. Eng Comput. (ahead-of-print(ahead-of-print))","DOI":"10.1108\/EC-02-2019-0053"},{"issue":"24","key":"1091_CR13","doi-asserted-by":"publisher","first-page":"7334","DOI":"10.1080\/00207543.2017.1346316","volume":"55","author":"Y Li","year":"2017","unstructured":"Li Y (2017) The type-II assembly line rebalancing problem considering stochastic task learning. Int J Prod Res 55(24):7334\u20137355","journal-title":"Int J Prod Res"},{"key":"1091_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cie.2018.06.014","volume":"123","author":"H Babazadeh","year":"2018","unstructured":"Babazadeh H, Alavidoost MH, Zarandi MF, Sayyari ST (2018) An enhanced NSGA-II algorithm for fuzzy bi-objective assembly line balancing problems. Comput Ind Eng 123:189\u2013208","journal-title":"Comput Ind Eng"},{"key":"1091_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107195","volume":"156","author":"A Karas","year":"2021","unstructured":"Karas A, Ozcelik F (2021) Assembly line worker assignment and rebalancing problem: a mathematical model and an artificial bee colony algorithm. Comput Ind Eng 156:107195","journal-title":"Comput Ind Eng"},{"key":"1091_CR16","doi-asserted-by":"crossref","unstructured":"Zhang JH, Li AP, Liu XM (2019) Hybrid genetic algorithm for a type-II robust mixed-model assembly line balancing problem with interval task times [J]. Adv Manuf 7(10)","DOI":"10.1007\/s40436-019-00256-3"},{"issue":"3","key":"1091_CR17","first-page":"1","volume":"28","author":"W Zhang","year":"2015","unstructured":"Zhang W, Xu W, Liu G et al (2015) An effective hybrid evolutionary algorithm for stochastic multiobjective assembly line balancing problem[J]. J Intell Manuf 28(3):1\u20138","journal-title":"J Intell Manuf"},{"key":"1091_CR18","unstructured":"Ying T, Zhu Y (2010) Fireworks algorithm for optimization. In: International Conference in Swarm Intelligence. Springer"},{"issue":"3","key":"1091_CR19","doi-asserted-by":"publisher","first-page":"4236","DOI":"10.1007\/s11227-021-04018-6","volume":"78","author":"AM Yadav","year":"2022","unstructured":"Yadav AM, Tripathi KN, Sharma SC (2022) A bi-objective task scheduling approach in fog computing using hybrid fireworks algorithm. J Supercomput 78(3):4236\u20134260","journal-title":"J Supercomput"},{"key":"1091_CR20","unstructured":"Wang Y, Zheng Y, Xue H, Mi Y (2021) Optimal dispatch of mobile energy storage for peak load shifting based on enhanced firework algorithm. Autom Elect Power Syst 45(5):48\u201356.1"},{"key":"1091_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2021.126008","volume":"399","author":"ZX He","year":"2021","unstructured":"He ZX, Pan YH, Wang KJ, Xiao LM, Wang X (2021) Area optimization for MPRM logic circuits based on improved multiple disturbances fireworks algorithm. Appl Math Comput 399:126008","journal-title":"Appl Math Comput"},{"issue":"18","key":"1091_CR22","doi-asserted-by":"publisher","first-page":"5161","DOI":"10.3390\/s20185161","volume":"20","author":"B Liang","year":"2020","unstructured":"Liang B, Liu W, Liu K, Zhou M, Zhang Y, Jia Z (2020) A displacement field perception method for component digital twin in aircraft assembly. Sensors 20(18):5161","journal-title":"Sensors"},{"key":"1091_CR23","doi-asserted-by":"crossref","unstructured":"Zhang Y, Huang J, Liu X, Ni Z (2021) Digital twin-based process optimization system research for micro-assembly products. In: 2021 International Conference on Computer, Control and Robotics (ICCCR) (pp. 133\u2013137). IEEE","DOI":"10.1109\/ICCCR49711.2021.9349272"},{"key":"1091_CR24","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.jmsy.2021.03.015","volume":"59","author":"Z Zhu","year":"2021","unstructured":"Zhu Z, Xi X, Xu X, Cai Y (2021) Digital Twin-driven machining process for thin-walled part manufacturing. J Manuf Syst 59:453\u2013466","journal-title":"J Manuf Syst"},{"key":"1091_CR25","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.jmsy.2020.05.011","volume":"58","author":"C Zhuang","year":"2021","unstructured":"Zhuang C, Gong J, Liu J (2021) Digital twin-based assembly data management and process traceability for complex products. J Manuf Syst 58:118\u2013131","journal-title":"J Manuf Syst"},{"issue":"1\u20134","key":"1091_CR26","first-page":"1149","volume":"96","author":"Z Cunbo","year":"2018","unstructured":"Cunbo Z, Liu J, Xiong H (2018) Digital twin-based smart production management and control framework for the complex product assembly shop-floor. Int J Adv Manufact Technol 96(1\u20134):1149\u20131163","journal-title":"Int J Adv Manufact Technol"},{"key":"1091_CR27","doi-asserted-by":"crossref","unstructured":"Sun H, Li C, Fang X, Gu H (2017) Optimized throughput improvement of assembly flow line with digital twin online analytics. In: 2017 IEEE International Conference on Robotics and Biomimetics (ROBIO) (pp. 1833\u20131837). IEEE","DOI":"10.1109\/ROBIO.2017.8324685"},{"key":"1091_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2020.102088","volume":"70","author":"LC Wang","year":"2021","unstructured":"Wang LC, Chen CC, Liu JL et al (2021) Framework and deployment of a cloud-based advanced planning and scheduling system[J]. Robot Comput Integr Manuf 70:102088","journal-title":"Robot Comput Integr Manuf"},{"key":"1091_CR29","doi-asserted-by":"crossref","unstructured":"Nov\u00e1k P, Vysko\u010dil J, Kadera P (2019) Plan executor mes: manufacturing execution system combined with a planner for Industry 4.0 production systems[C]. On: Industrial Applications of Holonic and Multi-Agent Systems: 9th International Conference, HoloMAS 2019, Linz, Austria, August 26\u201329, 2019, Proceedings 9. Springer International Publishing, 67\u201380","DOI":"10.1007\/978-3-030-27878-6_6"},{"issue":"6","key":"1091_CR30","doi-asserted-by":"publisher","first-page":"943","DOI":"10.20965\/ijat.2020.p0943","volume":"14","author":"R Yonemoto","year":"2020","unstructured":"Yonemoto R, Suwa H (2020) Task scheduling of material-handling manipulator for enhancing energy efficiency in flow-type FMS[J]. Int J Autom Technol 14(6):943\u2013950","journal-title":"Int J Autom Technol"},{"key":"1091_CR31","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jmsy.2020.05.012","volume":"58","author":"H Jiang","year":"2021","unstructured":"Jiang H, Qin S, Fu J, Zhang J, Ding G (2021) How to model and implement connections between physical and virtual models for digital twin application. J Manuf Syst 58:36\u201351","journal-title":"J Manuf Syst"},{"key":"1091_CR32","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jmsy.2021.05.007","volume":"60","author":"J Zhang","year":"2021","unstructured":"Zhang J, Deng T, Jiang H, Chen H, Qin S, Ding G (2021) Bi-level dynamic scheduling architecture based on service unit digital twin agents. J Manuf Syst 60:59\u201379","journal-title":"J Manuf Syst"},{"key":"1091_CR33","doi-asserted-by":"crossref","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"1091_CR34","doi-asserted-by":"crossref","unstructured":"Tan Y, Zhu Y (2010) Fireworks algorithm for optimization. In International conference in swarm intelligence (pp. 355\u2013364). Springer, Berlin, Heidelberg","DOI":"10.1007\/978-3-642-13495-1_44"},{"key":"1091_CR35","unstructured":"Pascoe TL (1965) An experimental comparison of heuristic methods for allocating resources. Queens' College"},{"key":"1091_CR36","doi-asserted-by":"publisher","first-page":"106060","DOI":"10.1016\/j.cie.2019.106060","volume":"137","author":"H Chen","year":"2019","unstructured":"Chen H, Ding G, Zhang J, Qin S (2019) Research on priority rules for the stochastic resource constrained multi-project scheduling problem with new project arrival. Comput Ind Eng 137:106060","journal-title":"Comput Ind Eng"},{"key":"1091_CR37","doi-asserted-by":"publisher","first-page":"32385","DOI":"10.1109\/ACCESS.2020.2973758","volume":"8","author":"S Wang","year":"2020","unstructured":"Wang S, Zhao T, Pang S (2020) Task scheduling algorithm based on improved firework algorithm in fog computing. IEEE Access 8:32385\u201332394","journal-title":"IEEE Access"},{"key":"1091_CR38","doi-asserted-by":"crossref","unstructured":"Zhang J, Ding G, Zou Y, Qin S, Fu J (2019) Review of job shop scheduling research and its new perspectives under Industry 4.0. J Intell Manuf 30(4):1809\u20131830.","DOI":"10.1007\/s10845-017-1350-2"},{"issue":"1","key":"1091_CR39","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174(1):23\u201337","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1091_CR40","doi-asserted-by":"publisher","first-page":"04019055","DOI":"10.1061\/(ASCE)CP.1943-5487.0000874","volume":"34","author":"J Liu","year":"2020","unstructured":"Liu J, Liu Y, Shi Y, Li J (2020) Solving resource-constrained project scheduling problem via genetic algorithm. J Comput Civ Eng 34(2):04019055","journal-title":"J Comput Civ Eng"},{"key":"1091_CR41","unstructured":"Li Y, Li Z, Saldanha-da-Gama F (2021) New approaches for rebalancing an assembly line with disruptions. Int J Comput Integr Manuf:1\u201318."}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01091-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01091-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01091-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T19:03:44Z","timestamp":1698433424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01091-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,15]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1091"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01091-7","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2023,6,15]]},"assertion":[{"value":"5 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 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":"We are glad to submit the enclosed manuscript entitled \u201cIntegrating real-time manufacturing data into a novel serial two-stage adaptive alternate genetic fireworks algorithm for solving stochastic type-II simple assembly line balancing problem\u201d, which we hope to be considered for publication in \u201cComplex & Intelligent Systems\u201d. No conflict of interest exits in the submission of this manuscript, and the manuscript is approved by all authors for publication. We would like to declare on behalf of my co-authors that the work described is original research that has not been published previously, and not under consideration for publication elsewhere, in whole or in part. All the authors listed have approved the manuscript that is enclosed.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}