{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T22:42:13Z","timestamp":1777588933699,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T00:00:00Z","timestamp":1668729600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T00:00:00Z","timestamp":1668729600000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00521-022-08044-0","type":"journal-article","created":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T19:04:10Z","timestamp":1668798250000},"page":"579-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Chaotic Flower Pollination Algorithm for scheduling tardiness-constrained flow shop with simultaneously loaded stations"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7507-140X","authenticated-orcid":false,"given":"Donald","family":"Davendra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Herrmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magdalena","family":"Bialic-Davendra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,18]]},"reference":[{"issue":"2","key":"8044_CR1","doi-asserted-by":"crossref","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(2):278\u2013285","journal-title":"Eur J Oper Res"},{"key":"8044_CR2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.jocs.2017.06.004","volume":"25","author":"HY Fuchigami","year":"2018","unstructured":"Fuchigami HY, Rangel S (2018) A survey of case studies in production scheduling: analysis and perspectives. J Comput Sci 25:425\u2013436","journal-title":"J Comput Sci"},{"key":"8044_CR3","volume-title":"Manufacturing planning and control for supply chain management","author":"T Vollmann","year":"2011","unstructured":"Vollmann T, Whybark DC, Jacobs FR, Berry W (2011) Manufacturing planning and control for supply chain management. McGraw-Hill Professional, New York"},{"issue":"20","key":"8044_CR4","doi-asserted-by":"crossref","first-page":"6192","DOI":"10.1080\/00207543.2016.1162917","volume":"54","author":"J Englberger","year":"2016","unstructured":"Englberger J, Herrmann F, Manitz M (2016) Two-stage stochastic master production scheduling under demand uncertainty in a rolling planning environment. Int J Prod Res 54(20):6192\u20136215","journal-title":"Int J Prod Res"},{"issue":"3","key":"8044_CR5","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44(3):510\u2013525","journal-title":"Oper Res"},{"issue":"6","key":"8044_CR6","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1287\/opre.37.6.925","volume":"37","author":"ST McCormick","year":"1989","unstructured":"McCormick ST, Pinedo M, Shenker S, Wolf B (1989) Sequencing in an assembly line with blocking to minimize cycle time. Oper Res 37(6):925\u2013935","journal-title":"Oper Res"},{"issue":"1","key":"8044_CR7","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 E, 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":"1","key":"8044_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/00207540210161650","volume":"41","author":"JM Framinan","year":"2003","unstructured":"Framinan JM, Leisten R, Rajendran C (2003) Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int J Prod Res 41(1):121\u2013148","journal-title":"Int J Prod Res"},{"issue":"1","key":"8044_CR9","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\u201348","journal-title":"Int J Prod Econ"},{"issue":"11","key":"8044_CR10","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1057\/palgrave.jors.2601220","volume":"52","author":"DP Ronconi","year":"2001","unstructured":"Ronconi DP, Armentano VA (2001) Lower bounding schemes for flowshops with blocking in-process. J Oper Res Soc 52(11):1289\u20131297","journal-title":"J Oper Res Soc"},{"key":"8044_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.procs.2015.09.211","volume":"61","author":"M Sadaqa","year":"2015","unstructured":"Sadaqa M, Moraga RJ (2015) Scheduling blocking flow shops using meta-raps. Procedia Comput Sci 61:533\u2013538","journal-title":"Procedia Comput Sci"},{"issue":"3","key":"8044_CR12","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.omega.2005.07.004","volume":"35","author":"J Grabowski","year":"2007","unstructured":"Grabowski J, Pempera J (2007) The permutation flow shop problem with blocking. A tabu search approach. Omega 35(3):302\u2013311","journal-title":"Omega"},{"issue":"1","key":"8044_CR13","doi-asserted-by":"crossref","first-page":"12490","DOI":"10.1016\/j.ifacol.2017.08.2056","volume":"50","author":"A Aschauer","year":"2017","unstructured":"Aschauer A, Roetzer F, Steinboeck A, Kugi A (2017) An efficient algorithm for scheduling a flexible job shop with blocking and no-wait constraints. IFAC-PapersOnLine 50(1):12490\u201312495","journal-title":"IFAC-PapersOnLine"},{"issue":"2","key":"8044_CR14","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.asoc.2011.09.021","volume":"12","author":"X Wang","year":"2012","unstructured":"Wang X, Tang L (2012) A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Appl Soft Comput 12(2):652\u2013662","journal-title":"Appl Soft Comput"},{"issue":"4","key":"8044_CR15","first-page":"295","volume":"3","author":"M Eddaly","year":"2016","unstructured":"Eddaly M, Jarboui B, Siarry P (2016) Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. J Comput Des Eng 3(4):295\u2013311","journal-title":"J Comput Des Eng"},{"issue":"1","key":"8044_CR16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.cie.2011.02.013","volume":"61","author":"L Wang","year":"2011","unstructured":"Wang L, Pan QK, Tasgetiren MF (2011) A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem. Comput Ind Eng 61(1):76\u201383","journal-title":"Comput Ind Eng"},{"issue":"3","key":"8044_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"39","author":"I Ribas","year":"2011","unstructured":"Ribas I, Companys R, Tort-Martorell X (2011) An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega 39(3):293\u2013301","journal-title":"Omega"},{"key":"8044_CR18","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.cie.2015.04.013","volume":"87","author":"I Ribas","year":"2015","unstructured":"Ribas I, Companys R (2015) Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. Comput Ind Eng 87:30\u201339","journal-title":"Comput Ind Eng"},{"key":"8044_CR19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cor.2016.07.002","volume":"77","author":"MF Tasgetiren","year":"2017","unstructured":"Tasgetiren MF, Kizilay D, Pan QK, Suganthan P (2017) Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput Oper Res 77:111\u2013126","journal-title":"Comput Oper Res"},{"issue":"2","key":"8044_CR20","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":"2","key":"8044_CR21","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.omega.2007.01.003","volume":"37","author":"DP Ronconi","year":"2009","unstructured":"Ronconi DP, Henriques LR (2009) Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega 37(2):272\u2013281","journal-title":"Omega"},{"key":"8044_CR22","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.cie.2017.07.037","volume":"111","author":"Z Shao","year":"2017","unstructured":"Shao Z, Pi D, Shao W (2017) Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness. Comput Ind Eng 111:331\u2013351","journal-title":"Comput Ind Eng"},{"key":"8044_CR23","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.eswa.2018.06.020","volume":"113","author":"Z Shao","year":"2018","unstructured":"Shao Z, Pi D, Shao W (2018) A multi-objective discrete invasive weed optimization for multi-objective blocking flow-shop scheduling problem. Expert Syst Appl 113:77\u201399","journal-title":"Expert Syst Appl"},{"issue":"1","key":"8044_CR24","doi-asserted-by":"publisher","first-page":"15","DOI":"10.3390\/systems4010015","volume":"4","author":"F Herrmann","year":"2016","unstructured":"Herrmann F (2016) Using optimization models for scheduling in enterprise resource planning systems. Systems 4(1):15. https:\/\/doi.org\/10.3390\/systems4010015","journal-title":"Systems"},{"issue":"3","key":"8044_CR25","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1108\/HFF-04-2021-0245","volume":"32","author":"WA Khan","year":"2022","unstructured":"Khan WA (2022) Numerical simulation of Chun-Hui He\u2019s iteration method with applications in engineering. Int J Numer Methods Heat Fluid Flow 32(3):944\u2013955","journal-title":"Int J Numer Methods Heat Fluid Flow"},{"key":"8044_CR26","first-page":"1","volume":"2022","author":"A Rasulo","year":"2022","unstructured":"Rasulo A, Khan WA, Arif M, Mohammed M, Farooq U, Farooq FB, Elbashir MK, Rahman JU, AlHussain ZA (2022) Numerical and theoretical investigation to estimate darcy friction factor in water network problem based on modified Chun-Hui He\u2019s algorithm and applications. Math Probl Eng 2022:1\u201311","journal-title":"Math Probl Eng"},{"key":"8044_CR27","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2016.12.013","volume":"81","author":"H Samarghandi","year":"2017","unstructured":"Samarghandi H, Behroozi M (2017) On the exact solution of the no-wait flow shop problem with due date constraints. Comput Oper Res 81:141\u2013159","journal-title":"Comput Oper Res"},{"key":"8044_CR28","unstructured":"Chaudhry IA, Mahmood S (2012) No-wait flowshop scheduling using genetic algorithm. In: Proceedings of the world congress on engineering, vol\u00a03"},{"key":"8044_CR29","first-page":"153","volume-title":"Genetic algorithm for tardiness minimization in flowshop with blocking","author":"TO Januario","year":"2009","unstructured":"Januario TO, Arroyo JEC, Moreira MCO (2009) Genetic algorithm for tardiness minimization in flowshop with blocking. Springer, Berlin, pp 153\u2013164"},{"key":"8044_CR30","doi-asserted-by":"publisher","unstructured":"Davendra D, Hermann F, Bialic-Davendra M (2020) Scheduling tardiness constrained flow shop with simultaneously loaded stations using genetic algorithm. In: Proceedings of the 4th international conference on intelligent systems, metaheuristics and swarm intelligence, ISMSI \u201920. Association for Computing Machinery, New York, pp 93\u201398. https:\/\/doi.org\/10.1145\/3396474.3396475","DOI":"10.1145\/3396474.3396475"},{"issue":"10","key":"8044_CR31","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1080\/00207548708919930","volume":"25","author":"RS Russell","year":"1987","unstructured":"Russell RS, Darwl EM, Taylor BW (1987) A comparative analysis of the covert job sequencing rule using various shop performance measures. Int J Prod Res 25(10):1523\u20131540","journal-title":"Int J Prod Res"},{"key":"8044_CR32","first-page":"75","volume-title":"Priority rules and predictive control algorithms for on-line scheduling of FMS","author":"S Engell","year":"1994","unstructured":"Engell S, Herrmann F, Moser M (1994) Priority rules and predictive control algorithms for on-line scheduling of FMS. Springer, Dordrecht, pp 75\u2013107"},{"key":"8044_CR33","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume-title":"Unconventional computation and natural computation","author":"XS Yang","year":"2012","unstructured":"Yang XS (2012) Flower pollination algorithm for global optimization. In: Durand-Lose J\u00e9r\u00f4me JN (ed) Unconventional computation and natural computation. Springer, Berlin, pp 240\u2013249"},{"issue":"8","key":"8044_CR34","volume":"6","author":"S Nadweh","year":"2020","unstructured":"Nadweh S, Khaddam O, Hayek G, Atieh B, Haes Alhelou H (2020) Optimization of p & pi controller parameters for variable speed drive systems using a flower pollination algorithm. Heliyon 6(8):e04648","journal-title":"Heliyon"},{"key":"8044_CR35","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/B978-0-12-821986-7.00019-6","volume-title":"Nature-inspired optimization algorithms","author":"XS Yang","year":"2021","unstructured":"Yang XS (2021) Chapter 12: Flower pollination algorithms. In: Yang XS (ed) Nature-inspired optimization algorithms, 2nd edn. Academic Press, Cambridge, pp 175\u2013195. https:\/\/doi.org\/10.1016\/B978-0-12-821986-7.00019-6","edition":"2"},{"key":"8044_CR36","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.apm.2020.02.023","volume":"83","author":"Y Chen","year":"2020","unstructured":"Chen Y, Pi D (2020) An innovative flower pollination algorithm for continuous optimization problem. Appl Math Model 83:237\u2013265. https:\/\/doi.org\/10.1016\/j.apm.2020.02.023","journal-title":"Appl Math Model"},{"key":"8044_CR37","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jmsy.2020.08.006","volume":"57","author":"J Shi","year":"2020","unstructured":"Shi J, Zhang W, Zhang S, Wang W, Lin J, Feng R (2020) A new environment-aware scheduling method for remanufacturing system with non-dedicated reprocessing lines using improved flower pollination algorithm. J Manuf Syst 57:94\u2013108. https:\/\/doi.org\/10.1016\/j.jmsy.2020.08.006","journal-title":"J Manuf Syst"},{"key":"8044_CR38","volume-title":"The art of computer programming: sorting and searching","author":"DE Knuth","year":"1998","unstructured":"Knuth DE (1998) The art of computer programming: sorting and searching, vol 3, 2nd edn. Addison Wesley Longman Publishing Co., Inc, Redwood City","edition":"2"},{"issue":"1","key":"8044_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto M, Nishimura T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans Model Comput Simul (TOMACS) 8(1):3\u201330. https:\/\/doi.org\/10.1145\/272991.272995","journal-title":"ACM Trans Model Comput Simul (TOMACS)"},{"key":"8044_CR40","volume-title":"Chaos and time-series analysis","author":"J Sprott","year":"2001","unstructured":"Sprott J (2001) Chaos and time-series analysis. Oxford University Press, Oxford"},{"key":"8044_CR41","first-page":"339","volume-title":"New approaches to nonlinear problems in dynamics","author":"D Aronson","year":"1980","unstructured":"Aronson D, Chory M, Hall G, McGehee R (1980) A discrete dynamical system with subtly wild behavior. In: Davendra D (ed) New approaches to nonlinear problems in dynamics. SIAM Publications, Philadelphia, pp 339\u2013359"},{"key":"8044_CR42","doi-asserted-by":"crossref","unstructured":"Burgers J (1995) Mathematical examples illustrating relations occurring in the theory of turbulent fluid motion. In: Nieuwstadt F, Steketee J (eds) Selected papers of J. M. Burgers. Springer, Dordrecht, pp 281\u2013334","DOI":"10.1007\/978-94-011-0195-0_10"},{"issue":"3","key":"8044_CR43","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0167-2789(84)90141-6","volume":"13","author":"R Whitehead","year":"1984","unstructured":"Whitehead R, MacDonald N (1984) A chaotic mapping that displays its own homoclinic structure. Phys D Nonlinear Phenomena 13(3):401\u2013407","journal-title":"Phys D Nonlinear Phenomena"},{"key":"8044_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59281-2","volume-title":"Chaos","author":"K Alligood","year":"1997","unstructured":"Alligood K, Sauer T, Yorke J (1997) Chaos. Springer, Germany"},{"key":"8044_CR45","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1038\/381413a0","volume":"381","author":"GM Viswanathan","year":"1996","unstructured":"Viswanathan GM, Afanasyev V, Buldyrev SV, Murphy EJ, Prince PA, Stanley HE (1996) L\u00e9vy flight search patterns of wandering albatrosses. Nature 381:413\u2013415","journal-title":"Nature"},{"key":"8044_CR46","volume-title":"Nature-inspired optimization algorithms","author":"XS Yang","year":"2014","unstructured":"Yang XS (2014) Nature-inspired optimization algorithms, 1st edn. Elsevier Science Publishers, Amsterdam","edition":"1"},{"issue":"6","key":"8044_CR47","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0020-0190(86)90073-6","volume":"22","author":"S Sattolo","year":"1986","unstructured":"Sattolo S (1986) An algorithm to generate a random cyclic permutation. Inf Process Lett 22(6):315\u2013317. https:\/\/doi.org\/10.1016\/0020-0190(86)90073-6","journal-title":"Inf Process Lett"},{"key":"8044_CR48","volume-title":"Adaptation in natural and artificial systems","author":"J Holland","year":"1975","unstructured":"Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor"},{"issue":"2","key":"8044_CR49","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0377-2217(93)90175-M","volume":"64","author":"SR Lawrence","year":"1993","unstructured":"Lawrence SR, Morton TE (1993) Resource-constrained multi-project scheduling with tardy costs: comparing myopic, bottleneck, and resource pricing heuristics. Eur J Oper Res 64(2):168\u2013187","journal-title":"Eur J Oper Res"},{"key":"8044_CR50","first-page":"228","volume":"16","author":"RW Conway","year":"1965","unstructured":"Conway RW (1965) Priority dispatching and job lateness in a job shop. J Ind Eng 16:228\u2013237","journal-title":"J Ind Eng"},{"key":"8044_CR51","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0925-5273(93)90044-L","volume":"32","author":"TS Raghu","year":"1993","unstructured":"Raghu TS, Rajendran C (1993) An efficient dynamic dispatching rule for scheduling in a job shop. Int J Prod Econ 32:301\u2013313","journal-title":"Int J Prod Econ"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-08044-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-08044-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-08044-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T18:27:05Z","timestamp":1737656825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-08044-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,18]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["8044"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-08044-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,18]]},"assertion":[{"value":"1 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2022","order":3,"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"}}]}}