{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:09:25Z","timestamp":1772021365944,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":5556,"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":[[1998,5]]},"DOI":"10.1016\/s0166-218x(97)00138-8","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"253-257","source":"Crossref","is-referenced-by-count":14,"title":["Uniform machine scheduling of unit-time jobs subject to resource constraints"],"prefix":"10.1016","volume":"84","author":[{"given":"Mikhail Y.","family":"Kovalyov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yakov M.","family":"Shafransky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00138-8_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling subject to resource constraints: classification and complexity","volume":"5","author":"Blazewicz","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00138-8_BIB2","first-page":"115","volume":"44","author":"Dessouky","year":"1990","journal-title":"Scheduling identical jobs on uniform parallel machines Statistica Neerlandica"},{"key":"10.1016\/S0166-218X(97)00138-8_BIB3","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0196-6774(88)90031-4","article-title":"Algorithms for two bottleneck optimization problems","volume":"9","author":"Gabow","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(97)00138-8_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(97)00138-8_BIB5","series-title":"Working paper 07\/94","article-title":"Uniform machine scheduling of unit-time jobs subject to resource constraints","author":"Kovalyov","year":"1994"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001388?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001388?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:58:24Z","timestamp":1555156704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":5,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0166218X97001388"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00138-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}