{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T19:09:30Z","timestamp":1780945770648,"version":"3.54.1"},"reference-count":116,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 109-2221-E-027-073\/Most-109-2410-H-182-009-MY3"],"award-info":[{"award-number":["MOST 109-2221-E-027-073\/Most-109-2410-H-182-009-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005795","name":"Linkou Chang Gung Memorial Hospital","doi-asserted-by":"publisher","award":["BMRPA19"],"award-info":[{"award-number":["BMRPA19"]}],"id":[{"id":"10.13039\/501100005795","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3015737","type":"journal-article","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T21:48:59Z","timestamp":1597182539000},"page":"148100-148124","source":"Crossref","is-referenced-by-count":12,"title":["Improved Beam Search for Optimizing No-Wait Flowshops With Release Times"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1207-3587","authenticated-orcid":false,"given":"Pourya","family":"Pourhejazy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1343-0838","authenticated-orcid":false,"given":"Shih-Wei","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen-Yang","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9549-5290","authenticated-orcid":false,"given":"Kuo-Ching","family":"Ying","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pei-Yu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90248-L"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0925-5273(93)90042-J"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.11.001"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.10.045"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1033033"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2009.06.031"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF01963410"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.11.001"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106274"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-017-0308-7"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600481"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-017-0233-y"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2011.03.004"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.12.007"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.05.011"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2013.01.007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.06.015"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2885137"},{"key":"ref26","first-page":"133","article-title":"On two-machine scheduling with release and due dates to minimize maximum lateness","volume":"17","author":"grabowski","year":"1980","journal-title":"Opsearch"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-006-0726-9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.04.009"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1038\/sj\/jors\/0421105"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00230-4"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0227-8"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.05.030"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1510559"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2018.1521397"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.06.017"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2834954"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-018-0694-3"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.08.002"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1994.65"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.029"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.07.005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.02.023"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.09.028"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.05.007"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2004.835600"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.01.084"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.07.054"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.09.018"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00181-8"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00162-X"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/0098-1354(91)85019-Q"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1080\/07408179908969869"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00002-1"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00136-7"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601110"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.06.024"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-013-4836-x"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.04.031"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2707067"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.07.027"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.871389"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1140920"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(00)00035-8"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-013-5376-0"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2003.08.003"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1080\/00207540500282914"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.02.041"},{"key":"ref61","first-page":"113","article-title":"Three-machine no-wait flowshop with separate setup and removal times to minimize total completion time","volume":"11","author":"aldowaisan","year":"2004","journal-title":"Int J Ind Eng Appl Practice"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.3233\/ICA-150500"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2014.06.007"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s40430-013-0064-4"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1504\/EJIE.2017.081418"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2012.06.017"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-011-3419-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.01.004"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1063\/1.2149757"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-011-0241-1"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.015"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-3009-4"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601389"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-014-0312-7"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1080\/00207548808947840"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.08.014"},{"key":"ref106","article-title":"The HAPPY speech recognition system","author":"lowerre","year":"1976"},{"key":"ref92","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.cie.2004.06.006","article-title":"Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time","volume":"47","author":"shyu","year":"2004","journal-title":"Comput Ind Eng"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"ref91","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1007\/s00170-009-2154-0","article-title":"An efficient heuristic for total flowtime minimisation in no-wait flowshops","volume":"46","author":"framinan","year":"2010","journal-title":"Int J Adv Manuf Technol"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00646-X"},{"key":"ref90","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/moor.2015.0725","article-title":"No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem","volume":"41","author":"mucha","year":"2016","journal-title":"Math Oper Res"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2010.543937"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.11.070"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.11.018"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.12.020"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2005.01.020"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-011-3659-x"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.02.014"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.932935"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.124688"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.05.034"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-018-0562-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2018.2886303"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.05.036"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(95)00071-2"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.02.006"},{"key":"ref17","author":"sevaux","year":"2003","journal-title":"A genetic algorithm for robust schedules in a just-in-time environment"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2015.12.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.07.114"},{"key":"ref84","first-page":"521","article-title":"An adaptive learning approach for no-wait flowshop scheduling problems to minimize makespan","volume":"4","author":"engin","year":"2011","journal-title":"Int J Comput Intell Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.12.010"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-012-0105-1"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.07.033"},{"key":"ref113","first-page":"1070","article-title":"An estimation of distribution algorithm for minimizing makespan on a no-wait flow-shop","author":"zhou","year":"2015","journal-title":"Proc IIE Annu Conf"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-016-0253-x"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58483-8_10"},{"key":"ref89","doi-asserted-by":"crossref","first-page":"2171","DOI":"10.1080\/00207549308956851","article-title":"Precedence constrained TSP applied to circuit board assembly and no wait flowshop","volume":"31","author":"chan","year":"1993","journal-title":"Int J Prod Res"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2010.06.006"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.030"},{"key":"ref87","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmatprotec.2007.07.039","article-title":"Evaluating the performance for makespan minimisation in no-wait flowshop sequencing","volume":"197","author":"framinan","year":"2008","journal-title":"J Mater Process Technol"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00068-0"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09165071.pdf?arnumber=9165071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:06Z","timestamp":1639770906000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9165071\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":116,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3015737","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}