{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T22:42:31Z","timestamp":1777588951523,"version":"3.51.4"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST105-2410-H-182-009-MY2\/MOST107-2410-H-182-005-MY2"],"award-info":[{"award-number":["MOST105-2410-H-182-009-MY2\/MOST107-2410-H-182-005-MY2"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005795","name":"Chang Gung Memorial Hospital, Linkou","doi-asserted-by":"publisher","award":["CARPD3B0012"],"award-info":[{"award-number":["CARPD3B0012"]}],"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":[[2018]]},"DOI":"10.1109\/access.2018.2885137","type":"journal-article","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T20:03:13Z","timestamp":1544040193000},"page":"78666-78677","source":"Crossref","is-referenced-by-count":12,"title":["Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1343-0838","authenticated-orcid":false,"given":"Shih-Wei","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Cheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9549-5290","authenticated-orcid":false,"given":"Kuo-Ching","family":"Ying","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1080\/00207729708929360"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1504\/IJAOM.2010.038335"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1007245"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.11591\/ijece.v7i1.pp417-423"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.asoc.2015.02.006","article-title":"An improved iterated greedy algorithm with a tabu-based reconstruction strategy for the no-wait flowshop scheduling problem","volume":"30","author":"ding","year":"2015","journal-title":"Appl Soft Comput"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1992.162"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.2.219"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.12.013"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMR.189-193.2746"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2011.648277"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-3009-4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICAdLT.2013.6568480"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.01.004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2010.543937"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.04.038"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00005-1"},{"key":"ref21","first-page":"59","article-title":"a hybrid genetic algorithm approach for the \"no-wait\" flowshop scheduling problem","author":"gonazelez","year":"1995","journal-title":"Proceedings of 1st International Conference on Genetic Algorithms in Engineering Systems Innovations and Applications"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00170-007-1099-4","article-title":"A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion","volume":"38","author":"pan","year":"2008","journal-title":"Int J Adv Manuf Technol"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-005-0277-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2010.06.006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2009.02.006"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2732738"},{"key":"ref51","first-page":"16","article-title":"Membership clouds and membership cloud generators","volume":"32","author":"li","year":"1995","journal-title":"J Comput Res Develop"},{"key":"ref54","author":"montgomery","year":"2005","journal-title":"Design and Analysis of Experiments"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.20.3.689"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01919082"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2010.06.004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00068-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.02.009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.030"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1007\/s00170-007-1120-y","article-title":"An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion","volume":"38","author":"pan","year":"2008","journal-title":"Int J Adv Manuf Technol"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2011.05.029"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.08.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.06.011"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.09.028"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.omega.2015.12.002","article-title":"Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics","volume":"64","author":"lin","year":"2016","journal-title":"Omega"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-013-4924-y"},{"key":"ref6","first-page":"138","article-title":"Ein beitrag zum reihenfolgeproblem [A contribution to the sequencing problem]","volume":"4","author":"piehler","year":"1960","journal-title":"Unternehmensforschung"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2834954"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.05.036"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.3.510"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2017.06.025"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"graham","year":"1979","journal-title":"Ann Discrete Math"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2011.588617"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.09.006"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.790571"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1047981"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.08.033"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-007-1104-y"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.910627"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602625"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08561288.pdf?arnumber=8561288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T02:29:20Z","timestamp":1643250560000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8561288\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2885137","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}