{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:26:25Z","timestamp":1759667185365},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1984,11,1]],"date-time":"1984-11-01T00:00:00Z","timestamp":468115200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1984,11]]},"DOI":"10.1007\/bf00264618","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T04:13:33Z","timestamp":1096344813000},"page":"409-415","source":"Crossref","is-referenced-by-count":9,"title":["A performance guarantee for the greedy set-partitioning algorithm"],"prefix":"10.1007","volume":"21","author":[{"suffix":"Jr.","given":"E. G.","family":"Coffman","sequence":"first","affiliation":[]},{"given":"M. A.","family":"Langston","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00264618_CR1","first-page":"17","volume":"10","author":"E.G. Coffman Jr.","year":"1976","unstructured":"Coffman, E.G., Jr., Sethi, R.: A Generalized Bound on LPT Sequencing. RAIRO \u2014 Informatique 10, 17\u201325 (1976)","journal-title":"RAIRO \u2014 Informatique"},{"key":"BF00264618_CR2","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1137\/0603019","volume":"3","author":"B.L. Deuermeyer","year":"1982","unstructured":"Deuermeyer, B.L., Friesen, D.K., Langston, M.A.: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System. SIAM J. Algebraic and Discrete Methods 3, 190\u2013196 (1982)","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"BF00264618_CR3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on Multiprocessing Timing Anomalies. SIAM J. Appl. Math. 17, 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"BF00264618_CR4","unstructured":"Karmarkar, N., Karp, R.M.: The Differencing Method of Set Partitioning. Computer Science Div., University of California, Berkeley. (To be published)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264618.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00264618\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264618.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T03:54:10Z","timestamp":1581998050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00264618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,11]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1984,11]]}},"alternative-id":["BF00264618"],"URL":"https:\/\/doi.org\/10.1007\/bf00264618","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,11]]}}}