{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T17:45:46Z","timestamp":1772819146848,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1984,6]]},"DOI":"10.1016\/0020-0190(84)90006-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"267-273","source":"Crossref","is-referenced-by-count":32,"title":["Scheduling independent 2-processor tasks to minimize schedule length"],"prefix":"10.1016","volume":"18","author":[{"given":"J.","family":"B\u0141aZ\u0300ewicz","sequence":"first","affiliation":[]},{"given":"J.","family":"Weglarz","sequence":"additional","affiliation":[]},{"given":"M.","family":"Drabowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/0020-0190(84)90006-1_BIB1","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1109\/PROC.1978.11107","article-title":"Fault tolerance: The survival attribute of digital systems","volume":"66","author":"Avizienis","year":"1978","journal-title":"Proc. IEEE"},{"key":"10.1016\/0020-0190(84)90006-1_BIB2","author":"Baker","year":"1974"},{"key":"10.1016\/0020-0190(84)90006-1_BIB3","unstructured":"J. B\u0141az\u0300ewicz, M. Drabowski and J. Weglarz, Minimizing schedule length in fault-tolerant microprocessor systems, to appear."},{"key":"10.1016\/0020-0190(84)90006-1_BIB4","year":"1976"},{"key":"10.1016\/0020-0190(84)90006-1_BIB5","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/0020-0190(84)90006-1_BIB6","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/T-C.1974.223782","article-title":"Characterization of connection assignment of diagnosable systems","volume":"C-23","author":"Hakimi","year":"1974","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(84)90006-1_BIB7","article-title":"Recent developments in deterministic sequencing and scheduling: A survey","author":"Lawler","year":"1981"},{"issue":"6","key":"10.1016\/0020-0190(84)90006-1_BIB8","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","article-title":"On the connection assignment problem of diagnosable system","volume":"EC-16","author":"Preparata","year":"1967","journal-title":"IEEE Trans. Electronic Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900061?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019084900061?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:58:01Z","timestamp":1555088281000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019084900061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["0020019084900061"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(84)90006-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}