{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:08:07Z","timestamp":1760706487563},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00374-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"255-271","source":"Crossref","is-referenced-by-count":11,"title":["A 3\/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates"],"prefix":"10.1016","volume":"114","author":[{"given":"K.N.","family":"Kashyrskikh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.V.","family":"Sevastianov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00374-7_BIB1","doi-asserted-by":"crossref","unstructured":"C.A. Glass, J.N.D. Gupta, C.N. Potts, Two machine no-wait flow shop scheduling with missing operations, Math. Oper. Res. 24 (1999) 911\u2013924.","DOI":"10.1287\/moor.24.4.911"},{"key":"10.1016\/S0166-218X(00)00374-7_BIB2","doi-asserted-by":"crossref","unstructured":"L.A. Hall, Approximability of flow shop scheduling, Proceedings of the 36th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. press, Los Alamitos, 1995, pp. 82\u201391.","DOI":"10.1109\/SFCS.1995.492465"},{"key":"10.1016\/S0166-218X(00)00374-7_BIB3","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":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0166-218X(00)00374-7_BIB4","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(00)00374-7_BIB5","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: Handbooks in Operations Research and Management Science, eds. S. Graves, A.H.G. Rinnooy Kan and P. Zipkin, Vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 445\u2013522.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"10.1016\/S0166-218X(00)00374-7_BIB6","doi-asserted-by":"crossref","unstructured":"J.K. Lenstra, A.H.G. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problems, in: Studies in Integer Programming, eds. P.L. Hammer, E.L. Johnson, B.H. Korter and G.L. Nemhauser, Ann. Discrete Math., Vol. 1, North-Holland, Amsterdam, 1977, pp. 343\u2013362.","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"10.1016\/S0166-218X(00)00374-7_BIB7","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/moor.10.4.576","article-title":"Analysis of heuristics for two-machine flow-shop sequencing subject to release dates","volume":"10","author":"Potts","year":"1985","journal-title":"Math. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003747?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003747?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T16:26:38Z","timestamp":1578759998000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003747"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00374-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}