{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T13:11:40Z","timestamp":1779369100609,"version":"3.53.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6041,"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":[[1997,1]]},"DOI":"10.1016\/s0166-218x(96)00041-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"141-154","source":"Crossref","is-referenced-by-count":64,"title":["On the complexity of coupled-task scheduling"],"prefix":"10.1016","volume":"72","author":[{"given":"A.J.","family":"Orman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C.N.","family":"Potts","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00041-8_BIB1","article-title":"Shop problems with two machines and time lags","author":"Dell'Amico","year":"1993"},{"key":"10.1016\/S0166-218X(96)00041-8_BIB2","article-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00041-8_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimisation and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(96)00041-8_BIB4","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(96)00041-8_BIB5","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, Centre for Mathematics and Computer Science, Report BS-R8909, The Netherlands."},{"key":"10.1016\/S0166-218X(96)00041-8_BIB6","unstructured":"A.H.G. Rinnooy Kan, Machine Scheduling Problems (Martinus Nijhoff, The Hague)."},{"key":"10.1016\/S0166-218X(96)00041-8_BIB7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0022-0000(76)80029-3","article-title":"Finding the median","volume":"13","author":"Schonhage","year":"1976","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0166-218X(96)00041-8_BIB8","first-page":"489","article-title":"Scheduling coupled-tasks","volume":"28","author":"Shapiro","year":"1981","journal-title":"Naval Res. Logist. Quart."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000418?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000418?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T19:54:37Z","timestamp":1556394877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0166218X96000418"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00041-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}