{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T12:16:22Z","timestamp":1762604182864,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61663023"],"award-info":[{"award-number":["61663023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10489-019-01497-2","type":"journal-article","created":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T11:04:31Z","timestamp":1562065471000},"page":"87-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7336-9699","authenticated-orcid":false,"given":"Fuqing","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Xuan","family":"He","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenchang","family":"Lei","sequence":"additional","affiliation":[]},{"given":"Weimin","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Chuck","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Houbin","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"issue":"3","key":"1497_CR1","doi-asserted-by":"publisher","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"},{"key":"1497_CR2","volume-title":"A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) A Guide to the Theory of NP-Completeness. WH Freemann, New York"},{"issue":"2","key":"1497_CR3","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.ejor.2017.11.070","volume":"269","author":"A Allahverdi","year":"2018","unstructured":"Allahverdi A, Aydilek H, Aydilek A (2018) No-wait flowshop scheduling problem with two criteria; total tardiness and makespan. Eur J Oper Res 269(2):590\u2013601. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2017.11.070","journal-title":"Eur J Oper Res"},{"key":"1497_CR4","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.ins.2018.04.038","volume":"453","author":"X Li","year":"2018","unstructured":"Li X, Yang Z, Ruiz R, Chen T, Sui S (2018) An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Inf Sci 453:408\u2013425. \nhttps:\/\/doi.org\/10.1016\/j.ins.2018.04.038","journal-title":"Inf Sci"},{"issue":"10","key":"1497_CR5","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1080\/0305215X.2018.1542693","volume":"51","author":"Fuqing Zhao","year":"2018","unstructured":"Zhao F, Zhang L, Liu H, Zhang Y, Ma W, Zhang C, Song H (2018) An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem. Eng Optim. \nhttps:\/\/doi.org\/10.1080\/0305215X.2018.1542693","journal-title":"Engineering Optimization"},{"issue":"5","key":"1497_CR6","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1109\/TCYB.2017.2707067","volume":"48","author":"Y Wang","year":"2018","unstructured":"Wang Y, Li X, Ruiz R, Sui S (2018) An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems. IEEE T Cybern 48(5):1553\u20131566. \nhttps:\/\/doi.org\/10.1109\/TCYB.2017.2707067","journal-title":"IEEE T Cybern"},{"key":"1497_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.cie.2017.04.002","volume":"108","author":"H Ye","year":"2017","unstructured":"Ye H, Li W, Abedini A, Nault B (2017) An effective and efficient heuristic for no-wait flow shop production to minimize total completion time. Comput Ind Eng 108:57\u201369. \nhttps:\/\/doi.org\/10.1016\/j.cie.2017.04.002","journal-title":"Comput Ind Eng"},{"issue":"9\u201312","key":"1497_CR8","first-page":"1563","volume":"66","author":"K Gao","year":"2012","unstructured":"Gao K, Pan Q, Suganthan PN, Li J (2012) Effective heuristics for the no-wait flow shop scheduling problem with total flow time minimization. Int J Adv Manuf Technol 66(9\u201312):1563\u20131572","journal-title":"Int J Adv Manuf Technol"},{"issue":"5\u20138","key":"1497_CR9","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1007\/s00170-013-4924-y","volume":"68","author":"SU Sapkal","year":"2013","unstructured":"Sapkal SU, Laha D (2013) A heuristic for no-wait flow shop scheduling. Int J Adv Manuf Technol 68(5\u20138):1327\u20131338","journal-title":"Int J Adv Manuf Technol"},{"key":"1497_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.cor.2016.12.013","volume":"81","author":"Samarghandi","year":"2017","unstructured":"Samarghandi (2017) On the exact solution of the no-wait flow shop problem with due date constraints. Comput Oper Res 81:141\u2013159. \nhttps:\/\/doi.org\/10.1016\/j.cor.2016.12.013","journal-title":"Comput Oper Res"},{"key":"1497_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.cie.2016.06.003","volume":"98","author":"D Laha","year":"2016","unstructured":"Laha D, Gupta JND (2016) A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops. Comput Ind Eng 98:373\u2013383. \nhttps:\/\/doi.org\/10.1016\/j.cie.2016.06.003","journal-title":"Comput Ind Eng"},{"key":"1497_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.jmsy.2017.04.007","volume":"44","author":"Honghan Ye","year":"2017","unstructured":"Ye H, Li W, Abedini A (2017) An improved heuristic for no-wait flow shop to minimize makespan. J Manuf Syst. \nhttps:\/\/doi.org\/10.1016\/j.jmsy.2017.04.007","journal-title":"Journal of Manufacturing Systems"},{"issue":"12","key":"1497_CR13","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1016\/j.ifacol.2016.07.844","volume":"49","author":"H Samarghandi","year":"2016","unstructured":"Samarghandi H, Behroozi M (2016) An Enumeration Algorithm for the No-Wait Flow Shop Problem with Due Date Constraints. IFAC-PapersOnLine 49(12):1803\u20131808. \nhttps:\/\/doi.org\/10.1016\/j.ifacol.2016.07.844","journal-title":"IFAC-PapersOnLine"},{"key":"1497_CR14","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 teaching\u2013probabilistic learning mechanism for no-wait flow shop scheduling. Knowl-Based Syst 107:219\u2013234. \nhttps:\/\/doi.org\/10.1016\/j.knosys.2016.06.011","journal-title":"Knowl-Based Syst"},{"key":"1497_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jmsy.2016.05.001","volume":"40","author":"H Ye","year":"2016","unstructured":"Ye H, Li W, Miao E (2016) An effective heuristic for no-wait flow shop production to minimize makespan. J Manuf Syst 40:2\u20137. \nhttps:\/\/doi.org\/10.1016\/j.jmsy.2016.05.001","journal-title":"J Manuf Syst"},{"key":"1497_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.asoc.2018.08.002","volume":"72","author":"O Engin","year":"2018","unstructured":"Engin O, Guclu A (2018) A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Applied Soft Computing Journal 72:166\u2013176. \nhttps:\/\/doi.org\/10.1016\/j.asoc.2018.08.002","journal-title":"Applied Soft Computing Journal"},{"issue":"2","key":"1497_CR17","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10489-018-1285-0","volume":"49","author":"Haihong Zhu","year":"2018","unstructured":"Zhu H, Qi X, Chen F, He X, Chen L, Zhang Z (2018) Quantum-inspired cuckoo co-search algorithm for no-wait flow shop scheduling. Appl Intell. \nhttps:\/\/doi.org\/10.1007\/s10489-018-1285-0","journal-title":"Applied Intelligence"},{"key":"1497_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/SCIS.2013.6613246","volume-title":"Computational Intelligence in Scheduling (SCIS), 2013 IEEE Symposium on, 16\u201319 April 2013","author":"KZ Gao","year":"2013","unstructured":"Gao KZ, Suganthan PN, Chua TJ (2013) An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem. In: Computational Intelligence in Scheduling (SCIS), 2013 IEEE Symposium on, 16\u201319 April 2013, pp 9\u201313. \nhttps:\/\/doi.org\/10.1109\/SCIS.2013.6613246"},{"issue":"5\u20138","key":"1497_CR19","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s00170-014-6177-9","volume":"75","author":"H Asefi","year":"2014","unstructured":"Asefi H, Jolai F, Rabiee M, Araghi MET (2014) A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem. Int J Adv Manuf Technol 75(5\u20138):1017\u20131033. \nhttps:\/\/doi.org\/10.1007\/s00170-014-6177-9","journal-title":"Int J Adv Manuf Technol"},{"key":"1497_CR20","doi-asserted-by":"crossref","unstructured":"Ding J, Song S, Zhang R, Wu C, IEEE (2014) Minimizing makespan for a no-wait flowshop using Tabu Mechanism Improved Iterated Greedy Algorithm. 2014 IEEE Congress on Evolutionary Computation (Cec):1906\u20131911","DOI":"10.1109\/CEC.2014.6900460"},{"issue":"8","key":"1497_CR21","doi-asserted-by":"publisher","first-page":"3628","DOI":"10.1016\/j.eswa.2013.12.013","volume":"41","author":"MS Nagano","year":"2014","unstructured":"Nagano MS, Silva AAD, Lorena LAN (2014) An evolutionary clustering search for the no-wait flow shop problem with sequence dependent setup times. Expert Syst Appl 41(8):3628\u20133633","journal-title":"Expert Syst Appl"},{"key":"1497_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/CSICSSE.2015.7369247","volume-title":"Computer Science and Software Engineering (CSSE), 2015 International Symposium on, 18\u201319 Aug. 2015","author":"V Riahi","year":"2015","unstructured":"Riahi V, Kazemi M (2015) A hybrid heuristic algorithm for the no-wait flowshop scheduling problem. In: Computer Science and Software Engineering (CSSE), 2015 International Symposium on, 18\u201319 Aug. 2015, pp 1\u20136. \nhttps:\/\/doi.org\/10.1109\/CSICSSE.2015.7369247"},{"issue":"9","key":"1497_CR23","first-page":"1","volume":"53","author":"H Samarghandi","year":"2015","unstructured":"Samarghandi H (2015) A particle swarm optimisation for the no-wait flow shop problem with due date constraints. Int J Prod Res 53(9):1\u201318","journal-title":"Int J Prod Res"},{"key":"1497_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.omega.2015.12.002","volume":"64","author":"SW Lin","year":"2015","unstructured":"Lin SW, Ying KC (2015) Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics. Omega 64:115\u2013125","journal-title":"Omega"},{"issue":"5","key":"1497_CR25","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s13042-014-0312-7","volume":"6","author":"X Zhu","year":"2015","unstructured":"Zhu X, Li X (2015) Iterative search method for total flowtime minimization no-wait flowshop problem. Int J Mach Learn Cybern 6(5):747\u2013761. \nhttps:\/\/doi.org\/10.1007\/s13042-014-0312-7","journal-title":"Int J Mach Learn Cybern"},{"issue":"4","key":"1497_CR26","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1080\/00207543.2014.949363","volume":"53","author":"S Wang","year":"2015","unstructured":"Wang S, Liu M, Chu C (2015) A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int J Prod Res 53(4):1143\u20131167","journal-title":"Int J Prod Res"},{"issue":"4","key":"1497_CR27","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10845-013-0830-2","volume":"26","author":"P Ramezani","year":"2015","unstructured":"Ramezani P, Rabiee M, Jolai F (2015) No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach. J Intell Manuf 26(4):731\u2013744","journal-title":"J Intell Manuf"},{"key":"1497_CR28","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/ICECTECH.2011.5941822","volume-title":"Electronics Computer Technology (ICECT), 2011 3rd International Conference on","author":"SU Sapkal","year":"2011","unstructured":"Sapkal SU, Laha D (2011) An improved scheduling heuristic algorithm for no-wait flow shops on total flow time criterion. In: Electronics Computer Technology (ICECT), 2011 3rd International Conference on, pp 159\u2013163"},{"key":"1497_CR29","first-page":"1184","volume-title":"Chinese Control and Decision Conference","author":"KZ Gao","year":"2010","unstructured":"Gao KZ, Li JQ, Liang JJ, Li H, Pan QK (2010) Hybrid heuristics based on harmony search to minimize total flow time in no-wait flow shop. In: Chinese Control and Decision Conference, pp 1184\u20131188"},{"key":"1497_CR30","first-page":"77","volume-title":"2010 International Symposium on Computer,Communication, Control and Automation Proceedings","author":"K Gao","year":"2010","unstructured":"Gao K, Pan Q, Li J, He Y (2010) A novel grouping harmony search algorithm for the no-wait flow shop scheduling problems with total flow time criteria. In: 2010 International Symposium on Computer,Communication, Control and Automation Proceedings, vol 1, pp 77\u201380"},{"key":"1497_CR31","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.asoc.2015.02.006","volume":"30","author":"JY Ding","year":"2015","unstructured":"Ding JY, Song S, Gupta JND, Zhang R, Chiong R, Wu C (2015) An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Appl Soft Comput 30:604\u2013613","journal-title":"Appl Soft Comput"},{"key":"1497_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo ML (2016) Scheduling: theory, algorithms, and systems. Springer, Berlin"},{"key":"1497_CR33","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jmsy.2016.05.001","volume":"40","author":"HH Ye","year":"2016","unstructured":"Ye HH, Li W, Miao EM (2016) An effective heuristic for no-wait flow shop production to minimize makespan. J Manuf Syst 40:2\u20137. \nhttps:\/\/doi.org\/10.1016\/j.jmsy.2016.05.001","journal-title":"J Manuf Syst"},{"issue":"2","key":"1497_CR34","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. \nhttps:\/\/doi.org\/10.1016\/0377-2217(93)90182-M","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1497_CR35","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","journal-title":"Eur J Oper Res"},{"key":"1497_CR36","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.jmsy.2017.04.007","volume":"44","author":"H Ye","year":"2017","unstructured":"Ye H, Li W, Abedini A (2017) An improved heuristic for no-wait flow shop to minimize makespan. J Manuf Syst 44:273\u2013279. \nhttps:\/\/doi.org\/10.1016\/j.jmsy.2017.04.007","journal-title":"J Manuf Syst"},{"key":"1497_CR37","unstructured":"Jana ND, Sil J (2014) Das S Particle Swarm Optimization with population adaptation. Evol Comput:1727\u20131732"},{"key":"1497_CR38","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.eswa.2017.09.028","volume":"91","author":"FQ Zhao","year":"2018","unstructured":"Zhao FQ, Liu H, Zhang Y, Ma WM, Zhang C (2018) A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem. Expert Syst Appl 91:347\u2013363. \nhttps:\/\/doi.org\/10.1016\/j.eswa.2017.09.028","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1497_CR39","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10732-008-9080-4","volume":"15","author":"S Garc\u00eda","year":"2009","unstructured":"Garc\u00eda S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms\u2019 behaviour: a case study on the CEC\u20192005 Special Session on Real Parameter Optimization. J Heuristics 15(6):617\u2013644","journal-title":"J Heuristics"},{"key":"1497_CR40","unstructured":"Zar JH (1999) Biostatistical Analysis. 4th ed. NewDelhi: Pearson Education India"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01497-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-019-01497-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-019-01497-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T23:59:36Z","timestamp":1593561576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-019-01497-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,2]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["1497"],"URL":"https:\/\/doi.org\/10.1007\/s10489-019-01497-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2019,7,2]]},"assertion":[{"value":"2 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}