{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:20:40Z","timestamp":1649013640761},"reference-count":7,"publisher":"Elsevier BV","issue":"2-5","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0165-6074(93)90063-q","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:14:48Z","timestamp":1062609288000},"page":"89-92","source":"Crossref","is-referenced-by-count":2,"title":["High level synthesis through folding of data flow graphs: Optimal intra-node scheduling"],"prefix":"10.1016","volume":"39","author":[{"given":"Anna","family":"Antola","sequence":"first","affiliation":[]},{"given":"Fausto","family":"Distante","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Marchese","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"n. 5","key":"10.1016\/0165-6074(93)90063-Q_BIB1","volume":"vol. 7","year":"1990","journal-title":"IEEE Design & Test of Computers"},{"issue":"n.1","key":"10.1016\/0165-6074(93)90063-Q_BIB2","article-title":"A decomposition approach for balancing large scale acyclic data flow graphs","volume":"vol. 39","author":"Chang","year":"1990","journal-title":"IEEE TOC"},{"key":"10.1016\/0165-6074(93)90063-Q_BIB3","series-title":"Proc IEEE International Conference on Wafer Scale Integration","article-title":"DFGs for synthesis of alternative architectures: node activation synthesis","author":"Antola","year":"1992"},{"key":"10.1016\/0165-6074(93)90063-Q_BIB4","first-page":"74","article-title":"Scheduling in Computer and Manifacturing Systems","author":"Blazewicz","year":"1993"},{"key":"10.1016\/0165-6074(93)90063-Q_BIB5","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of Machine Scheduling Problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0165-6074(93)90063-Q_BIB6","series-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0165-6074(93)90063-Q_BIB7","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/opre.23.3.475","article-title":"On Scheduling with ready times and due dates to minimize maximum lateness","volume":"23","author":"McMahon","year":"1975","journal-title":"Oper. Res."}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749390063Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749390063Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T10:26:38Z","timestamp":1551090398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016560749390063Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":7,"journal-issue":{"issue":"2-5","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["016560749390063Q"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(93)90063-q","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}