{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T21:15:07Z","timestamp":1778793307312,"version":"3.51.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T00:00:00Z","timestamp":1629504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T00:00:00Z","timestamp":1629504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61773192"],"award-info":[{"award-number":["61773192"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61803192"],"award-info":[{"award-number":["61803192"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61773246"],"award-info":[{"award-number":["61773246"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00500-021-06099-0","type":"journal-article","created":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T06:02:40Z","timestamp":1629525760000},"page":"13181-13194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A wale optimization algorithm for distributed flow shop with batch delivery"],"prefix":"10.1007","volume":"25","author":[{"given":"Qinghua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3617-6708","authenticated-orcid":false,"given":"Junqing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Biao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,21]]},"reference":[{"key":"6099_CR1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.future.2018.03.020","volume":"85","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, Manogaran G, El-Shahat D et al (2018) A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Futur Gener Comput Syst 85:129\u2013145","journal-title":"Futur Gener Comput Syst"},{"key":"6099_CR2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.ijpe.2016.08.007","volume":"182","author":"A Agnetis","year":"2016","unstructured":"Agnetis A, Aloulou MA, Fu LL (2016) Production and interplant batch delivery scheduling: dominance and cooperation. Int J Prod Econ 182:38\u201349","journal-title":"Int J Prod Econ"},{"key":"6099_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.omega.2017.10.005","volume":"81","author":"A Akbalik","year":"2018","unstructured":"Akbalik A, Rapine C (2018) Lot sizing problem with multi-mode replenishment and batch delivery. Omega 81:123\u2013133","journal-title":"Omega"},{"key":"6099_CR4","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1007\/s00500-020-05234-7","volume":"25","author":"OA Ark","year":"2020","unstructured":"Ark OA (2020) Population-based Tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration. Soft Comput 25:1501\u20131518","journal-title":"Soft Comput"},{"key":"6099_CR5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.cie.2017.07.020","volume":"111","author":"H Bargaoui","year":"2017","unstructured":"Bargaoui H, Driss OB, Ghdira K (2017) A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion. Comput Ind Eng 111:239\u2013250","journal-title":"Comput Ind Eng"},{"key":"6099_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.cie.2018.09.035","volume":"126","author":"SA Basir","year":"2018","unstructured":"Basir SA, Mazdeh MM, Namakshenas M (2018a) Bi-level genetic algorithms for a two-stage assembly flow-shop scheduling problem with batch delivery system. Comput Ind Eng 126:217\u2013231","journal-title":"Comput Ind Eng"},{"key":"6099_CR7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.cie.2018.09.035","volume":"126","author":"SA Basir","year":"2018","unstructured":"Basir SA, Mazdeh MM, Namakshenas M (2018b) Bi-level genetic algorithms for a two-stage assembly flow-shop scheduling problem with batch delivery system. Comput Ind Eng 126:217\u2013231","journal-title":"Comput Ind Eng"},{"key":"6099_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-018-2787-1","volume":"290","author":"TL Chen","year":"2018","unstructured":"Chen TL, Cheng CY, Chou YH (2018) Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming. Ann Oper Res 290:1\u201324","journal-title":"Ann Oper Res"},{"key":"6099_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.swevo.2016.06.002","volume":"32","author":"J Deng","year":"2017","unstructured":"Deng J, Wang L (2017) A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm Evol Comput 32:121\u2013131","journal-title":"Swarm Evol Comput"},{"key":"6099_CR10","doi-asserted-by":"crossref","unstructured":"Fu M, Zhonghua H, Zhijun G et al (2017) Whale optimization algorithm for flexible flow shop scheduling with setup times. In: 2017 9th international conference on modelling, identification and control (ICMIC). IEEE, pp 157\u2013162","DOI":"10.1109\/ICMIC.2017.8321630"},{"issue":"3","key":"6099_CR11","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1080\/00207543.2011.644819","volume":"51","author":"J Gao","year":"2013","unstructured":"Gao J, Chen R, Deng W (2013) An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 51(3):641\u2013651","journal-title":"Int J Prod Res"},{"key":"6099_CR12","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 et al (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"},{"key":"6099_CR13","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.epsr.2017.12.019","volume":"157","author":"HM Hasanien","year":"2018","unstructured":"Hasanien HM (2018) Performance improvement of photovoltaic power systems using an optimal control strategy based on whale optimization algorithm. Electric Power Syst Res 157:168\u2013176","journal-title":"Electric Power Syst Res"},{"key":"6099_CR14","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, Andrs-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"},{"issue":"11","key":"6099_CR15","doi-asserted-by":"crossref","first-page":"220","DOI":"10.3390\/math6110220","volume":"6","author":"T Jiang","year":"2018","unstructured":"Jiang T, Zhang C, Zhu H et al (2018) Energy-efficient scheduling for a job shop using an improved whale optimization algorithm. Mathematics 6(11):220","journal-title":"Mathematics"},{"key":"6099_CR16","doi-asserted-by":"crossref","first-page":"43153","DOI":"10.1109\/ACCESS.2019.2908200","volume":"7","author":"T Jiang","year":"2019","unstructured":"Jiang T, Zhang C, Sun QM (2019) Green job shop scheduling problem with discrete whale optimization algorithm. IEEE Access 7:43153\u201343166","journal-title":"IEEE Access"},{"key":"6099_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42:21\u201357","journal-title":"Artif Intell Rev"},{"key":"6099_CR18","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.engappai.2017.05.004","volume":"63","author":"H Kazemi","year":"2017","unstructured":"Kazemi H, Mazdeh MM, Rostami M (2017) The two stage assembly flow-shop scheduling problem with batching and delivery. Eng Appl Artif Intell 63:98\u2013107","journal-title":"Eng Appl Artif Intell"},{"key":"6099_CR20","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1016\/j.jclepro.2018.05.037","volume":"193","author":"L Kong","year":"2018","unstructured":"Kong L, Li H, Luo H et al (2018) Sustainable performance of just-in-time (JIT) management in time-dependent batch delivery scheduling of precast construction. J Clean Prod 193:684\u2013701","journal-title":"J Clean Prod"},{"key":"6099_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2020.3016225","author":"J Li","year":"2020","unstructured":"Li J, Liu Z, Li C, Zheng Z (2020) Improved artificial immune system algorithm for type-2 fuzzy flexible job shop scheduling problem. IEEE Trans Fuzzy Syst. https:\/\/doi.org\/10.1109\/TFUZZ.2020.3016225","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"6099_CR22","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3062979","author":"J Li","year":"2021","unstructured":"Li J, Du Y, Gao K, Duan P, Gong D, Pan Q, Suganthan P (2021) A hybrid iterated greedy algorithm for a crane transportation flexible job shop problem. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/TASE.2021.3062979","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"6","key":"6099_CR23","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1016\/j.asoc.2012.01.011","volume":"12","author":"CJ Liao","year":"2012","unstructured":"Liao CJ, Tjandradjaja E, Chung TP (2012) An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Appl Soft Comput 12(6):1755\u20131764","journal-title":"Appl Soft Comput"},{"issue":"5","key":"6099_CR24","doi-asserted-by":"crossref","first-page":"384","DOI":"10.3390\/math7050384","volume":"7","author":"F Luan","year":"2019","unstructured":"Luan F, Cai Z, Wu S et al (2019) Improved whale algorithm for solving the flexible job shop scheduling problem. Mathematics 7(5):384","journal-title":"Mathematics"},{"key":"6099_CR25","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.neucom.2017.04.053","volume":"260","author":"MM Mafarja","year":"2017","unstructured":"Mafarja MM, Mirjalili S (2017) Hybrid whale optimization algorithm with simulated annealing for feature selection. Neurocomputing 260:302\u2013312","journal-title":"Neurocomputing"},{"key":"6099_CR26","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.cie.2019.04.032","volume":"132","author":"F Marandi","year":"2019","unstructured":"Marandi F, Ghomi SMTF (2019) Network configuration multi-factory scheduling with batch delivery: a learning-oriented simulated annealing approach. Comput Ind Eng 132:293\u2013310","journal-title":"Comput Ind Eng"},{"key":"6099_CR27","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367","journal-title":"Adv Eng Softw"},{"issue":"1","key":"6099_CR28","doi-asserted-by":"crossref","first-page":"1483565","DOI":"10.1080\/25742558.2018.1483565","volume":"5","author":"J Nasiri","year":"2018","unstructured":"Nasiri J, Khiyabani FM (2018) A whale optimization algorithm (WOA) approach for clustering. Cogent Math Stat 5(1):1483565","journal-title":"Cogent Math Stat"},{"key":"6099_CR29","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jmsy.2017.11.001","volume":"46","author":"A Noroozi","year":"2018","unstructured":"Noroozi A, Mazdeh MM, Heydari M et al (2018) Coordinating order acceptance and integrated production-distribution scheduling with batch delivery considering third party logistics distribution. J Manuf Syst 46:29\u201345","journal-title":"J Manuf Syst"},{"key":"6099_CR30","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.cie.2018.05.056","volume":"122","author":"K Peng","year":"2018","unstructured":"Peng K, Pan QK, Gao L et al (2018) An improved artificial bee colony algorithm for realworld hybrid flowshop rescheduling in steelmaking-refining-continuous casting process. Comput Ind Eng 122:235\u2013250","journal-title":"Comput Ind Eng"},{"issue":"4","key":"6099_CR31","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.aej.2016.10.002","volume":"56","author":"DB Prakash","year":"2017","unstructured":"Prakash DB, Lakshminarayana C (2017) Optimal siting of capacitors in radial distribution network using whale optimization algorithm. Alex Eng J 56(4):499\u2013509","journal-title":"Alex Eng J"},{"issue":"4","key":"6099_CR32","doi-asserted-by":"crossref","first-page":"2797","DOI":"10.1016\/j.aej.2017.11.003","volume":"57","author":"DB Prakash","year":"2018","unstructured":"Prakash DB, Lakshminarayana C (2018) Multiple DG placements in radial distributionsystem for multi objectives using whale optimization algorithm. Alex Eng J 57(4):2797\u20132806","journal-title":"Alex Eng J"},{"key":"6099_CR33","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.cie.2017.07.029","volume":"111","author":"X Qi","year":"2017","unstructured":"Qi X, Yuan J (2017) A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost. Comput Ind Eng 111:458\u2013462","journal-title":"Comput Ind Eng"},{"key":"6099_CR34","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":"6099_CR36","first-page":"1","volume":"24","author":"H Seidgar","year":"2019","unstructured":"Seidgar H, Fazlollahtabar H, Zandieh M et al (2019) Scheduling two-stage assembly flow shop with random machines breakdowns: integrated new self-adapted differential evolutionary and simulation approach. Soft Comput 24:1\u201325","journal-title":"Soft Comput"},{"key":"6099_CR37","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/TASE.2018.2886303","volume":"16","author":"W Shao","year":"2019","unstructured":"Shao W, Pi D, Shao Z (2019) A pareto-based estimation of distribution algorithm for solving multiobjective 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":"6099_CR38","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.cie.2018.07.023","volume":"124","author":"S Shaya","year":"2018","unstructured":"Shaya S, Komakib GM, Vahid K (2018) Multi objective two-stage assembly flow shop with release time. Comput Ind Eng 124:276\u2013292","journal-title":"Comput Ind Eng"},{"issue":"4","key":"6099_CR39","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10951-014-0369-x","volume":"17","author":"L Shen","year":"2014","unstructured":"Shen L, Gupta JND, Buscher U (2014) Flow shop batching and scheduling with s uencedependent setup times. J Sched 17(4):353\u2013370","journal-title":"J Sched"},{"key":"6099_CR40","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/j.eswa.2018.08.027","volume":"114","author":"Y Sun","year":"2018","unstructured":"Sun Y, Wang X, Chen Y et al (2018) A modified whale optimization algorithm for large-scale global optimization problems. Expert Syst Appl 114:563\u2013577","journal-title":"Expert Syst Appl"},{"issue":"10","key":"6099_CR41","doi-asserted-by":"crossref","first-page":"1826","DOI":"10.1109\/TSMC.2017.2720178","volume":"48","author":"K Wang","year":"2017","unstructured":"Wang K, Luo H, Liu F et al (2017) Permutation flow shop scheduling with batch delivery to multiple customers in supply chains. IEEE Trans Syst Man Cybern Syst 48(10):1826\u20131837","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"6099_CR42","first-page":"1","volume":"24","author":"S Wang","year":"2019","unstructured":"Wang S, Wu R, Chu F et al (2019) Variable neighborhood search-based methods for integrated hybrid flow shop scheduling with distribution. Soft Comput 24:1\u201320","journal-title":"Soft Comput"},{"key":"6099_CR43","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cie.2015.12.003","volume":"92","author":"Y Yin","year":"2016","unstructured":"Yin Y, Wang Y, Cheng TCE et al (2016) Two-agent single-machine scheduling to minimize the batch delivery cost. Comput Ind Eng 92:16\u201330","journal-title":"Comput Ind Eng"},{"key":"6099_CR44","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 et al (2017) Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems. Comput Ind Eng 110:413\u2013423","journal-title":"Comput Ind Eng"},{"key":"6099_CR45","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.asoc.2018.09.016","volume":"73","author":"A Yurtkuran","year":"2018","unstructured":"Yurtkuran A, Yagmahan B, Emel E (2018) A novel artificial bee colony algorithm for the workforce scheduling and balancing problem in sub-assembly lines with limited buffers. Appl Soft Comput 73:767\u2013782","journal-title":"Appl Soft Comput"},{"key":"6099_CR46","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.cie.2018.09.007","volume":"125","author":"G Zhang","year":"2018","unstructured":"Zhang G, Xing K (2018) Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in a distributed environment. Comput Ind Eng 125:423\u2013433","journal-title":"Comput Ind Eng"},{"key":"6099_CR47","doi-asserted-by":"crossref","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 flowshop scheduling with makespan criterion. Eng Appl Artif Intell 76:96\u2013107","journal-title":"Eng Appl Artif Intell"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06099-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-06099-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-06099-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T00:02:25Z","timestamp":1634083345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-06099-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,21]]},"references-count":45,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["6099"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-06099-0","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-741608\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,21]]},"assertion":[{"value":"30 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2021","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}