{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:21:28Z","timestamp":1777965688612,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90152-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"49-72","source":"Crossref","is-referenced-by-count":49,"title":["Dynamic scheduling on parallel machines"],"prefix":"10.1016","volume":"130","author":[{"given":"Anja","family":"Feldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90152-X_BIB1","first-page":"192","article-title":"Optimal simulations by butterfly networks","author":"Bhatt","year":"1988","journal-title":"Proc. 20th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90152-X_BIB2","first-page":"712","article-title":"Algorithm for scheduling tasks in unrelated processors","author":"Davis","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90152-X_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/JCIT.1990.128278","article-title":"Wasted resources in gang scheduling","author":"Feitelson","year":"1990","journal-title":"Proc. 5th Jerusalem Conf. on Information Technology"},{"key":"10.1016\/0304-3975(94)90152-X_BIB4","first-page":"642","article-title":"Dynamic scheduling on parallel machines with dependencies","author":"Feldmann","year":"1993","journal-title":"Proc. 25th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90152-X_BIB5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/SFCS.1991.185355","article-title":"Dynamic scheduling on parallel machines","author":"Feldmann","year":"1991","journal-title":"32nd Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90152-X_BIB6","series-title":"Computer and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(94)90152-X_BIB7","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessor anomalies","author":"Graham","year":"1966","journal-title":"Bell System Tech. J"},{"key":"10.1016\/0304-3975(94)90152-X_BIB8","series-title":"Tech. Report UCB\/CSD 88-408","article-title":"A survey of parallel algorithms for shared memory machines","author":"Karp","year":"1988"},{"key":"10.1016\/0304-3975(94)90152-X_BIB9","first-page":"264","article-title":"Optimal simulation between mesh-connected arrays of processors","author":"Kosaraju","year":"1986","journal-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(94)90152-X_BIB10","series-title":"Tech. Report CMU-CS-88-164","article-title":"Computational models for parallel computers","author":"Kung","year":"1987"},{"key":"10.1016\/0304-3975(94)90152-X_BIB11","series-title":"Complexity Issues in VLSI","author":"Leighton","year":"1983"},{"key":"10.1016\/0304-3975(94)90152-X_BIB12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","article-title":"Approximation algorithm for scheduling unrelated parallel machines","volume":"46","author":"Lenstra","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/0304-3975(94)90152-X_BIB13","series-title":"Operating System Concepts","author":"Peterson","year":"1985"},{"key":"10.1016\/0304-3975(94)90152-X_BIB14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/SFCS.1987.32","article-title":"How to emulate shared memory","author":"Ranade","year":"1987","journal-title":"28th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90152-X_BIB15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/SFCS.1991.185361","article-title":"Scheduling parallel machines on-line","author":"Shmoys","year":"1991","journal-title":"32nd Ann. IEEE Symp. on Foundations of Computer Science"},{"issue":"2","key":"10.1016\/0304-3975(94)90152-X_BIB16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490152X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759490152X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:38:14Z","timestamp":1621031894000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759490152X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["030439759490152X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90152-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}