{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:48:49Z","timestamp":1761709729264,"version":"3.37.3"},"reference-count":26,"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":[{"name":"Zhejiang Provincial Philosophy and Social Science Program of China","award":["19NDJC093YB"],"award-info":[{"award-number":["19NDJC093YB"]}]},{"DOI":"10.13039\/501100012325","name":"National Social Science Foundation of China","doi-asserted-by":"publisher","award":["19BGL001"],"award-info":[{"award-number":["19BGL001"]}],"id":[{"id":"10.13039\/501100012325","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Zhejiang Provincial Natural Science Foundation of China","doi-asserted-by":"publisher","award":["LY19A010002"],"award-info":[{"award-number":["LY19A010002"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Ningbo Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2019A610048","2019A610095"],"award-info":[{"award-number":["2019A610048","2019A610095"]}],"id":[{"id":"10.13039\/501100001809","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.2993857","type":"journal-article","created":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T19:35:08Z","timestamp":1589225708000},"page":"89964-89975","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Programming Algorithms for Two-Machine Hybrid Flow-Shop Scheduling With a Given Job Sequence and Deadline"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9852-5902","authenticated-orcid":false,"given":"Qi","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8515-708X","authenticated-orcid":false,"given":"Yong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2826069"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/167073"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2904848"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.11.021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00028-4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2014.51"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0540-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/nav.21846"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.5267\/j.ijiec.2018.4.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-017-0155-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11766-005-0016-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2018.1458018"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1001.2012.00587"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1162341"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0530-4"},{"key":"ref2","first-page":"1381","article-title":"An improved algorithm for a class of flow-shop problems in graphics processing","volume":"37","author":"jiang","year":"2011","journal-title":"J Autom"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-016-9093-3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.10104"},{"key":"ref20","article-title":"Two-stage no-wait hybrid flowshop scheduling with sequence-dependent setup times","author":"wang","year":"0","journal-title":"Int J Syst Sci Oper Logist"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/0020754041233127044"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.06.023"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/COASE.2019.8842885"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105527"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2973575"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.06.009"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09091166.pdf?arnumber=9091166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:52:00Z","timestamp":1639770720000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9091166\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2993857","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}