{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:48Z","timestamp":1759063728164},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"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":9390,"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":[[1987,11]]},"DOI":"10.1016\/0166-218x(87)90023-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"227-233","source":"Crossref","is-referenced-by-count":4,"title":["Job shop scheduling with unit time operations under resource constraints and release dates"],"prefix":"10.1016","volume":"18","author":[{"given":"Jayme Luiz","family":"Szwarcfiter","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90023-0_BIB1","unstructured":"J. Blazewicz, W. Kubiak, H. R\u00f6ck and J.L. Szwarefiter, Flow shop scheduling under resource constraints, to appear."},{"key":"10.1016\/0166-218X(87)90023-0_BIB2","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\/0166-218X(87)90023-0_BIB3","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1287\/moor.7.3.354","article-title":"An efficient optimal algorithm for the two-machines unit-time jobshop schedule-length problem","volume":"7","author":"Hefetz","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(87)90023-0_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","article-title":"Computational complexity of discrete optimization problems","volume":"4","author":"Lenstra","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(87)90023-0_BIB5","first-page":"1","article-title":"Some new results in flow shop scheduling","volume":"28","author":"R\u00f6ck","year":"1984","journal-title":"Z. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:53:18Z","timestamp":1555120398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["0166218X87900230"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90023-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}