{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T20:59:37Z","timestamp":1779310777678,"version":"3.51.4"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572127"],"award-info":[{"award-number":["61572127"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272377"],"award-info":[{"award-number":["61272377"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research and Development Program in Jiangsu Province","award":["BE2015728"],"award-info":[{"award-number":["BE2015728"]}]},{"name":"Collaborative Innovation Center of Wireless Communications Technology"},{"DOI":"10.13039\/501100003329","name":"Spanish Ministry of Economy and Competitiveness through the project \u201cSCHEYARD-Optimization of Scheduling Problems in Container Yards\u201d","doi-asserted-by":"publisher","award":["DPI2015-65895-R"],"award-info":[{"award-number":["DPI2015-65895-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FEDER Funds"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/tcyb.2017.2707067","type":"journal-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T18:09:29Z","timestamp":1496686169000},"page":"1553-1566","source":"Crossref","is-referenced-by-count":44,"title":["An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems"],"prefix":"10.1109","volume":"48","author":[{"given":"Yamin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3201-0038","authenticated-orcid":false,"given":"Xiaoping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3295-3888","authenticated-orcid":false,"given":"Ruben","family":"Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaochun","family":"Sui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.932935"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.05.018"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.omega.2013.10.002","article-title":"An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem","volume":"44","author":"pan","year":"2014","journal-title":"Omega"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.12.009"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.02.009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-014-0906-7"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.017"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.910627"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2013.790571"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1047981"},{"key":"ref10","article-title":"Machine scheduling problem: Classification","author":"rinnooykan","year":"1976","journal-title":"Comput Compl"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2008.05.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/322203.322213"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.01.036"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.omega.2006.11.003","article-title":"Efficient composite heuristics for total flowtime minimization in permutation flow shops","volume":"37","author":"li","year":"2009","journal-title":"Omega"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.02.014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/00207540701737997"},{"key":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800290311"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800010110"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2010.06.006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2444383"},{"key":"ref27","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":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.030"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2425404"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-3009-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2317488"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.01.003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2574766"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"2161","DOI":"10.1007\/s00170-015-8209-5","article-title":"Review and classification of constructive heuristics mechanisms for no-wait flow shop problem","volume":"86","author":"nagano","year":"2016","journal-title":"Int J Adv Manuf Technol"},{"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 Discr Math"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.05.036"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2015.07.027"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01721162"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.10.007"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02538-9"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0305-0483(90)90017-4","article-title":"Dynamic job shop scheduling: A survey of simulation research","volume":"18","author":"ramasesh","year":"1990","journal-title":"Omega"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2011.05.002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-013-4924-y"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2007.02.002"},{"key":"ref23","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":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.07.019"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.11.049"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0924-0136(00)00720-2"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8330726\/07938718.pdf?arnumber=7938718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T05:54:22Z","timestamp":1643176462000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7938718\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":48,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2017.2707067","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5]]}}}