{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T18:28:32Z","timestamp":1723400912873},"reference-count":51,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1016\/j.eswa.2022.118068","type":"journal-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T06:21:18Z","timestamp":1657174878000},"page":"118068","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"special_numbering":"C","title":["Adaptive genetic algorithm for two-stage hybrid flow-shop scheduling with sequence-independent setup time and no-interruption requirement"],"prefix":"10.1016","volume":"208","author":[{"given":"Yan","family":"Qiao","sequence":"first","affiliation":[]},{"given":"NaiQi","family":"Wu","sequence":"additional","affiliation":[]},{"given":"YunFang","family":"He","sequence":"additional","affiliation":[]},{"given":"ZhiWu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.eswa.2022.118068_b0005","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10845-013-0775-5","article-title":"The two stage assembly flowshop scheduling problem to minimize total tardiness","volume":"26","author":"Allahverdi","year":"2015","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/j.eswa.2022.118068_b0010","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1016\/j.ejor.2006.09.010","article-title":"The significance of reducing setup times\/setup costs","volume":"187","author":"Allahverdi","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2022.118068_b0015","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/S0377-2217(03)00415-6","article-title":"The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm","volume":"159","author":"Akkan","year":"2004","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2022.118068_b0020","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0305-0548(99)00010-6","article-title":"Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times","volume":"27","author":"Allahverdi","year":"2000","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2022.118068_b0025","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.cor.2016.01.017","article-title":"Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times","volume":"71","author":"An","year":"2016","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2022.118068_b0030","doi-asserted-by":"crossref","first-page":"5418","DOI":"10.1016\/j.apm.2011.12.010","article-title":"Two-machine flow shop total tardiness scheduling problem with deteriorating jobs","volume":"36","author":"Bank","year":"2012","journal-title":"Applied Mathematical Modelling"},{"issue":"6973","key":"10.1016\/j.eswa.2022.118068_b0035","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1136\/bmj.310.6973.170","article-title":"Multiple significance tests: The Bonferroni method","volume":"310","author":"Bland","year":"1995","journal-title":"BMJ"},{"key":"10.1016\/j.eswa.2022.118068_b0040","doi-asserted-by":"crossref","first-page":"5945","DOI":"10.1080\/00207543.2019.1661535","article-title":"Quantum-inspired ant colony optimization algorithm for a two-stage permutation flow shop with batch processing machines","volume":"58","author":"Chen","year":"2019","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.eswa.2022.118068_b0045","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.ejor.2013.09.033","article-title":"Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs","volume":"234","author":"Cheng","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2022.118068_b0050","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ijpe.2012.03.027","article-title":"Two-machine flowshop scheduling with a truncated learning function to minimize the makespan","volume":"141","author":"Cheng","year":"2013","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.eswa.2022.118068_b0055","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","article-title":"An improved branch-and-bound algorithm for the two machine total completion time flow shop problem","volume":"139","author":"Della Croce","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2022.118068_b0060","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","article-title":"The two-machine total completion time flow shop problem","volume":"90","author":"Della Croce","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2022.118068_b0065","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ins.2020.06.052","article-title":"No-wait two-stage flowhop problem with multi-task flexibility of the first machine","volume":"544","author":"Dong","year":"2021","journal-title":"Information Sciences"},{"key":"10.1016\/j.eswa.2022.118068_b0070","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","article-title":"A comparison of alternative tests of significance for the problem of m rankings","volume":"11","author":"Friedman","year":"1940","journal-title":"The Annals of Mathematical Statistics"},{"key":"10.1016\/j.eswa.2022.118068_b0075","doi-asserted-by":"crossref","first-page":"2361","DOI":"10.1080\/00207543.2017.1371353","article-title":"No-wait two-machine permutation flow shop scheduling problem with leaning effect, common due date and controllable job processing times","volume":"56","author":"Gao","year":"2018","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.eswa.2022.118068_b0080","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ejor.2013.05.031","article-title":"The two-machine flow-shop scheduling problem with sequence-independent setup times: New lower bounding strategies","volume":"231","author":"Gharbi","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2022.118068_b0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.114947","article-title":"Experimental analysis of tardiness in preemptive single machine scheduling","volume":"186","author":"Goldengorin","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2022.118068_b0090","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10951-006-8789-x","article-title":"Lower bounds for minimizing total completion time in a two-machine flow shop","volume":"9","author":"Hoogeveen","year":"2006","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.eswa.2022.118068_b0095","doi-asserted-by":"crossref","first-page":"3036","DOI":"10.1016\/j.eswa.2012.12.019","article-title":"Genetic algorithms for single machine scheduling with time-dependent deterioration and rate-modifying activities","volume":"40","author":"Joo","year":"2013","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2022.118068_b0100","doi-asserted-by":"crossref","first-page":"2659","DOI":"10.1016\/j.cor.2012.01.011","article-title":"An empirical analysis of heuristics for sovling the two-machine flow shop problem with release times","volume":"39","author":"Kalczynski","year":"2012","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2022.118068_b0105","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(00)00374-7","article-title":"A 3\/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates","volume":"114","author":"Kashyrskikh","year":"2001","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.eswa.2022.118068_b0110","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. InProceedings of ICNN'95-international conference on neural networks, 4, 1942-1948.","DOI":"10.1109\/ICNN.1995.488968"},{"key":"10.1016\/j.eswa.2022.118068_b0115","doi-asserted-by":"crossref","first-page":"7911","DOI":"10.1016\/j.eswa.2010.10.066","article-title":"A genetic algorithm for JIT single machine scheduling with preemption and machine idle time","volume":"38","author":"Khorshidian","year":"2011","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2022.118068_b0120","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/j.eswa.2022.118068_b0125","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.jocs.2015.03.011","article-title":"Grey Wolf Optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time","volume":"8","author":"Komaki","year":"2015","journal-title":"Journal of Computational Science"},{"key":"10.1016\/j.eswa.2022.118068_b0130","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1057\/jors.2011.37","article-title":"Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times","volume":"63","author":"Ladhari","year":"2012","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.eswa.2022.118068_b0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.114666","article-title":"NeuroEvolution of augmenting topologies for solving a two-stage hybrid flow shop scheduling problem: A comparison of different solution strategies","volume":"172","author":"Lang","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2022.118068_b0140","article-title":"Coordinated charging scheduling of electric vehicles: A mixed-variable differential evolution approach","author":"Liu","year":"2019","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"10.1016\/j.eswa.2022.118068_b0145","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.cor.2014.06.014","article-title":"A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan","volume":"51","author":"Liu","year":"2014","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2022.118068_b0150","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TSMCB.2006.883272","article-title":"An effective PSO-based Memetic algorithm for flow shop scheduling","volume":"37","author":"Liu","year":"2007","journal-title":"IEEE Transactions on Systems, Man and Cybernetics-Part B: Cybernetics"},{"key":"10.1016\/j.eswa.2022.118068_b0155","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10845-011-0553-1","article-title":"A two-stage hybrid flowshop scheduling problem in machine breakdown condition","volume":"24","author":"Mirabi","year":"2013","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/j.eswa.2022.118068_b0160","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","article-title":"Grey wolf optimizer","volume":"69","author":"Mirjalili","year":"2014","journal-title":"Advances in engineering software"},{"key":"10.1016\/j.eswa.2022.118068_b0165","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/S0305-0548(00)00090-3","article-title":"Minimizing tardiness in a two-machine flow-shop","volume":"29","author":"Pan","year":"2002","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2022.118068_b0170","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1007\/s10845-015-1141-6","article-title":"Single machine interfering jobs problem with flowtime objective","volume":"29","author":"Perez-Gonzalez","year":"2018","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/j.eswa.2022.118068_b0175","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.omega.2017.05.010","article-title":"The non-permutation flow-shop scheduling problem: A literature review","volume":"77","author":"Rossit","year":"2018","journal-title":"Omega"},{"key":"10.1016\/j.eswa.2022.118068_b0180","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","article-title":"The hybrid flow shop scheduling problem","volume":"205","author":"Ruiz","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2022.118068_b0185","doi-asserted-by":"crossref","first-page":"3273","DOI":"10.1016\/j.cor.2004.05.012","article-title":"Note on minimizing total tardiness in a two-machine flowshop","volume":"32","author":"Schaller","year":"2005","journal-title":"Computers and Operations Research"},{"key":"10.1016\/j.eswa.2022.118068_b0190","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2019.04.017","article-title":"Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed","volume":"109","author":"Schaller","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.eswa.2022.118068_b0195","doi-asserted-by":"crossref","first-page":"5951","DOI":"10.1016\/j.eswa.2010.02.009","article-title":"Two robust meta-heuristics for scheduling multiple job classes on a single machine with multiple criteria","volume":"37","author":"Soltani","year":"2010","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2022.118068_b0200","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1057\/palgrave.jors.2600481","article-title":"Minimising makespan in the two-machine flow-shop with release times","volume":"49","author":"Tadei","year":"1998","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.eswa.2022.118068_b0205","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","article-title":"New hard benchmark for flowshop scheduling problems minimising makespan","volume":"240","author":"Vallada","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2022.118068_b0210","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2018.03.005","article-title":"Single-machine scheduling with operator non-availability to minimize total weighted completion time","volume":"445\u2013446","author":"Wan","year":"2018","journal-title":"Information Sciences"},{"key":"10.1016\/j.eswa.2022.118068_b0215","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.amc.2005.11.162","article-title":"Minimizing total completion time in a two-machine flow shop with deteriorating jobs","volume":"180","author":"Wang","year":"2006","journal-title":"Applied Mathematics and Computation"},{"key":"10.1016\/j.eswa.2022.118068_b0220","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ins.2013.07.026","article-title":"A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects","volume":"256","author":"Yin","year":"2014","journal-title":"Information Sciences"},{"key":"10.1016\/j.eswa.2022.118068_b0225","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113360","article-title":"A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times\u201d","volume":"152","author":"Yuan","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2022.118068_b0230","doi-asserted-by":"crossref","first-page":"5291","DOI":"10.1109\/TCYB.2020.3025662","article-title":"A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem","volume":"51","author":"Zhao","year":"2021","journal-title":"IEEE Transactions on Cybernetics"},{"key":"10.1016\/j.eswa.2022.118068_b0235","article-title":"A self-learning discrete Jaya algorithm for multi-objective energy-efficient distributed no-idle flow-shop scheduling problem in heterogeneous factory system","author":"Zhao","year":"2021","journal-title":"IEEE Transactions on Cybernetics"},{"key":"10.1016\/j.eswa.2022.118068_b0240","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.eswa.2020.113678","article-title":"An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion","volume":"160","author":"Zhao","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2022.118068_b0245","doi-asserted-by":"crossref","first-page":"4103","DOI":"10.1080\/00207543.2019.1642529","article-title":"Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimization algorithm","volume":"58","author":"Zheng","year":"2019","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.eswa.2022.118068_b0250","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/s10878-017-0155-8","article-title":"Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility","volume":"35","author":"Zhong","year":"2018","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.eswa.2022.118068_b0255","doi-asserted-by":"crossref","first-page":"1430","DOI":"10.1109\/TCYB.2019.2939219","article-title":"A self-adaptive differential evolution algorithm for scheduling a single batch-processing machine with arbitrary job sizes and release times","volume":"51","author":"Zhou","year":"2021","journal-title":"IEEE Transactions on Cybernetics"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417422012738?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417422012738?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T05:17:13Z","timestamp":1714540633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417422012738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":51,"alternative-id":["S0957417422012738"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2022.118068","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2022,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Adaptive genetic algorithm for two-stage hybrid flow-shop scheduling with sequence-independent setup time and no-interruption requirement","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2022.118068","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"118068"}}