{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:15:31Z","timestamp":1773839731757,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1007\/bf02238297","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T17:21:14Z","timestamp":1131988874000},"page":"183-191","source":"Crossref","is-referenced-by-count":4,"title":["Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm","Schranken f\u00fcr das Scheduling ohne Unterbrechung von Jobs mit \u00e4hnlichen Proze\u00dfzeiten auf einem Multiprozessorsystem unter Verwendung des LPT-Algorithmus"],"prefix":"10.1007","volume":"46","author":[{"given":"H.","family":"Kellerer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"BF02238297_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1145\/322234.322241","volume":"28","author":"J. O. Achugbue","year":"1981","unstructured":"Achugbue, J. O., Chin, F.: Bounds on schedules for independent tasks with similar execution times. Journal of the ACM28, 1, 81\u201399 (1981).","journal-title":"Journal of the ACM"},{"key":"BF02238297_CR2","volume-title":"Introduction to sequencing and scheduling","author":"R. Baker","year":"1974","unstructured":"Baker, R.: Introduction to sequencing and scheduling. New York: John Wiley 1974."},{"key":"BF02238297_CR3","volume-title":"Computer and job\/shop scheduling theory","year":"1976","unstructured":"Coffman, E. G. Jr., Ed.: Computer and job\/shop scheduling theory. New York: John Wiley 1976."},{"issue":"1","key":"BF02238297_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"E. G. Coffman","year":"1978","unstructured":"Coffman, E. G., Garey, M. R., Johnson, D. S.: An application of binpacking to multiprocessor scheduling. SIAM. J. Comput.7, 1, 1\u201317 (1978).","journal-title":"SIAM. J. Comput."},{"issue":"2","key":"BF02238297_CR5","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, 2, 416\u2013429 (1969).","journal-title":"SIAM J. Appl. Math."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238297.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02238297\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02238297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:02:28Z","timestamp":1557939748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02238297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF02238297"],"URL":"https:\/\/doi.org\/10.1007\/bf02238297","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}