{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:46:11Z","timestamp":1649144771511},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s0167-6377(01)00077-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:37:03Z","timestamp":1027615023000},"page":"17-30","source":"Crossref","is-referenced-by-count":4,"title":["Performance of critical path type algorithms for scheduling on parallel processors"],"prefix":"10.1016","volume":"29","author":[{"given":"Gaurav","family":"Singh","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0167-6377(01)00077-3_BIB1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/moor.2.3.275","article-title":"Scheduling equal-length tasks under tree-like precedence constraints to minimise maximum lateness","volume":"2","author":"Brucker","year":"1977","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00077-3_BIB2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two-processor systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/S0167-6377(01)00077-3_BIB3","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","article-title":"Scheduling tasks with nonuniform deadlines on two processors","volume":"23","author":"Garey","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0167-6377(01)00077-3_BIB4","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/S0167-6377(01)00077-3_BIB5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1996.0007","article-title":"The complexity of scheduling trees with communication delays","volume":"20","author":"Lenstra","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0167-6377(01)00077-3_BIB6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/opre.29.1.189","article-title":"Concurrent task systems","volume":"29","author":"Lloyd","year":"1981","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(01)00077-3_BIB7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","article-title":"UET scheduling with unit interprocessor communication delays","volume":"18","author":"Rayward-Smith","year":"1987","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/S0167-6377(01)00077-3_BIB8","first-page":"101","article-title":"Worst-case performance of two critical path type algorithms","volume":"17","author":"Singh","year":"2000","journal-title":"Asia Pacific J. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00077-3_BIB9","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1111\/j.1475-3995.2000.tb00206.x","article-title":"Worst-case performance of critical path type algorithms","volume":"7","author":"Singh","year":"2000","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/S0167-6377(01)00077-3_BIB10","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-Complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"J. Comput. Systems Sci."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000773?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701000773?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T21:52:32Z","timestamp":1556229152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701000773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0167637701000773"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00077-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}