{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:20:03Z","timestamp":1773415203765,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Natural Science Foundation of the Jiangsu Higher Education Institutions of China","award":["19KJB520042"],"award-info":[{"award-number":["19KJB520042"]}]},{"name":"Research Startup Fund of Shaanxi Normal University","award":["1110011056"],"award-info":[{"award-number":["1110011056"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["GK202003073"],"award-info":[{"award-number":["GK202003073"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Basic Research Program of Shaanxi","award":["2020JQ-425"],"award-info":[{"award-number":["2020JQ-425"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10489-020-01809-x","type":"journal-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T08:04:38Z","timestamp":1596096278000},"page":"4647-4669","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["Effective Constructive Heuristic and Metaheuristic for the Distributed Assembly Blocking Flow-shop Scheduling Problem"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4990-9464","authenticated-orcid":false,"given":"Zhongshi","family":"Shao","sequence":"first","affiliation":[]},{"given":"Weishi","family":"Shao","sequence":"additional","affiliation":[]},{"given":"Dechang","family":"Pi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"issue":"1","key":"1809_CR1","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1080\/00207543.2018.1457812","volume":"57","author":"CY Cheng","year":"2019","unstructured":"Cheng CY, Ying KC, Chen HH, Lu HS (2019) Minimising makespan in distributed mixed no-idle flowshops. Int J Prod Res 57(1):48\u201360","journal-title":"Int J Prod Res"},{"issue":"4","key":"1809_CR2","doi-asserted-by":"crossref","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 flowshop scheduling problem. Comput Oper Res 37(4):754\u2013768","journal-title":"Comput Oper Res"},{"key":"1809_CR3","doi-asserted-by":"crossref","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 flowshop scheduling problem. Omega 83:213\u2013222","journal-title":"Omega"},{"key":"1809_CR4","doi-asserted-by":"crossref","unstructured":"Shao W, Shao Z, Pi D (2020) Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem. Knowledge-Based Systems, pp 105527","DOI":"10.1016\/j.knosys.2020.105527"},{"key":"1809_CR5","doi-asserted-by":"crossref","unstructured":"Zheng J, Wang L, Wang JJ (2020) A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop. Knowledge-Based Systems, pp 105536","DOI":"10.1016\/j.knosys.2020.105536"},{"issue":"2","key":"1809_CR6","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/00207543.2019.1598596","volume":"58","author":"D Lei","year":"2020","unstructured":"Lei D, Yuan Y, Cai J, Bai D (2020) An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling. Int J Prod Res 58(2):597\u2013614","journal-title":"Int J Prod Res"},{"issue":"8","key":"1809_CR7","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1007\/s10845-015-1084-y","volume":"28","author":"HC Chang","year":"2017","unstructured":"Chang HC, Liu TK (2017) Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. J Intell Manuf 28(8):1973\u20131986","journal-title":"J Intell Manuf"},{"issue":"92","key":"1809_CR8","first-page":"1054","volume":"81","author":"QK Pan","year":"2019","unstructured":"Pan QK, Gao L, Xin-Yu L, Jose FM (2019) Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem. Appl Soft Comput 81(92):1054","journal-title":"Appl Soft Comput"},{"key":"1809_CR9","doi-asserted-by":"crossref","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 X (2019) Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Syst Appl 124:309\u2013324","journal-title":"Expert Syst Appl"},{"key":"1809_CR10","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.asoc.2015.11.034","volume":"40","author":"AP Rifai","year":"2016","unstructured":"Rifai AP, Nguyen HT, Dawal SZM (2016) Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling. Appl Soft Comput 40: 42\u201357","journal-title":"Appl Soft Comput"},{"key":"1809_CR11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.knosys.2017.09.026","volume":"137","author":"W Shao","year":"2017","unstructured":"Shao W, Pi D, Shao Z (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":"1809_CR12","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.cie.2017.06.025","volume":"110","author":"KC Ying","year":"2017","unstructured":"Ying KC, Lin SW, Cheng CY, He CD (2017) Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems. Comput Ind Eng 110:413\u2013 423","journal-title":"Comput Ind Eng"},{"key":"1809_CR13","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.eswa.2017.09.032","volume":"92","author":"KC Ying","year":"2018","unstructured":"Ying KC, Lin SW (2018) Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert Syst Appl 92:132\u2013141","journal-title":"Expert Syst Appl"},{"issue":"147","key":"1809_CR14","first-page":"145","volume":"113","author":"Z Shao","year":"2020","unstructured":"Shao Z, Pi D, Shao W (2020) Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment. Expert Syst Appl 113(147):145","journal-title":"Expert Syst Appl"},{"issue":"17","key":"1809_CR15","doi-asserted-by":"crossref","first-page":"5292","DOI":"10.1080\/00207543.2013.807955","volume":"51","author":"S Hatami","year":"2013","unstructured":"Hatami S, Ruiz R, Andr\u00e9sRomano C (2013) The distributed assembly permutation flowshop scheduling problem. Int J Prod Res 51(17):5292\u20135308","journal-title":"Int J Prod Res"},{"issue":"1","key":"1809_CR16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TSMC.2015.2416127","volume":"46","author":"SY Wang","year":"2016","unstructured":"Wang SY, Wang L (2016) An estimation of distribution algorithm-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem. IEEE Trans Syst Man Cybern Syst 46(1):139\u2013149","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1809_CR17","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.cie.2016.05.005","volume":"97","author":"J Lin","year":"2016","unstructured":"Lin J, Zhang S (2016) An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem. Comput Indu Eng 97:128\u2013 136","journal-title":"Comput Indu Eng"},{"key":"1809_CR18","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.swevo.2017.04.007","volume":"36","author":"J Lin","year":"2017","unstructured":"Lin J, Wang ZJ, Li X (2017) A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem. Swarm Evol Comput 36:124\u2013135","journal-title":"Swarm Evol Comput"},{"key":"1809_CR19","doi-asserted-by":"crossref","unstructured":"Li X, Zhang X, Yin M, Wang J (2015) A genetic algorithm for the distributed assembly permutation flowshop scheduling problem. In: 2015 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 3096\u20133101","DOI":"10.1109\/CEC.2015.7257275"},{"key":"1809_CR20","doi-asserted-by":"crossref","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 flowshop problem with total flowtime criterion. Swarm Evol Comput 44:64\u201373","journal-title":"Swarm Evol Comput"},{"key":"1809_CR21","doi-asserted-by":"crossref","unstructured":"Yang Y, Li P, Wang S, Liu B, Luo Y (2017) Scatter search for distributed assembly flowshop scheduling to minimize total tardiness. In: 2017 IEEE Congress on evolutionary computation (CEC). IEEE. ISBN 1509046011, pp 861\u2013868","DOI":"10.1109\/CEC.2017.7969399"},{"key":"1809_CR22","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.ijpe.2015.07.027","volume":"169","author":"S Hatami","year":"2015","unstructured":"Hatami S, Ruiz R, Andr\u00e9s-Romano C (2015) Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times. Int J Prod Econ 169:76\u201388","journal-title":"Int J Prod Econ"},{"key":"1809_CR23","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.simpat.2017.09.001","volume":"79","author":"EM Gonzalez-Neira","year":"2017","unstructured":"Gonzalez-Neira EM, Ferone D, Hatami S, Juan AA (2017) A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times. Simul Model Pract Theory 79:23\u201336","journal-title":"Simul Model Pract Theory"},{"issue":"13","key":"1809_CR24","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/JSYST.2018.2825337","volume":"2","author":"W Shao","year":"2019","unstructured":"Shao W, Pi D, Shao Z (2019) Local search methods for a distributed assembly no-idle flow shop scheduling problem. IEEE Syst J 2(13):1945\u20131956","journal-title":"IEEE Syst J"},{"key":"1809_CR25","doi-asserted-by":"crossref","unstructured":"Yang Z, Liu C (2018) A hybrid multi-objective gray wolf optimization algorithm for a fuzzy blocking flow shop scheduling problem. Advances in Mechanical Engineering 10(3)","DOI":"10.1177\/1687814018765535"},{"issue":"5","key":"1809_CR26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.eswa.2017.01.006","volume":"74","author":"I Ribas","year":"2017","unstructured":"Ribas I, Companys R, Tort-Martorell X (2017) Efficient heuristics for the parallel blocking flow shop scheduling problem. Expert Syst Appl 74(5):41\u201354","journal-title":"Expert Syst Appl"},{"key":"1809_CR27","first-page":"153","volume-title":"Overview of scheduling methods","author":"JM Framinan","year":"2014","unstructured":"Framinan JM, Leisten R, Ruiz Garc\u00eda R (2014) Overview of scheduling methods. Springer, London, pp 153\u2013190"},{"key":"1809_CR28","unstructured":"Pinedo M (2015) Scheduling Theory Algorithms, and Systems, 4th Edn. Springer, Berlin"},{"issue":"1","key":"1809_CR29","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"issue":"4","key":"1809_CR30","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0305-0483(03)00047-1","volume":"31","author":"JM Framinan","year":"2003","unstructured":"Framinan JM, Leisten R (2003) An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega 31(4):311\u2013317","journal-title":"Omega"},{"issue":"1","key":"1809_CR31","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0925-5273(03)00065-3","volume":"87","author":"DP Ronconi","year":"2004","unstructured":"Ronconi DP (2004) A note on constructive heuristics for the flowshop problem with blocking. Int J Prod Econ 87(1):39\u2013 48","journal-title":"Int J Prod Econ"},{"issue":"2","key":"1809_CR32","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.omega.2011.06.002","volume":"40","author":"QK Pan","year":"2012","unstructured":"Pan QK, Wang L (2012) Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega 40(2):218\u2013229","journal-title":"Omega"},{"issue":"3","key":"1809_CR33","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"37","author":"L Wang","year":"2010","unstructured":"Wang L, Pan QK, Suganthan PN, Wang WH, Wang YM (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37(3):509\u2013520","journal-title":"Comput Oper Res"},{"key":"1809_CR34","first-page":"363","volume-title":"Iterated local search: Framework and applications","author":"HR Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2010) Iterated local search: Framework and applications. Springer, Boston, pp 363\u2013397"},{"key":"1809_CR35","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.asoc.2018.08.035","volume":"73","author":"J Guan","year":"2018","unstructured":"Guan J, Lin G, Feng HB (2018) A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem. Appl Soft Comput 73:230\u2013241","journal-title":"Appl Soft Comput"},{"key":"1809_CR36","first-page":"89","volume":"303","author":"QK Pan","year":"2017","unstructured":"Pan QK, Gao L, Li X, Gao KZ (2017) Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl Math Comput 303:89\u2013112","journal-title":"Appl Math Comput"},{"key":"1809_CR37","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.jclepro.2019.03.155","volume":"224","author":"S Schulz","year":"2019","unstructured":"Schulz S, Neufeld JS, Buscher U (2019) A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling. J Clean Prod 224:421\u2013434","journal-title":"J Clean Prod"},{"key":"1809_CR38","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.cor.2018.12.008","volume":"104","author":"H Zohali","year":"2019","unstructured":"Zohali H, Naderi B, Mohammadi M, Roshanaei V (2019) Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems. Comput Oper Res 104:127\u2013138","journal-title":"Comput Oper Res"},{"key":"1809_CR39","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.omega.2015.03.007","volume":"56","author":"NR Sabar","year":"2015","unstructured":"Sabar NR, Kendall G (2015) An iterated local search with multiple perturbation operators and time varying perturbation strength for the aircraft landing problem. Omega 56:88\u201398","journal-title":"Omega"},{"key":"1809_CR40","doi-asserted-by":"crossref","unstructured":"Ruiz R, St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177(3):2033\u20132049","DOI":"10.1016\/j.ejor.2005.12.009"},{"issue":"2","key":"1809_CR41","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.omega.2013.10.002","volume":"44","author":"QK Pan","year":"2014","unstructured":"Pan QK, Ruiz R (2014) An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem. Omega 44(2):41\u201350","journal-title":"Omega"},{"key":"1809_CR42","unstructured":"Montgomery DC (2008) Design and analysis of experiments. Wiley, New York. ISBN 0470128666"},{"key":"1809_CR43","doi-asserted-by":"crossref","unstructured":"Shao Z, Pi D, Shao W (2019) A novel multi-objective discrete water wave optimization for solving multi-objective blocking flow-shop scheduling problem. Knowl-Based Syst 165:110\u2013131","DOI":"10.1016\/j.knosys.2018.11.021"},{"key":"1809_CR44","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.eswa.2017.09.028","volume":"91","author":"F Zhao","year":"2018","unstructured":"Zhao F, Liu H, Zhang Y, Ma W, Zhang C (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":"1809_CR45","doi-asserted-by":"crossref","first-page":"113166","DOI":"10.1016\/j.eswa.2019.113166","volume":"146","author":"F Zhao","year":"2020","unstructured":"Zhao F, Zhang L, Zhang Y, Ma W, Zhang C, Song H (2020) A hybrid discrete water wave optimization algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. Expert Syst Appl 146:113166","journal-title":"Expert Syst Appl"},{"key":"1809_CR46","doi-asserted-by":"crossref","unstructured":"Naderi B, Ruiz R (2014) A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur J Oper Res 239(2):323\u2013334","DOI":"10.1016\/j.ejor.2014.05.024"},{"key":"1809_CR47","doi-asserted-by":"crossref","first-page":"112959","DOI":"10.1016\/j.eswa.2019.112959","volume":"141","author":"JC Yepes-Borrero","year":"2020","unstructured":"Yepes-Borrero JC, Villa F, Perea F, Caballero-Villalobos JP (2020) Grasp algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources. Expert Syst Appl 141:112959","journal-title":"Expert Syst Appl"},{"key":"1809_CR48","doi-asserted-by":"crossref","first-page":"105585","DOI":"10.1016\/j.asoc.2019.105585","volume":"82","author":"K Li","year":"2019","unstructured":"Li K, Chen J, Fu H, Jia Z, Fu W (2019) Uniform parallel machine scheduling with fuzzy processing times under resource consumption constraint. Appl Soft Comput 82:105585","journal-title":"Appl Soft Comput"},{"key":"1809_CR49","first-page":"124688","volume":"365","author":"A Allahverdi","year":"2020","unstructured":"Allahverdi A, Aydilek H, Aydilek A (2020) No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan. Appl Math Comput 365:124688","journal-title":"Appl Math Comput"},{"issue":"3","key":"1809_CR50","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s40305-017-0165-3","volume":"6","author":"S Cai","year":"2018","unstructured":"Cai S, Yang K, Liu K (2018) Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints. J Oper Res Soc China 6(3):391\u2013416","journal-title":"J Oper Res Soc China"},{"key":"1809_CR51","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.jclepro.2019.04.046","volume":"226","author":"Y Fu","year":"2019","unstructured":"Fu Y, Tian G, Fathollahi-Fard AM, Ahmadi A, Zhang C (2019) Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flow shop scheduling problem with the total tardiness constraint. J Clean Prod 226:515\u2013525","journal-title":"J Clean Prod"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01809-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-020-01809-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01809-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T23:31:42Z","timestamp":1627601502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-020-01809-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,30]]},"references-count":51,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1809"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01809-x","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,30]]},"assertion":[{"value":"30 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}