{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T05:22:39Z","timestamp":1776921759927,"version":"3.51.2"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T00:00:00Z","timestamp":1618012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T00:00:00Z","timestamp":1618012800000},"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":["1645"],"award-info":[{"award-number":["1645"]}],"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":[[2022,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The distributed manufacturing has become a prevail production mode under the economic globalization. In this article, a memetic discrete differential evolution (MDDE) algorithm is proposed to address the distributed permutation flow shop scheduling problem (DPFSP) with the minimization of the makespan. An enhanced NEH (Nawaz\u2013Enscore\u2013Ham) method is presented to produce potential candidate solutions and Taillard\u2019s acceleration method is adopted to ameliorate the operational efficiency of the MDDE. A new discrete mutation strategy is introduced to promote the search efficiency of the MDDE. Four neighborhood structures, which are based on job sequence and factory assignment adjustment mechanisms, are introduced to prevent the candidates from falling the local optimum during the search process. A neighborhood search mechanism is selected adaptively through a knowledge-based strategy which focuses on the adaptive evaluation for the neighborhood selection. The optimal combinations of parameters in the MDDE algorithm are testified by the design of experiment. The computational results and comparisons demonstrated the effectiveness of the MDDE algorithm for solving the DPFSP.<\/jats:p>","DOI":"10.1007\/s40747-021-00354-5","type":"journal-article","created":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T12:02:39Z","timestamp":1618056159000},"page":"141-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7336-9699","authenticated-orcid":false,"given":"Fuqing","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Xiaotong","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zekai","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,10]]},"reference":[{"key":"354_CR1","doi-asserted-by":"publisher","first-page":"100557","DOI":"10.1016\/j.swevo.2019.100557","volume":"50","author":"JF Chen","year":"2019","unstructured":"Chen JF, Wang L, Peng ZP (2019) A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling. Swarm Evol Comput 50:100557","journal-title":"Swarm Evol Comput"},{"key":"354_CR2","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1109\/TASE.2018.2886303","volume":"16","author":"WS Shao","year":"2018","unstructured":"Shao WS, Pi DC, Shao ZS (2018) A pareto-based estimation of distribution algorithm for solving multi objective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time. IEEE Trans Autom Sci Eng 16:1344\u20131360","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"354_CR3","doi-asserted-by":"publisher","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, Wang P, Han YY, Gao KZ, Duan P (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":"354_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.knosys.2017.09.026","volume":"137","author":"WS Shao","year":"2017","unstructured":"Shao WS, Pi DC, Shao ZS (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":"354_CR5","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 flow shop scheduling problem. Omega Int J Manag Sci 83:213\u2013222","journal-title":"Omega Int J Manag Sci"},{"key":"354_CR6","doi-asserted-by":"publisher","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, Ma WM, Zhang C, Song HB (2019) A hybrid biogeography-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":"354_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.eswa.2017.09.028","volume":"91","author":"FQ Zhao","year":"2018","unstructured":"Zhao FQ, Liu H, Zhang Y, Ma WM (2018) A discrete water wave optimization algorithm for no-wait flow shop scheduling problem. Expert Syst Appl 91:347\u2013363","journal-title":"Expert Syst Appl"},{"key":"354_CR8","doi-asserted-by":"publisher","first-page":"3362","DOI":"10.1007\/s10489-019-01457-w","volume":"49","author":"FQ Zhao","year":"2019","unstructured":"Zhao FQ, Xue FL, Zhang Y, Ma WM, Zhang C, Song HB (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":"354_CR9","doi-asserted-by":"publisher","first-page":"104894","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":"354_CR10","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Pan Q-K, Kizilay D, Velez-Gallego MC (2019) A variable block insertion heuristic for permutation flow shops with makespan criterion. 2017 IEEE congress on evolutionary computation, vol 12","DOI":"10.1109\/CEC.2017.7969382"},{"key":"354_CR11","doi-asserted-by":"publisher","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 flow shop scheduling problem. Comput Oper Res 37:754\u2013768","journal-title":"Comput Oper Res"},{"key":"354_CR12","doi-asserted-by":"publisher","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 JM (2018) The distributed permutation flow shop to minimise the total flowtime. Comput Ind Eng 118:464\u2013477","journal-title":"Comput Ind Eng"},{"key":"354_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","volume":"124","author":"QK Pan","year":"2019","unstructured":"Pan QK, Gao L, Wang L, Liang J, Li XY (2019) Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flow shop problem. Expert Syst Appl 124:309\u2013324","journal-title":"Expert Syst Appl"},{"key":"354_CR14","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/TSMC.2017.2788879","volume":"50","author":"JJ Wang","year":"2020","unstructured":"Wang JJ, Wang LA (2020) Knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop. IEEE Trans Syst Man Cybern Syst 50:1805\u20131819","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"354_CR15","doi-asserted-by":"crossref","first-page":"172988141987981","DOI":"10.1177\/1729881419879819","volume":"16","author":"WH Li","year":"2019","unstructured":"Li WH, Li JQ, Gao KZ, Han YY, Niu B, Liu ZM, Sun Q (2019) Solving robotic distributed flow shop problem using an improved iterated greedy algorithm. Int J Adv Robot Syst 16:1729881419879819","journal-title":"Int J Adv Robot Syst"},{"key":"354_CR16","doi-asserted-by":"publisher","first-page":"105492","DOI":"10.1016\/j.asoc.2019.105492","volume":"81","author":"QK Pan","year":"2019","unstructured":"Pan QK, Gao L, Li XY, Jose FM (2019) Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flow shop scheduling problem. Appl Soft Comput 81:105492","journal-title":"Appl Soft Comput"},{"key":"354_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341\u2013359","journal-title":"J Glob Optim"},{"key":"354_CR18","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.knosys.2017.11.015","volume":"141","author":"Z Meng","year":"2018","unstructured":"Meng Z, Pan J-S, Kong L (2018) Parameters with adaptive learning mechanism (PALM) for the enhancement of differential evolution. Knowl Based Syst 141:92\u2013112","journal-title":"Knowl Based Syst"},{"key":"354_CR19","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.knosys.2019.01.006","volume":"168","author":"Z Meng","year":"2019","unstructured":"Meng Z, Pan J-S, Tseng K-K (2019) PaDE: an enhanced differential evolution algorithm with novel control parameter adaptation schemes for numerical optimization. Knowl Based Syst 168:80\u201399","journal-title":"Knowl Based Syst"},{"key":"354_CR20","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","volume":"13","author":"J Zhang","year":"2009","unstructured":"Zhang J, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13:945\u2013958","journal-title":"IEEE Trans Evol Comput"},{"key":"354_CR21","doi-asserted-by":"crossref","unstructured":"Brest J, Maucec MS, Boskovic B, (2017) IEEE (2017) Single objective real-parameter optimization: algorithm jSO. 2017 IEEE congress on evolutionary computation, pp 1311\u20131318","DOI":"10.1109\/CEC.2017.7969456"},{"key":"354_CR22","doi-asserted-by":"crossref","unstructured":"Brest J, Maucec MS, Boskovic B, (2016) IEEE (2016) iL-SHADE: improved L-SHADE algorithm for single objective real-parameter optimization. 2016 IEEE congress on evolutionary computation, pp 1188\u20131195","DOI":"10.1109\/CEC.2016.7743922"},{"key":"354_CR23","doi-asserted-by":"crossref","unstructured":"Tanabe R, Fukunaga AS, (2014) Improving the search performance of shade using linear population size reduction. 2014 IEEE congress on evolutionary computation. IEEE, pp 1658\u20131665","DOI":"10.1109\/CEC.2014.6900380"},{"key":"354_CR24","doi-asserted-by":"crossref","unstructured":"Mohamed AW, Hadi AA, Fattouh AM, Jambi KM, (2017) IEEE (2017) LSHADE with semi-parameter adaptation hybrid with CMA-ES for solving CEC 2017 benchmark problems, 2017 IEEE congress on evolutionary computation, pp 145\u2013152","DOI":"10.1109\/CEC.2017.7969307"},{"key":"354_CR25","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.eswa.2018.08.012","volume":"115","author":"F Zhao","year":"2019","unstructured":"Zhao F, Qin S, Zhang Y, Ma W, Zhang C, Song H (2019) A two-stage differential biogeography-based optimization algorithm and its performance analysis. Expert Syst Appl 115:329\u2013345","journal-title":"Expert Syst Appl"},{"key":"354_CR26","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.eswa.2018.07.008","volume":"113","author":"F Zhao","year":"2018","unstructured":"Zhao F, Xue F, Zhang Y, Ma W, Zhang C, Song H (2018) A hybrid algorithm based on self-adaptive gravitational search algorithm and differential evolution. Expert Syst Appl 113:515\u2013530","journal-title":"Expert Syst Appl"},{"key":"354_CR27","unstructured":"Wu X, Liu X (2018) An Improved Differential Evolution Algorithm for Solving a Distributed Flexible Job Shop Scheduling Problem. In: Reveliotis S, Cappelleri D, Dimarogonas DV et al. (eds) 2018 IEEE 14th international conference on automation science and engineering, IEEE international conference on automation science and engineering. pp 968\u2013973"},{"key":"354_CR28","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s00521-016-2692-y","volume":"30","author":"B-H Zhou","year":"2018","unstructured":"Zhou B-H, Hu L-M, Zhong Z-Y (2018) A hybrid differential evolution algorithm with estimation of distribution algorithm for reentrant hybrid flow shop scheduling problem. Neural Comput Appl 30:193\u2013209","journal-title":"Neural Comput Appl"},{"key":"354_CR29","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.engappai.2018.09.005","volume":"76","author":"G Zhang","year":"2018","unstructured":"Zhang G, Xing K, 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":"354_CR30","doi-asserted-by":"publisher","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":"354_CR31","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"37","author":"L Wang","year":"2010","unstructured":"Wang L, Pan Q-K, Suganthan PN, Wang W-H, Wang Y-M (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":"354_CR32","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2006","unstructured":"Montgomery DC (2006) Design and analysis of experiments, 9th edn. Wiley, New York","edition":"9"},{"key":"354_CR33","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47:65\u201374","journal-title":"Eur J Oper Res"},{"key":"354_CR34","doi-asserted-by":"publisher","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":"354_CR35","doi-asserted-by":"crossref","unstructured":"Stanovov V, Akhmedova S, Semenkin E, (2018) IEEE (2018) LSHADE algorithm with rank-based selective pressure strategy for solving CEC 2017 benchmark problems. 2018 IEEE congress on evolutionary computation, pp 1\u20138","DOI":"10.1109\/CEC.2018.8477977"},{"key":"354_CR36","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2013.10.002","volume":"44","author":"Q-K Pan","year":"2014","unstructured":"Pan Q-K, Ruiz R (2014) An effective iterated greedy algorithm for the mixed no-idle permutation flow shop scheduling problem. Omega Int J Manag Sci 44:41\u201350","journal-title":"Omega Int J Manag Sci"},{"key":"354_CR37","doi-asserted-by":"crossref","unstructured":"Shao Z, Pi D, Shao W, Yuan P (2019) An efficient discrete invasive weed optimization for blocking flow-shop scheduling problem. Eng Appl Artif Intell 78:124\u2013141","DOI":"10.1016\/j.engappai.2018.11.005"},{"key":"354_CR38","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garcia","year":"2009","unstructured":"Garcia S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 special session on real parameter optimization. J Heuristics 15:617\u2013644","journal-title":"J Heuristics"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00354-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00354-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00354-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T12:28:24Z","timestamp":1646310504000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00354-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,10]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["354"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00354-5","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,10]]},"assertion":[{"value":"24 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}