{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:45:34Z","timestamp":1720201534879},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T00:00:00Z","timestamp":1617321600000},"content-version":"vor","delay-in-days":1493,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["11571060"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"RGC","award":["HKU716412E"]},{"name":"the Fundamental Research Funds for the Central Universities","award":["DUT15LK10"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1016\/j.tcs.2017.01.018","type":"journal-article","created":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T14:16:49Z","timestamp":1485785809000},"page":"79-85","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Flowshop problem F2 \u2192D|v= 1,c\u2265 1|Cmax revisited"],"prefix":"10.1016","volume":"670","author":[{"given":"Yan","family":"Lan","sequence":"first","affiliation":[]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[]},{"given":"Yinling","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Min","family":"Ge","sequence":"additional","affiliation":[]},{"given":"He","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20134","key":"10.1016\/j.tcs.2017.01.018_br0010","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/B:ANOR.0000030683.64615.c8","article-title":"Complexity results for flow-shop and open-shop scheduling problems with transportation delays","volume":"129","author":"Brucker","year":"2004","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.tcs.2017.01.018_br0020","series-title":"Theory of Scheduling","author":"Conway","year":"1967"},{"key":"10.1016\/j.tcs.2017.01.018_br0030","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1287\/opre.44.5.777","article-title":"Shop problems with two machines and time lags","volume":"44","author":"Dell'Amico","year":"1996","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.tcs.2017.01.018_br0040","first-page":"65","article-title":"Complexity of two-machine flow shop scheduling with one transporter","volume":"116","author":"Ding","year":"2016","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2017.01.018_br0050","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.tcs.2017.01.018_br0060","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01585870","article-title":"Approximability of flow shop scheduling","volume":"82","author":"Hall","year":"1998","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.tcs.2017.01.018_br0070","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0166-218X(00)00316-4","article-title":"Makespan minimization for flow-shop problems with transportation times and a single robot","volume":"112","author":"Hurink","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2017.01.018_br0080","first-page":"354","article-title":"On an automated two-machine flowshop scheduling problem with infinite buffer","volume":"34","author":"Kise","year":"1991","journal-title":"J. Oper. Res. Soc. Japan"},{"issue":"1","key":"10.1016\/j.tcs.2017.01.018_br0090","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/j.tcs.2017.01.018_br0100","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and scheduling: algorithms and complexity","volume":"4","author":"Lawler","year":"1993","journal-title":"Handbooks Oper. Res. Management Sci."},{"key":"10.1016\/j.tcs.2017.01.018_br0110","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/1099-1425(200101\/02)4:1<3::AID-JOS57>3.0.CO;2-D","article-title":"Machine scheduling with transportation considerations","volume":"4","author":"Lee","year":"2001","journal-title":"J. Sched."},{"issue":"52","key":"10.1016\/j.tcs.2017.01.018_br0120","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1002\/nav.20101","article-title":"Machine scheduling with pickup and delivery","volume":"52","author":"Li","year":"2005","journal-title":"Naval Res. Logist."},{"key":"10.1016\/j.tcs.2017.01.018_br0130","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1080\/07408170590918290","article-title":"Two-machine shop scheduling with an uncapacitated interstage transporter","volume":"37","author":"Lee","year":"2005","journal-title":"IIE Trans."},{"key":"10.1016\/j.tcs.2017.01.018_br0140","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.20323","article-title":"Transporting jobs through a two-machine open shop","volume":"56","author":"Lushchakova","year":"2009","journal-title":"Naval Res. Logist."},{"key":"10.1016\/j.tcs.2017.01.018_br0150","first-page":"1","article-title":"On 2\u00d7n sequencing problem with transportation times of jobs","volume":"12","author":"Maggu","year":"1980","journal-title":"Pure Appl. Math. Sci."},{"key":"10.1016\/j.tcs.2017.01.018_br0160","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1051\/ita\/1992260504391","article-title":"Open shop scheduling with delays","volume":"26","author":"Rayward-Smith","year":"1992","journal-title":"Theor. Inform. Appl."},{"key":"10.1016\/j.tcs.2017.01.018_br0170","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S012905410700484X","article-title":"An improved approximation algorithm for the two-machine flow shop scheduling problem with an interstage transporter","volume":"18","author":"Soper","year":"2007","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2017.01.018_br0180","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.ejor.2003.03.002","article-title":"Complexity of flow shop scheduling problems with transportation constraints","volume":"161","author":"Soukhal","year":"2005","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.tcs.2017.01.018_br0190","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/j.ejor.2007.12.033","article-title":"Production scheduling with supply and delivery considerations to minimize the makespan","volume":"194","author":"Wang","year":"2009","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.tcs.2017.01.018_br0200","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1016\/j.ejor.2005.08.034","article-title":"A note on the complexity of flow shop scheduling with transportation constraints","volume":"178","author":"Yuan","year":"2007","journal-title":"European J. Oper. Res."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517300671?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397517300671?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T19:22:12Z","timestamp":1656357732000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397517300671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":20,"alternative-id":["S0304397517300671"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2017.01.018","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Flowshop problem F2\u2192D|v=1,c\u22651|Cmax revisited","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2017.01.018","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}