{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:43:27Z","timestamp":1648925007216},"reference-count":9,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":["Automatica"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0005-1098(03)00028-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T17:18:30Z","timestamp":1051723110000},"page":"957-967","source":"Crossref","is-referenced-by-count":1,"title":["Non-preemptive scheduling to maximize the minimum global inter-completion time"],"prefix":"10.1016","volume":"39","author":[{"given":"Carlos C.","family":"Amaro","sequence":"first","affiliation":[]},{"given":"Sanjoy K.","family":"Baruah","sequence":"additional","affiliation":[]},{"given":"Alexander D.","family":"Stoyen","sequence":"additional","affiliation":[]},{"given":"Wolfgang A.","family":"Halang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0005-1098(03)00028-1_BIB1","first-page":"33","article-title":"Non-preemptive scheduling to maximize the minimum intercolumniation time","volume":"34","author":"Amaro","year":"2000","journal-title":"The Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC)"},{"issue":"12","key":"10.1016\/S0005-1098(03)00028-1_BIB2","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1109\/12.477248","article-title":"New strategies for assigning real-time tasks to multiprocessor systems","volume":"44","author":"Burchard","year":"1995","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0005-1098(03)00028-1_BIB3","unstructured":"Davari, S., & Dhall, S. K. (1986). An on line algorithm for real-time tasks allocation. IEEE, RTSS (pp. 194\u2013200)."},{"key":"10.1016\/S0005-1098(03)00028-1_BIB4","unstructured":"Feitelson, D.G. (1995). A survey of scheduling in multiprogrammed parallel systems. IBM Research Report RC 19790 (87657), T. J. Watson Research Center, revised February 1995."},{"key":"10.1016\/S0005-1098(03)00028-1_BIB5","series-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0005-1098(03)00028-1_BIB6","doi-asserted-by":"crossref","unstructured":"Gupta, R., & Spezialetti, M. (1994). Busy\u2013idle profiles and compact task graphs: Compile-time support for interleaved and overlapped scheduling of real-time tasks. IEEE, RTSS.","DOI":"10.1109\/REAL.1994.342727"},{"key":"10.1016\/S0005-1098(03)00028-1_BIB7","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","article-title":"Fast algorithms for Bin-packing","volume":"8","author":"Johnson","year":"1974","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"1","key":"10.1016\/S0005-1098(03)00028-1_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TSE.1977.233840","article-title":"Multiprocessor scheduling with the aid of network flow algorithms","volume":"SE-3","author":"Stone","year":"1977","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0005-1098(03)00028-1_BIB9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jpdc.1996.0050","article-title":"Load balanced mapping of distributed objects to minimize network communication","volume":"34","author":"Stoyenko","year":"1996","journal-title":"Journal of Parallel and Distributed Computing"}],"container-title":["Automatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109803000281?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109803000281?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T04:51:02Z","timestamp":1553403062000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0005109803000281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0005109803000281"],"URL":"https:\/\/doi.org\/10.1016\/s0005-1098(03)00028-1","relation":{},"ISSN":["0005-1098"],"issn-type":[{"value":"0005-1098","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}