{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T17:56:57Z","timestamp":1718906217375},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":8113,"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":[[1991,5]]},"DOI":"10.1016\/0166-218x(91)90053-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"227-260","source":"Crossref","is-referenced-by-count":14,"title":["Tighter bound for MULTIFIT scheduling on uniform processors"],"prefix":"10.1016","volume":"31","author":[{"given":"Bo","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90053-Y_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","article-title":"An application of bin-packing to multiprocessor scheduling","volume":"7","author":"Coffman","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(91)90053-Y_BIB2","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1137\/0213044","article-title":"Scheduling independent tasks on uniform processors","volume":"13","author":"Dobson","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(91)90053-Y_BIB3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/0213013","article-title":"Tighter bounds for the MULTIFIT processor scheduling algorithm","volume":"13","author":"Friesen","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(91)90053-Y_BIB4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/0212004","article-title":"Bounds for MULTIFIT scheduling on uniform processors","volume":"12","author":"Friesen","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(91)90053-Y_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(91)90053-Y_BIB6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessor timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(91)90053-Y_BIB7","series-title":"Rept. No. 88547-OR","article-title":"On the exact upper bound for the MULTIFIT processor scheduling algorithm","author":"Minyi","year":"1988"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190053Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190053Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:20:13Z","timestamp":1555122013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9190053Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["0166218X9190053Y"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90053-y","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}