{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:26:11Z","timestamp":1759667171942,"version":"3.37.3"},"reference-count":51,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,11,28]],"date-time":"2020-11-28T00:00:00Z","timestamp":1606521600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&D Program of China","award":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"],"award-info":[{"award-number":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"]}]},{"name":"European Commission Marie Sk\u0142odowska-Curie SMOOTH","award":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"],"award-info":[{"award-number":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"],"award-info":[{"award-number":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"],"award-info":[{"award-number":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008095","name":"Yanshan University","doi-asserted-by":"publisher","award":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"],"award-info":[{"award-number":["2018YFB1308300","H2020-MSCA-RISE-2016-734875","2018M631620","4202026","BL18007"]}],"id":[{"id":"10.13039\/501100008095","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,11,28]]},"abstract":"<jats:p>Due to the NP-hard nature, the permutation flowshop scheduling problem (PFSSP) is a fundamental issue for Industry 4.0, especially under higher productivity, efficiency, and self-managing systems. This paper proposes an improved genetic-shuffled frog-leaping algorithm (IGSFLA) to solve the permutation flowshop scheduling problem. In the proposed IGSFLA, the optimal initial frog (individual) in the initialized group is generated according to the heuristic optimal-insert method with fitness constrain. The crossover mechanism is applied to both the subgroup and the global group to avoid the local optimal solutions and accelerate the evolution. To evolve the frogs with the same optimal fitness more outstanding, the disturbance mechanism is applied to obtain the optimal frog of the whole group at the initialization step and the optimal frog of the subgroup at the searching step. The mathematical model of PFSSP is established with the minimum production cycle (makespan) as the objective function, the fitness of frog is given, and the IGSFLA-based PFSSP is proposed. Experimental results have been given and analyzed, showing that IGSFLA not only provides the optimal scheduling performance but also converges effectively.<\/jats:p>","DOI":"10.1155\/2020\/3450180","type":"journal-article","created":{"date-parts":[[2020,11,29]],"date-time":"2020-11-29T01:35:05Z","timestamp":1606613705000},"page":"1-15","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Genetic-Shuffled Frog-Leaping Algorithm for Permutation Flowshop Scheduling"],"prefix":"10.1155","volume":"2020","author":[{"given":"Peiliang","family":"Wu","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China"},{"name":"State Key Laboratory of Management and Control for Complex Systems, Institute of Automation, Chinese Academy of Sciences, Beijing 100190, China"},{"name":"The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Qinhuangdao 066004, China"},{"name":"School of Engineering and the Built Environment, Edinburgh Napier University, Edinburgh EH10 5DT, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingyu","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbai","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Automation, Beijing Information Science & Technology University, Beijing 100101, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingyi","family":"Mao","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China"},{"name":"The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Qinhuangdao 066004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0669-4894","authenticated-orcid":true,"given":"Hongnian","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Engineering and the Built Environment, Edinburgh Napier University, Edinburgh EH10 5DT, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-018-1433-8"},{"first-page":"1","article-title":"Robot task sequencing for a flexible assembly system with 3D printers","author":"H. J. Kim","key":"2"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.09.024"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2017.01.011"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.03.020"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-014-0869-8"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9149510"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.09.036"},{"issue":"14","key":"9","doi-asserted-by":"crossref","first-page":"2895","DOI":"10.1080\/0020754050056417","article-title":"Flowshop-scheduling problems with makespan criterion: a review","volume":"43","author":"S. R. Hejazi","year":"2005","journal-title":"International Journal of Production Research"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2018.03.004"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1501166"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.949363"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/62.65"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1403664"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1442948"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9452813"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/7819523"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/4730957"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.02.005"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1973604"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.2507\/ijsimm17(4)co17"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/2726070"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2009.06.002"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2010.06.004"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2015.10.001"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-015-8075-1"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.02.029"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.09.005"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.04.018"},{"first-page":"1","article-title":"An improved algorithm for solving scheduling problems by combining generative adversarial network with evolutionary algorithms","author":"M. H. Chen","key":"30"},{"first-page":"9445","article-title":"Shuffled frog-leaping algorithm for order acceptance and scheduling in flow shop","author":"D. M. Lei","key":"31"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1080\/0305215x.2019.1674295"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.11.003"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1262082"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2016.06.002"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2018.02.004"},{"issue":"3","key":"37","first-page":"281","article-title":"Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems","volume":"38","author":"Y. C. Wang","year":"2017","journal-title":"Revista Investigacion Operacional"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.09"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2016.06.161"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.12.006"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.3390\/app8122621"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106458"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1080\/03052150500384759"},{"article-title":"mining high utility itemsets using shuffled complex evolution of particle swarm optimization (SCE-PSO) optimization algorithm","author":"C. Sivamathi","key":"44","doi-asserted-by":"crossref","DOI":"10.1109\/ICICI.2017.8365213"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1080\/0951192x.2014.961965"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-0992-z"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.03.018"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1142\/s0217984918401127"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2014.10.042"},{"issue":"2","key":"50","first-page":"363","article-title":"Solving the time optimal traveling salesman problem based on hybrid shuffled frog leaping algorithm-genetic algorithm","volume":"40","author":"Y. Zhang","year":"2018","journal-title":"Journal of Electronics and Information Technology"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2019.08355"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/3450180.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/3450180.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/3450180.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,29]],"date-time":"2020-11-29T01:35:15Z","timestamp":1606613715000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/3450180\/"}},"subtitle":[],"editor":[{"given":"Zhile","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,11,28]]},"references-count":51,"alternative-id":["3450180","3450180"],"URL":"https:\/\/doi.org\/10.1155\/2020\/3450180","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"type":"electronic","value":"1099-0526"},{"type":"print","value":"1076-2787"}],"subject":[],"published":{"date-parts":[[2020,11,28]]}}}