{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T12:12:51Z","timestamp":1781093571912,"version":"3.54.1"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T00:00:00Z","timestamp":1600214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T00:00:00Z","timestamp":1600214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s12065-020-00487-5","type":"journal-article","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T06:02:36Z","timestamp":1600236156000},"page":"57-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A modified teaching learning metaheuristic algorithm with opposite-based learning for permutation flow-shop scheduling problem"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9919-0761","authenticated-orcid":false,"given":"Umesh","family":"Balande","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deepti","family":"shrimankar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,16]]},"reference":[{"key":"487_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo ML (2016) Scheduling: theory, algorithms, and systems. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-1-4614-2361-4"},{"issue":"3","key":"487_CR2","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0377-2217(99)00224-6","volume":"125","author":"J Grabowski","year":"2000","unstructured":"Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125(3):535\u2013550. https:\/\/doi.org\/10.1016\/S0377-2217(99)00224-6","journal-title":"Eur J Oper Res"},{"issue":"1","key":"487_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1109\/TII.2017.2664080","volume":"14","author":"W Du","year":"2018","unstructured":"Du W, Tang Y, Leung SYS, Tong L, Vasilakos AV, Qian F (2018) Robust order scheduling in the discrete manufacturing industry: a multiobjective optimization approach. IEEE Trans Ind Inf 14(1):253\u2013264. https:\/\/doi.org\/10.1109\/TII.2017.2664080","journal-title":"IEEE Trans Ind Inf"},{"key":"487_CR4","doi-asserted-by":"publisher","first-page":"6121","DOI":"10.1109\/ACCESS.2017.2696118","volume":"5","author":"L Hidri","year":"2017","unstructured":"Hidri L, Gharbi A (2017) New efficient lower bound for the hybrid flow shop scheduling problem with multiprocessor tasks. IEEE Access 5:6121\u20136133. https:\/\/doi.org\/10.1109\/ACCESS.2017.2696118","journal-title":"IEEE Access"},{"key":"487_CR5","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1016\/j.procs.2017.08.057","volume":"112","author":"H Bargaoui","year":"2017","unstructured":"Bargaoui H, Driss OB, Gh\u00e9dira K (2017) Towards a distributed implementation of chemical reaction optimization for the multi-factory permutation flowshop scheduling problem. Procedia Comput Sci 112:1531\u20131541. https:\/\/doi.org\/10.1016\/j.procs.2017.08.057","journal-title":"Procedia Comput Sci"},{"key":"487_CR6","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.conbuildmat.2018.04.169","volume":"175","author":"F Deng","year":"2018","unstructured":"Deng F, He Y, Zhou S, Yu Y, Cheng H, Wu X (2018) Compressive strength prediction of recycled concrete based on deep learning. Constr Build Mater 175:562\u2013569","journal-title":"Constr Build Mater"},{"key":"487_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.cie.2017.02.010","volume":"106","author":"HM Cho","year":"2017","unstructured":"Cho HM, Jeong IJ (2017) A two-level method of production planning and scheduling for bi-objective reentrant hybrid flow shops. Comput Ind Eng 106:174\u2013181. https:\/\/doi.org\/10.1016\/j.cie.2017.02.010","journal-title":"Comput Ind Eng"},{"issue":"3","key":"487_CR8","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.ejor.2015.10.007","volume":"250","author":"QK Pan","year":"2016","unstructured":"Pan QK (2016) An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling. Eur J Oper Res 250(3):702\u2013714. https:\/\/doi.org\/10.1016\/j.ejor.2015.10.007","journal-title":"Eur J Oper Res"},{"key":"487_CR9","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.jclepro.2017.08.068","volume":"167","author":"Y Zhang","year":"2017","unstructured":"Zhang Y, Wang J, Liu Y (2017) Game theory based real-time multi-objective flexible job shop scheduling considering environmental impact. J Clean Prod 167:665\u2013679. https:\/\/doi.org\/10.1016\/j.jclepro.2017.08.068","journal-title":"J Clean Prod"},{"issue":"1","key":"487_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two and three stage production schedules with setup times included. Naval Res Logist Q 1(1):61\u201368. https:\/\/doi.org\/10.1002\/nav.3800010110","journal-title":"Naval Res Logist Q"},{"issue":"3","key":"487_CR11","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.ejor.2006.07.029","volume":"187","author":"R Ruiz","year":"2008","unstructured":"Ruiz R, St\u00fctzle T (2008) An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur J Oper Res 187(3):1143\u20131159. https:\/\/doi.org\/10.1016\/j.ejor.2006.07.029","journal-title":"Eur J Oper Res"},{"key":"487_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-017-0488-5","author":"A Ozolins","year":"2017","unstructured":"Ozolins A (2017) Improved bounded dynamic programming algorithm for solving the blocking flow shop problem. Central Eur J Oper Res. https:\/\/doi.org\/10.1007\/s10100-017-0488-5","journal-title":"Central Eur J Oper Res"},{"issue":"1","key":"487_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1504\/IJMOR.2017.080743","volume":"10","author":"S Toumi","year":"2017","unstructured":"Toumi S, Jarboui B, Eddaly M, Reba\u00ef A (2017) Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion. Int J Math Oper Res 10(1):34\u201348. https:\/\/doi.org\/10.1504\/IJMOR.2017.080743","journal-title":"Int J Math Oper Res"},{"issue":"12","key":"487_CR14","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1057\/jors.1986.197","volume":"37","author":"WJ Selen","year":"1986","unstructured":"Selen WJ, Hott DD (1986) A mixed-integer goal-programming formulation of the standard flow-shop scheduling problem. J Oper Res Soc 37(12):1121\u20131128. https:\/\/doi.org\/10.1057\/jors.1986.197","journal-title":"J Oper Res Soc"},{"issue":"11","key":"487_CR15","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski J, Wodecki M (2004) A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput Oper Res 31(11):1891\u20131909. https:\/\/doi.org\/10.1016\/S0305-0548(03)00145-X","journal-title":"Comput Oper Res"},{"key":"487_CR16","doi-asserted-by":"publisher","unstructured":"Xu J, Zhang J (2014) Exploration-exploitation tradeoffs in metaheuristics: survey and analysis. In: Proceedings of the 33rd Chinese control conference, pp 8633\u20138638. https:\/\/doi.org\/10.1109\/ChiCC.2014.6896450","DOI":"10.1109\/ChiCC.2014.6896450"},{"issue":"2","key":"487_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning. Mach Learn 3(2):95\u201399. https:\/\/doi.org\/10.1023\/A:1022602019183","journal-title":"Mach Learn"},{"issue":"2","key":"487_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theoret Comput Sci 344(2):243\u2013278. https:\/\/doi.org\/10.1016\/j.tcs.2005.05.020","journal-title":"Theoret Comput Sci"},{"issue":"4","key":"487_CR19","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 Global Optim 11(4):341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J Global Optim"},{"issue":"2","key":"487_CR20","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan G (2001) A new heuristic optimization algorithm: Harmony search. SIMULATION 76(2):60\u201368. https:\/\/doi.org\/10.1177\/003754970107600201","journal-title":"SIMULATION"},{"key":"487_CR21","doi-asserted-by":"crossref","unstructured":"Yang XS (2009) Firefly algorithms for multimodal optimization. In: Proceedings of the 5th International Conference on Stochastic Algorithms: Foundations and Applications, Springer-Verlag, Berlin, Heidelberg, SAGA\u201909, pp 169\u2013178","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"487_CR22","first-page":"65","volume-title":"A new metaheuristic bat-inspired algorithm","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) A new metaheuristic bat-inspired algorithm. Springer, Berlin, pp 65\u201374"},{"issue":"1","key":"487_CR23","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00366-011-0241-y","volume":"29","author":"AH Gandomi","year":"2013","unstructured":"Gandomi AH, Yang XS, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29(1):17\u201335. https:\/\/doi.org\/10.1007\/s00366-011-0241-y","journal-title":"Eng Comput"},{"issue":"3","key":"487_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"R Rao","year":"2011","unstructured":"Rao R, Savsani V, Vakharia D (2011) Teaching learning based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303\u2013315. https:\/\/doi.org\/10.1016\/j.cad.2010.12.015","journal-title":"Comput Aided Des"},{"key":"487_CR25","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Adv Eng Softw"},{"key":"487_CR26","first-page":"1","volume":"12","author":"GG Wang","year":"2015","unstructured":"Wang GG, Deb S, Coelho L (2015a) Earthworm optimization algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Int J Bioinspir Comput 12:1\u201322","journal-title":"Int J Bioinspir Comput"},{"key":"487_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1923-y","author":"GG Wang","year":"2015","unstructured":"Wang GG, Deb S, Cui Z (2015b) Monarch butterfly optimization. Neural Comput Appl. https:\/\/doi.org\/10.1007\/s00521-015-1923-y","journal-title":"Neural Comput Appl"},{"key":"487_CR28","doi-asserted-by":"crossref","unstructured":"Karaboga D, Basturk B (2007) Artificial bee colony (abc) optimization algorithm for solving constrained optimization problems. In: Foundations of fuzzy logic and soft computing. Springer, Berlin, pp 789\u2013798","DOI":"10.1007\/978-3-540-72950-1_77"},{"issue":"1","key":"487_CR29","first-page":"19","volume":"7","author":"R Rao","year":"2016","unstructured":"Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19\u201334","journal-title":"Int J Ind Eng Comput"},{"key":"487_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-016-0212-3","author":"GG Wang","year":"2016","unstructured":"Wang GG (2016) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput. https:\/\/doi.org\/10.1007\/s12293-016-0212-3","journal-title":"Memet Comput"},{"key":"487_CR31","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.ins.2017.08.047","volume":"418\u2013419","author":"Y Zhang","year":"2017","unstructured":"Zhang Y, fang Song X, wei Gong D, (2017) A return-cost-based binary firefly algorithm for feature selection. Inf Sci 418\u2013419:561\u2013574. https:\/\/doi.org\/10.1016\/j.ins.2017.08.047","journal-title":"Inf Sci"},{"issue":"1","key":"487_CR32","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5\u201313. https:\/\/doi.org\/10.1016\/0305-0548(93)E0014-K","journal-title":"Comput Oper Res"},{"issue":"2","key":"487_CR33","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s40092-014-0057-7","volume":"10","author":"M Mirabi","year":"2014","unstructured":"Mirabi M, Fatemi Ghomi SMT, Jolai F (2014) A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem. J Ind Eng Int 10(2):57. https:\/\/doi.org\/10.1007\/s40092-014-0057-7","journal-title":"J Ind Eng Int"},{"issue":"3","key":"487_CR34","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3):1930\u20131947. https:\/\/doi.org\/10.1016\/j.ejor.2005.12.024","journal-title":"Eur J Oper Res"},{"issue":"1","key":"487_CR35","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/TSMCB.2006.883270","volume":"37","author":"D Liu","year":"2007","unstructured":"Liu D, Tan KC, Goh CK, Ho WK (2007) A multiobjective memetic algorithm based on particle swarm optimization. IEEE Trans Syst Man Cybern Part B (Cybern) 37(1):42\u201350. https:\/\/doi.org\/10.1109\/TSMCB.2006.883270","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"issue":"3","key":"487_CR36","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1080\/00207543.2011.644819","journal-title":"Int J Prod Res"},{"key":"487_CR37","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.amc.2014.09.010","volume":"248","author":"Y Liu","year":"2014","unstructured":"Liu Y, Yin M, Gu W (2014) An effective differential evolution algorithm for permutation flow shop scheduling problem. Appl Math Comput 248:143\u2013159. https:\/\/doi.org\/10.1016\/j.amc.2014.09.010","journal-title":"Appl Math Comput"},{"issue":"16","key":"487_CR38","doi-asserted-by":"publisher","first-page":"4732","DOI":"10.1080\/00207543.2013.767988","volume":"51","author":"X Li","year":"2013","unstructured":"Li X, Yin M (2013) A hybrid cuckoo search via l\u00e9vy flights for the permutation flow shop scheduling problem. Int J Prod Res 51(16):4732\u20134754. https:\/\/doi.org\/10.1080\/00207543.2013.767988","journal-title":"Int J Prod Res"},{"issue":"1","key":"487_CR39","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2017.06.027","volume":"264","author":"A Sioud","year":"2018","unstructured":"Sioud A, Gagn\u00e9 C (2018) Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times. Eur J Oper Res 264(1):66\u201373. https:\/\/doi.org\/10.1016\/j.ejor.2017.06.027","journal-title":"Eur J Oper Res"},{"key":"487_CR40","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. https:\/\/doi.org\/10.1016\/j.cie.2018.03.014","journal-title":"Comput Ind Eng"},{"key":"487_CR41","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.swevo.2017.06.003","volume":"38","author":"T Meng","year":"2018","unstructured":"Meng T, Pan QK, Li JQ, Sang HY (2018) An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm Evol Comput 38:64\u201378. https:\/\/doi.org\/10.1016\/j.swevo.2017.06.003","journal-title":"Swarm Evol Comput"},{"issue":"22","key":"487_CR42","doi-asserted-by":"publisher","first-page":"6782","DOI":"10.1080\/00207543.2016.1177671","volume":"54","author":"Y Han","year":"2016","unstructured":"Han Y, Gong D, Li J, Zhang Y (2016) Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm. Int J Prod Res 54(22):6782\u20136797. https:\/\/doi.org\/10.1080\/00207543.2016.1177671","journal-title":"Int J Prod Res"},{"key":"487_CR43","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ins.2014.02.056","volume":"276","author":"A Baykasolu","year":"2014","unstructured":"Baykasolu A, Hamzadayi A, K\u00f6se SY (2014) Testing the performance of teachinglearning based optimization (tlbo) algorithm on combinatorial problems: flow shop and job shop scheduling cases. Inf Sci 276:204\u2013218. https:\/\/doi.org\/10.1016\/j.ins.2014.02.056","journal-title":"Inf Sci"},{"key":"487_CR44","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.advengsoft.2014.07.006","volume":"77","author":"Z Xie","year":"2014","unstructured":"Xie Z, Zhang C, Shao X, Lin W, Zhu H (2014) An effective hybrid teachinglearning-based optimization algorithm for permutation flow shop scheduling problem. Adv Eng Softw 77:35\u201347. https:\/\/doi.org\/10.1016\/j.advengsoft.2014.07.006","journal-title":"Adv Eng Softw"},{"key":"487_CR45","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.knosys.2016.06.011","volume":"107","author":"W Shao","year":"2016","unstructured":"Shao W, Pi D, Shao Z (2016) A hybrid discrete optimization algorithm based on teachingprobabilistic learning mechanism for no-wait flow shop scheduling. Knowl Based Syst 107:219\u2013234. https:\/\/doi.org\/10.1016\/j.knosys.2016.06.011","journal-title":"Knowl Based Syst"},{"key":"487_CR46","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.engappai.2014.09.015","volume":"37","author":"J Li","year":"2015","unstructured":"qing Li J, ke Pan Q, Mao K, (2015) A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems. Eng Appl Artif Intell 37:279\u2013292. https:\/\/doi.org\/10.1016\/j.engappai.2014.09.015","journal-title":"Eng Appl Artif Intell"},{"key":"487_CR47","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.asoc.2017.08.020","volume":"61","author":"W Shao","year":"2017","unstructured":"Shao W, Pi D, Shao Z (2017) An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem. Appl Soft Comput 61:193\u2013210. https:\/\/doi.org\/10.1016\/j.asoc.2017.08.020","journal-title":"Appl Soft Comput"},{"key":"487_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40092-017-0244-4","volume":"1","author":"R Buddala","year":"2017","unstructured":"Buddala R, Mahapatra SS (2017) Improved teaching-learning-based and jaya optimization algorithms for solving flexible flow shop scheduling problems. J Ind Eng Int 1:1. https:\/\/doi.org\/10.1007\/s40092-017-0244-4","journal-title":"J Ind Eng Int"},{"key":"487_CR49","doi-asserted-by":"publisher","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, Mirjalili S (2018) A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener Comput Syst 85:129\u2013145. https:\/\/doi.org\/10.1016\/j.future.2018.03.020","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"487_CR50","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.engappai.2012.02.016","volume":"26","author":"RV Rao","year":"2013","unstructured":"Rao RV, Patel V (2013) Multi-objective optimization of two stage thermoelectric cooler using a modified teachinglearning-based optimization algorithm. Eng Appl Artif Intell 26(1):430\u2013445. https:\/\/doi.org\/10.1016\/j.engappai.2012.02.016","journal-title":"Eng Appl Artif Intell"},{"key":"487_CR51","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-27242-4_18","volume-title":"Swarm, evolutionary, and memetic computing","author":"SC Satapathy","year":"2011","unstructured":"Satapathy SC, Naik A (2011) Data clustering based on teaching-learning-based optimization. In: Panigrahi BK, Suganthan PN, Das S, Satapathy SC (eds) Swarm, evolutionary, and memetic computing. Springer, Heidelberg, pp 148\u2013156"},{"key":"487_CR52","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.infrared.2014.02.013","volume":"64","author":"H Jin","year":"2014","unstructured":"Jin H, Wang Y (2014) A fusion method for visible and infrared images based on contrast pyramid with teaching learning based optimization. Infrared Phys Technol 64:134\u2013142. https:\/\/doi.org\/10.1016\/j.infrared.2014.02.013","journal-title":"Infrared Phys Technol"},{"issue":"3","key":"487_CR53","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1016\/j.scient.2012.12.005","volume":"20","author":"RV Rao","year":"2013","unstructured":"Rao RV, Patel V (2013) An improved teaching-learning-based optimization algorithm for solving unconstrained optimization problems. Sci Iran 20(3):710\u2013720. https:\/\/doi.org\/10.1016\/j.scient.2012.12.005","journal-title":"Sci Iran"},{"key":"487_CR54","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ins.2012.11.009","volume":"229","author":"G Waghmare","year":"2013","unstructured":"Waghmare G (2013) Comments on a note on teachinglearning-based optimization algorithm. Inf Sci 229:159\u2013169. https:\/\/doi.org\/10.1016\/j.ins.2012.11.009","journal-title":"Inf Sci"},{"key":"487_CR55","doi-asserted-by":"publisher","unstructured":"Das S, Konar A, Chakraborty UK (2005) Two improved differential evolution schemes for faster global search. In: Proceedings of the 7th annual conference on genetic and evolutionary computation. GECCO \u201905. ACM, New York, pp 991\u2013998. https:\/\/doi.org\/10.1145\/1068009.1068177","DOI":"10.1145\/1068009.1068177"},{"issue":"2","key":"487_CR56","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2):154\u2013160. https:\/\/doi.org\/10.1287\/ijoc.6.2.154","journal-title":"ORSA J Comput"},{"key":"487_CR57","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.advengsoft.2012.09.003","volume":"55","author":"X Li","year":"2013","unstructured":"Li X, Yin M (2013) An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure. Adv Eng Softw 55:10\u201331. https:\/\/doi.org\/10.1016\/j.advengsoft.2012.09.003","journal-title":"Adv Eng Softw"},{"issue":"7","key":"487_CR58","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00170-007-1115-8","volume":"38","author":"B Qian","year":"2008","unstructured":"Qian B, Wang L, Hu R, Wang WL, Huang DX, Wang X (2008) A hybrid differential evolution method for permutation flow-shop scheduling. Int J Adv Manuf Technol 38(7):757\u2013777. https:\/\/doi.org\/10.1007\/s00170-007-1115-8","journal-title":"Int J Adv Manuf Technol"},{"key":"487_CR59","doi-asserted-by":"publisher","unstructured":"Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: International conference on computational intelligence for modelling, control and automation and international conference on intelligent agents, web technologies and internet commerce (CIMCA-IAWTIC\u201906), vol\u00a01, pp 695\u2013701. https:\/\/doi.org\/10.1109\/CIMCA.2005.1631345","DOI":"10.1109\/CIMCA.2005.1631345"},{"issue":"1","key":"487_CR60","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TEVC.2007.894200","volume":"12","author":"S Rahnamayan","year":"2008","unstructured":"Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition-based differential evolution. IEEE Trans Evol Comput 12(1):64\u201379. https:\/\/doi.org\/10.1109\/TEVC.2007.894200","journal-title":"IEEE Trans Evol Comput"},{"key":"487_CR61","doi-asserted-by":"publisher","unstructured":"Wang H, Wu Z, Rahnamayan S, Kang L (2009) A scalability test for accelerated de using generalized opposition-based learning. In: 2009 ninth international conference on intelligent systems design and applications, pp 1090\u20131095. https:\/\/doi.org\/10.1109\/ISDA.2009.216","DOI":"10.1109\/ISDA.2009.216"},{"issue":"3","key":"487_CR62","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1080\/15397734.2016.1213639","volume":"45","author":"A Kaveh","year":"2017","unstructured":"Kaveh A, Ghazaan MI (2017) Enhanced whale optimization algorithm for sizing optimization of skeletal structures. Mech Based Des Struct Mach 45(3):345\u2013362. https:\/\/doi.org\/10.1080\/15397734.2016.1213639","journal-title":"Mech Based Des Struct Mach"},{"issue":"3","key":"487_CR63","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449\u2013467. https:\/\/doi.org\/10.1016\/S0377-2217(00)00100-4","journal-title":"Eur J Oper Res"},{"key":"487_CR64","unstructured":"Liang J, Qu B, Suganthan P, G A, (2013) Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Technical report 201212, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Nanyang Technological University, Singapore, pp 3\u201318"},{"issue":"1","key":"487_CR65","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.swevo.2011.02.001","volume":"1","author":"A Eiben","year":"2011","unstructured":"Eiben A, Smit S (2011) Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm Evol Comput 1(1):19\u201331. https:\/\/doi.org\/10.1016\/j.swevo.2011.02.001","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"487_CR66","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J Carlier","year":"1989","unstructured":"Carlier J, Pinson E (1989) An algorithm for solving the job-shop problem. Manage Sci 35(2):164\u2013176. https:\/\/doi.org\/10.1287\/mnsc.35.2.164","journal-title":"Manage Sci"},{"issue":"1","key":"487_CR67","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"CR Reeves","year":"1998","unstructured":"Reeves CR, Yamada T (1998) Genetic algorithms, path relinking, and the flowshop sequencing problem. Evol Comput 6(1):45\u201360. https:\/\/doi.org\/10.1162\/evco.1998.6.1.45","journal-title":"Evol Comput"},{"issue":"2","key":"487_CR68","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/opre.8.2.178","volume":"8","author":"J Heller","year":"1960","unstructured":"Heller J (1960) Some numerical experiments for an m \u0152 j flow shop and its decision-theoretical aspects. Oper Res 8(2):178\u2013184. https:\/\/doi.org\/10.1287\/opre.8.2.178","journal-title":"Oper Res"},{"issue":"2","key":"487_CR69","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(2):278\u2013285. https:\/\/doi.org\/10.1016\/0377-2217(93)90182-M","journal-title":"Eur J Oper Res"},{"issue":"3","key":"487_CR70","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","volume":"240","author":"E Vallada","year":"2015","unstructured":"Vallada E, Ruiz R, Framinan JM (2015) New hard benchmark for flowshop scheduling problems minimising makespan. Eur J Oper Res 240(3):666\u2013677. https:\/\/doi.org\/10.1016\/j.ejor.2014.07.033","journal-title":"Eur J Oper Res"},{"key":"487_CR71","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.engappai.2017.07.023","volume":"65","author":"F Zhao","year":"2017","unstructured":"Zhao F, Liu Y, Zhang Y, Ma W, Zhang C (2017) A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problems. Eng Appl Artif Intell 65:178\u2013199. https:\/\/doi.org\/10.1016\/j.engappai.2017.07.023","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"487_CR72","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garcia S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318. https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evol Comput"},{"key":"487_CR73","doi-asserted-by":"crossref","unstructured":"Luo Q, Zhou Y, Xie J, Ma M, Li L (2014) Discrete bat algorithm for optimal problem of permutation flow shop scheduling. Sci World J","DOI":"10.1155\/2014\/630280"},{"key":"487_CR74","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.cie.2015.04.009","volume":"85","author":"Q Lin","year":"2015","unstructured":"Lin Q, Gao L, Li X, Zhang C (2015) A hybrid backtracking search algorithm for permutation flow-shop scheduling problem. Comput Ind Eng 85:437\u2013446. https:\/\/doi.org\/10.1016\/j.cie.2015.04.009","journal-title":"Comput Ind Eng"},{"issue":"3","key":"487_CR75","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s11590-014-0761-7","volume":"9","author":"Imen Hamdi","year":"2015","unstructured":"Hamdi Imen (2015) Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags. Optim Lett 9(3):465\u2013482. https:\/\/doi.org\/10.1007\/s11590-014-0761-7","journal-title":"Optim Lett"},{"issue":"8","key":"487_CR76","doi-asserted-by":"publisher","first-page":"2200","DOI":"10.1080\/00207543.2012.711968","volume":"51","author":"D Davendra","year":"2013","unstructured":"Davendra D, Bialic-Davendra M (2013) Scheduling flow shops with blocking using a discrete self-organising migrating algorithm. Int J Prod Res 51(8):2200\u20132218. https:\/\/doi.org\/10.1080\/00207543.2012.711968","journal-title":"Int J Prod Res"},{"issue":"3","key":"487_CR77","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.omega.2010.07.007","journal-title":"Omega"},{"issue":"1","key":"487_CR78","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.cie.2011.02.013","journal-title":"Comput Ind Eng"},{"issue":"3","key":"487_CR79","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.engappai.2004.02.008","volume":"17","author":"AC Nearchou","year":"2004","unstructured":"Nearchou AC (2004) A novel metaheuristic approach for the flow shop scheduling problem. Eng Appl Artif Intell 17(3):289\u2013300. https:\/\/doi.org\/10.1016\/j.engappai.2004.02.008","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"487_CR80","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2009.01.016","volume":"58","author":"C Zhang","year":"2010","unstructured":"Zhang C, Ning J, Ouyang D (2010) A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem. Comput Ind Eng 58(1):1\u201311. https:\/\/doi.org\/10.1016\/j.cie.2009.01.016","journal-title":"Comput Ind Eng"},{"issue":"15","key":"487_CR81","doi-asserted-by":"publisher","first-page":"4297","DOI":"10.1007\/s00500-016-2062-9","volume":"21","author":"H Wang","year":"2017","unstructured":"Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297\u20134307. https:\/\/doi.org\/10.1007\/s00500-016-2062-9","journal-title":"Soft Comput"},{"issue":"18","key":"487_CR82","doi-asserted-by":"publisher","first-page":"6025","DOI":"10.1007\/s00500-018-3075-3","volume":"22","author":"S Deb","year":"2018","unstructured":"Deb S, Tian Z, Fong S, Tang R, Wong R, Dey N (2018) Solving permutation flow-shop scheduling problem by rhinoceros search algorithm. Soft Comput 22(18):6025\u20136034. https:\/\/doi.org\/10.1007\/s00500-018-3075-3","journal-title":"Soft Comput"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00487-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-020-00487-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-020-00487-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T03:23:26Z","timestamp":1646364206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-020-00487-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,16]]},"references-count":82,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["487"],"URL":"https:\/\/doi.org\/10.1007\/s12065-020-00487-5","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,16]]},"assertion":[{"value":"2 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}