{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:46:43Z","timestamp":1648612003970},"reference-count":13,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"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":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0165-6074(94)90092-2","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T04:56:10Z","timestamp":1060318570000},"page":"651-672","source":"Crossref","is-referenced-by-count":0,"title":["Optimal scheduling of independent jobs in multiprocessor systems"],"prefix":"10.1016","volume":"40","author":[{"given":"Paul P.","family":"Ignatius","sequence":"first","affiliation":[]},{"given":"C.Siva","family":"Ram Murthy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(94)90092-2_BIB1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(90)90166-U","article-title":"An O (n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube","volume":"35","author":"Ahuja","year":"1990","journal-title":"Informat. Processing Letters"},{"issue":"4","key":"10.1016\/0165-6074(94)90092-2_BIB2","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","article-title":"Orthogonal packings in two dimensions","volume":"9","author":"Baker","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0165-6074(94)90092-2_BIB3","series-title":"Proc. 1990 Int. Conf. on Parallel Processing","first-page":"72","article-title":"Approximate algorithms for the partitionable independent tasks scheduling problem","author":"Belkhale","year":"1990"},{"key":"10.1016\/0165-6074(94)90092-2_BIB4","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multiprocessor tasks to minimize schedule length","volume":"C-35","author":"Blazewicz","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0165-6074(94)90092-2_BIB5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0743-7315(91)90031-4","article-title":"Scheduling independent jobs on a partitionable hypercube","volume":"12","author":"Chen","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"issue":"4","key":"10.1016\/0165-6074(94)90092-2_BIB6","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0209062","article-title":"Performance bounds for level-oriented two dimensional packing algorithms","volume":"9","author":"Coffman","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0165-6074(94)90092-2_BIB7","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","article-title":"Complexity of scheduling parallel task systems","volume":"2","author":"Du","year":"1989","journal-title":"J. Discrete Math."},{"key":"10.1016\/0165-6074(94)90092-2_BIB8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"15","author":"Graham","year":"1979","journal-title":"Annals Discrete Math."},{"key":"10.1016\/0165-6074(94)90092-2_BIB9","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/0743-7315(90)90024-J","article-title":"Static job scheduling in partitionable mesh connected systems","volume":"10","author":"Li","year":"1990","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0165-6074(94)90092-2_BIB10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(90)90096-G","article-title":"Preemptive scheduling of independent jobs with release times and dead lines on hypercube","volume":"34","author":"Plehn","year":"1990","journal-title":"Informat. Processing Letters"},{"key":"10.1016\/0165-6074(94)90092-2_BIB11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/149439.133111","article-title":"Scheduling parallelizable tasks: Putting it all on the shelf","volume":"20","author":"Turek","year":"1992","journal-title":"Performance Evaluation Rev."},{"key":"10.1016\/0165-6074(94)90092-2_BIB12","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","volume":"16","author":"Veltman","year":"1990","journal-title":"Parallel Comput."},{"issue":"2","key":"10.1016\/0165-6074(94)90092-2_BIB13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0221021","article-title":"A heuristic of scheduling parallel tasks and its analysis","volume":"21","author":"Wang","year":"1992","journal-title":"SIAM J. Comput."}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607494900922?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0165607494900922?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:53:55Z","timestamp":1552614835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0165607494900922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":13,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0165607494900922"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(94)90092-2","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}