{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T21:21:24Z","timestamp":1775683284576,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10586-024-04803-x","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T10:29:52Z","timestamp":1737455392000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Multi-objective dynamic distributed flexible job shop scheduling problem considering uncertain processing time"],"prefix":"10.1007","volume":"28","author":[{"given":"Ningtao","family":"Peng","sequence":"first","affiliation":[]},{"given":"Yu","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Zhikai","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Guiliang","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Xiahui","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Kaikai","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"key":"4803_CR1","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1007\/s10845-019-01521-9","volume":"31","author":"G Gong","year":"2020","unstructured":"Gong, G., Chiong, R., Deng, Q., Luo, Q.: A memetic algorithm for multi-objective distributed production scheduling: minimizing the makespan and total energy consumption. J. Intell. Manuf. 31, 1443\u20131466 (2020)","journal-title":"J. Intell. Manuf."},{"key":"4803_CR2","doi-asserted-by":"crossref","first-page":"119840","DOI":"10.1016\/j.eswa.2023.119840","volume":"224","author":"K Zhu","year":"2023","unstructured":"Zhu, K., Gong, G., Peng, N., Zhang, L., Huang, D., Luo, Q., et al.: Dynamic distributed flexible job-shop scheduling problem considering operation inspection. Expert Syst. Appl. 224, 119840 (2023)","journal-title":"Expert Syst. Appl."},{"key":"4803_CR3","doi-asserted-by":"crossref","first-page":"122734","DOI":"10.1016\/j.eswa.2023.122734","volume":"242","author":"J Tang","year":"2023","unstructured":"Tang, J., Gong, G., Peng, N., Zhu, K., Huang, D., Luo, Q.: An effective memetic algorithm for distributed flexible job shop scheduling problem considering integrated sequencing flexibility. Expert Syst. Appl. 242, 122734 (2023)","journal-title":"Expert Syst. Appl."},{"key":"4803_CR4","doi-asserted-by":"crossref","first-page":"117984","DOI":"10.1016\/j.eswa.2022.117984","volume":"207","author":"Q Luo","year":"2022","unstructured":"Luo, Q., Deng, Q., Gong, G., Guo, X., Liu, X.: A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm. Expert Syst. Appl. 207, 117984 (2022)","journal-title":"Expert Syst. Appl."},{"key":"4803_CR5","doi-asserted-by":"crossref","first-page":"121205","DOI":"10.1016\/j.eswa.2023.121205","volume":"237","author":"N Zhu","year":"2024","unstructured":"Zhu, N., Gong, G., Lu, D., Huang, D., Peng, N., Qi, H.: An effective reformative memetic algorithm for distributed flexible job-shop scheduling problem with order cancellation. Expert Syst. Appl. 237, 121205 (2024)","journal-title":"Expert Syst. Appl."},{"key":"4803_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1, 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"key":"4803_CR7","doi-asserted-by":"crossref","first-page":"4406","DOI":"10.1080\/00207543.2019.1653504","volume":"58","author":"G Gong","year":"2020","unstructured":"Gong, G., Chiong, R., Deng, Q., Gong, X.: A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility. Int. J. Prod. Res. 58, 4406\u20134420 (2020)","journal-title":"Int. J. Prod. Res."},{"key":"4803_CR8","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/j.jclepro.2017.10.188","volume":"174","author":"G Gong","year":"2018","unstructured":"Gong, G., Deng, Q., Gong, X., Liu, W., Ren, Q.: A new double flexible job-shop scheduling problem integrating processing time, green production, and human factor indicators. J. Clean. Prod. 174, 560\u2013576 (2018)","journal-title":"J. Clean. Prod."},{"key":"4803_CR9","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1111\/itor.12767","volume":"29","author":"W Lin","year":"2022","unstructured":"Lin, W., Deng, Q., Han, W., Gong, G., Li, K.: An effective algorithm for flexible assembly job-shop scheduling with tight job constraints. Int. Trans. Oper. Res. 29, 496\u2013525 (2022)","journal-title":"Int. Trans. Oper. Res."},{"key":"4803_CR10","doi-asserted-by":"crossref","first-page":"12430","DOI":"10.3390\/app122312430","volume":"12","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Leng, J., Liu, X., Wang, J., Meng, Q.: A Method for dynamic insertion order scheduling in flexible job shops based on digital twins. Appl. Sci. 12, 12430 (2022)","journal-title":"Appl. Sci."},{"key":"4803_CR11","doi-asserted-by":"crossref","first-page":"3516","DOI":"10.1080\/00207543.2012.751509","volume":"51","author":"L Zhang","year":"2013","unstructured":"Zhang, L., Gao, L., Li, X.: A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem. Int. J. Prod. Res. 51, 3516\u20133531 (2013)","journal-title":"Int. J. Prod. Res."},{"key":"4803_CR12","unstructured":"Montgomery, D.C.: Design and analysis of experiments, John Wiley & Sons. Inc, New York. 1997, 200-1 (2001)"},{"key":"4803_CR13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ejor.2009.01.008","volume":"200","author":"L De Giovanni","year":"2010","unstructured":"De Giovanni, L., Pezzella, F.: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur. J. Oper. Res. 200, 395\u2013408 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"4803_CR14","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1007\/s10845-015-1084-y","volume":"28","author":"H-C Chang","year":"2017","unstructured":"Chang, H.-C., Liu, T.-K.: Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. J. Intell. Manuf. 28, 1973\u20131986 (2017)","journal-title":"J. Intell. Manuf."},{"key":"4803_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s12293-018-00278-7","volume":"11","author":"X Wu","year":"2019","unstructured":"Wu, X., Liu, X., Zhao, N.: An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem. Memetic Comput. 11, 335\u2013355 (2019)","journal-title":"Memetic Comput."},{"key":"4803_CR16","doi-asserted-by":"crossref","first-page":"107884","DOI":"10.1016\/j.cie.2021.107884","volume":"164","author":"Y Sang","year":"2022","unstructured":"Sang, Y., Tan, J.: Intelligent factory many-objective distributed flexible job shop collaborative scheduling method. Comput. Ind. Eng. 164, 107884 (2022)","journal-title":"Comput. Ind. Eng."},{"key":"4803_CR17","doi-asserted-by":"crossref","first-page":"191191","DOI":"10.1109\/ACCESS.2020.3032548","volume":"8","author":"L Meng","year":"2020","unstructured":"Meng, L., Ren, Y., Zhang, B., Li, J.-Q., Sang, H., Zhang, C.: MILP modeling and optimization of energy-efficient distributed flexible job shop scheduling problem. IEEE Access. 8, 191191\u2013191203 (2020)","journal-title":"IEEE Access."},{"key":"4803_CR18","doi-asserted-by":"crossref","first-page":"113721","DOI":"10.1016\/j.eswa.2020.113721","volume":"160","author":"Q Luo","year":"2020","unstructured":"Luo, Q., Deng, Q., Gong, G., Zhang, L., Han, W., Li, K.: An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers. Expert Syst. Appl. 160, 113721 (2020)","journal-title":"Expert Syst. Appl."},{"key":"4803_CR19","doi-asserted-by":"crossref","first-page":"100861","DOI":"10.1016\/j.swevo.2021.100861","volume":"62","author":"Y Du","year":"2021","unstructured":"Du, Y., Li, J.Q., Luo, C., Meng, L.L.: A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations. Swarm Evolut. Comput. 62, 100861 (2021)","journal-title":"Swarm Evolut. Comput."},{"key":"4803_CR20","doi-asserted-by":"crossref","first-page":"107211","DOI":"10.1016\/j.cie.2021.107211","volume":"155","author":"K Li","year":"2021","unstructured":"Li, K., Deng, Q., Zhang, L., Fan, Q., Gong, G., Ding, S.: An effective MCTS-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Comput. Ind. Eng. 155, 107211 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"4803_CR21","doi-asserted-by":"crossref","first-page":"4025","DOI":"10.1080\/00207543.2022.2053603","volume":"60","author":"S Shady","year":"2022","unstructured":"Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: A novel feature selection for evolving compact dispatching rules using genetic programming for dynamic job shop scheduling. Int. J. Prod. Res. 60, 4025\u20134048 (2022)","journal-title":"Int. J. Prod. Res."},{"key":"4803_CR22","doi-asserted-by":"crossref","first-page":"1701","DOI":"10.1016\/j.cor.2011.10.006","volume":"39","author":"FS Yao","year":"2012","unstructured":"Yao, F.S., Zhao, M., Zhang, H.: Two-stage hybrid flow shop scheduling with dynamic job arrivals. Comput. Oper. Res. 39, 1701\u20131712 (2012)","journal-title":"Comput. Oper. Res."},{"key":"4803_CR23","doi-asserted-by":"crossref","first-page":"105984","DOI":"10.1016\/j.cie.2019.07.041","volume":"139","author":"C Lei","year":"2020","unstructured":"Lei, C., Zhao, N., Ye, S., Wu, X.: Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times. Ind. Eng. 139, 105984 (2020)","journal-title":"Ind. Eng."},{"key":"4803_CR24","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.compind.2015.10.001","volume":"81","author":"D Tang","year":"2016","unstructured":"Tang, D., Dai, M., Salido, M.A., Giret, A.: Energy-efficient dynamic scheduling for a flexible flow shop using an improved particle swarm optimization. Comput. Ind. 81, 82\u201395 (2016)","journal-title":"Comput. Ind."},{"key":"4803_CR25","doi-asserted-by":"crossref","first-page":"114793","DOI":"10.1016\/j.eswa.2021.114793","volume":"174","author":"W Yankai","year":"2021","unstructured":"Yankai, W., Shilong, W., Dong, L., Chunfeng, S., Bo, Y.: An improved multi-objective whale optimization algorithm for the hybrid flow shop scheduling problem considering device dynamic reconfiguration processes. Expert Syst. Appl. 174, 114793 (2021)","journal-title":"Expert Syst. Appl."},{"key":"4803_CR26","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1007\/s10845-015-1144-3","volume":"29","author":"W Qin","year":"2018","unstructured":"Qin, W., Zhang, J., Song, D.: An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time. J. Intell. Manuf. 29, 891\u2013904 (2018)","journal-title":"J. Intell. Manuf."},{"key":"4803_CR27","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.cie.2016.03.011","volume":"96","author":"N Kundakc\u0131","year":"2016","unstructured":"Kundakc\u0131, N., Kulak, O.: Hybrid genetic algorithms for minimizing makespan in dynamic job shop scheduling problem. Comput. Ind. Eng. 96, 31\u201351 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"4803_CR28","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.procir.2021.11.069","volume":"104","author":"S Shady","year":"2021","unstructured":"Shady, S., Kaihara, T., Fujii, N., Kokuryo, D.: Evolving dispatching rules using genetic programming for multi-objective dynamic job shop scheduling with machine breakdowns. Procedia CIRP. 104, 411\u2013416 (2021)","journal-title":"Procedia CIRP."},{"key":"4803_CR29","doi-asserted-by":"crossref","first-page":"100594","DOI":"10.1016\/j.swevo.2019.100594","volume":"51","author":"Z Wang","year":"2019","unstructured":"Wang, Z., Zhang, J., Yang, S.: An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals. Swarm Evolut. Comput. 51, 100594 (2019)","journal-title":"Swarm Evolut. Comput."},{"key":"4803_CR30","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1080\/00207540802662896","volume":"48","author":"M Zandieh","year":"2010","unstructured":"Zandieh, M., Adibi, M.: Dynamic job shop scheduling using variable neighbourhood search. Int. J. Prod. Res. 48, 2449\u20132458 (2010)","journal-title":"Int. J. Prod. Res."},{"key":"4803_CR31","first-page":"909","volume":"9","author":"H Zhang","year":"2021","unstructured":"Zhang, H., Buchmeister, B., Li, X., Ojstersek, R.: Advanced metaheuristic method for decision-making in a dynamic job shop scheduling environment. Math. Oper. Res. 9, 909 (2021)","journal-title":"Math. Oper. Res."},{"key":"4803_CR32","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s12652-016-0370-7","volume":"7","author":"T Ning","year":"2016","unstructured":"Ning, T., Huang, M., Liang, X., Jin, H.: A novel dynamic scheduling strategy for solving flexible job-shop problems. J. Ambient. Intell. Humaniz. Comput. 7, 721\u2013729 (2016)","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"4803_CR33","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1016\/j.jclepro.2018.10.289","volume":"209","author":"X Gong","year":"2019","unstructured":"Gong, X., De Pessemier, T., Martens, L., Joseph, W.: Energy-and labor-aware flexible job shop scheduling under dynamic electricity pricing: a many-objective optimization investigation. J. Clean. Prod. 209, 1078\u20131094 (2019)","journal-title":"J. Clean. Prod."},{"key":"4803_CR34","doi-asserted-by":"crossref","first-page":"102412","DOI":"10.1016\/j.rcim.2022.102412","volume":"78","author":"Y Zhang","year":"2022","unstructured":"Zhang, Y., Zhu, H., Tang, D., Zhou, T., Gui, Y.: Dynamic job shop scheduling based on deep reinforcement learning for multi-agent manufacturing systems. Robotics Comput. Integr. Manuf. 78, 102412 (2022)","journal-title":"Robotics Comput. Integr. Manuf."},{"key":"4803_CR35","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4803_CR36","doi-asserted-by":"crossref","first-page":"1691","DOI":"10.1007\/s11081-020-09494-y","volume":"21","author":"H Zhu","year":"2020","unstructured":"Zhu, H., Deng, Q., Zhang, L., Hu, X., Lin, W.: Low carbon flexible job shop scheduling problem considering worker learning using a memetic algorithm. Optim. Eng. Technol. 21, 1691\u20131716 (2020)","journal-title":"Optim. Eng. Technol."},{"key":"4803_CR37","unstructured":"Barnes, J., Chambers, J.: Flexible job shop scheduling by tabu search, Graduate program in operations research and industrial engineering. The University of Texas at Austin. (1996)."},{"key":"4803_CR38","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41, 157\u2013183 (1993)","journal-title":"Ann. Oper. Res."},{"key":"4803_CR39","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0377-2217(97)00341-X","volume":"107","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1998","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Roux, W., Lasserre, J.B.: Multi-resource shop scheduling with resource flexibility. Eur. J. Oper. Res. 107, 289\u2013305 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"4803_CR40","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"J Hurink","year":"1994","unstructured":"Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. Oper. Res. Spektrum. 15, 205\u2013215 (1994)","journal-title":"Oper. Res. Spektrum."},{"key":"4803_CR41","first-page":"151","volume":"12","author":"W Wisittipanich","year":"2013","unstructured":"Wisittipanich, W., Kachitvichyanukul, V.: An efficient PSO algorithm for finding Pareto-frontier in multi-objective job shop scheduling problems. Ind. Eng. Manag. Syst. 12, 151\u2013160 (2013)","journal-title":"Ind. Eng. Manag. Syst."},{"key":"4803_CR42","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10710-005-6164-x","volume":"6","author":"CAC Coello","year":"2005","unstructured":"Coello, C.A.C., Cort\u00e9s, N.C.: Solving multiobjective optimization problems using an artificial immune system. Genet. Program Evolvable Mach. 6, 163\u2013190 (2005)","journal-title":"Genet. Program Evolvable Mach."},{"key":"4803_CR43","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3, 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04803-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-024-04803-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04803-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T21:53:04Z","timestamp":1747777984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-024-04803-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,21]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["4803"],"URL":"https:\/\/doi.org\/10.1007\/s10586-024-04803-x","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,21]]},"assertion":[{"value":"16 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2025","order":4,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"185"}}