{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:34:23Z","timestamp":1648866863413},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0167-8191(98)00102-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:52:00Z","timestamp":1049741520000},"page":"49-61","source":"Crossref","is-referenced-by-count":5,"title":["A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors"],"prefix":"10.1016","volume":"25","author":[{"given":"A.K.","family":"Amoura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Bampis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Manoussakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zs.","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(98)00102-1_BIB1","unstructured":"M. Drozdowski, Scheduling Multiprocessor Tasks \u2013 An Overview, Submitted"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Disc. Math."},{"key":"10.1016\/S0167-8191(98)00102-1_BIB3","doi-asserted-by":"crossref","unstructured":"J. Blazewicz, P. Dell'Olmo, M. Drozdowski, M.G. Speranza, Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters 41 (1992) 275\u2013280; Corrigendum to Scheduling multiprocessor tasks on three dedicated processors, Information Processing Letters 41 (1992) 275\u2013280; Information Processing Letters 49 (1994) 269\u2013270","DOI":"10.1016\/0020-0190(94)90066-3"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB4","doi-asserted-by":"crossref","unstructured":"P. Dell'Olmo, M.G. Speranza, Z. Tuza, Efficiency and effectiveness of normal schedules on three dedicated processors, Discrete Mathematics, to appear","DOI":"10.1016\/S0012-365X(97)84781-4"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0166-218X(94)00160-F","article-title":"An approximation algorithm for scheduling on three dedicated processors","volume":"61","author":"Goemans","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB6","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1002\/1520-6750(199412)41:7<959::AID-NAV3220410708>3.0.CO;2-K","article-title":"Nonpreemptive scheduling of independent tasks with prespecified processor allocation","volume":"41","author":"Bianco","year":"1994","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB7","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1080\/05695557008974759","article-title":"A branch-and-bound algorithm for the continuous-process task shop scheduling problem","volume":"2","author":"Bozoki","year":"1970","journal-title":"AIIE Trans."},{"key":"10.1016\/S0167-8191(98)00102-1_BIB8","unstructured":"A.K. Amoura, Probl\u00e8mes d'Ordonnancement avec communications dans les syst\u00e8mes multiprocesseurs, Ph.D. thesis, Universit\u00e9 Paris-XI, Orsay, France, 1998"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB9","unstructured":"A.K. Amoura, E. Bampis, Y. Manoussakis, Z. Tuza, Scheduling Multiprocessor Dedicated Tasks on Three Processors, Technical report 1089, LRI, Universit\u00e9 Paris-Sud, Orsay, 1996"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB10","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB11","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms. MIT Press, Cambridge, MA, 1990"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB12","doi-asserted-by":"crossref","unstructured":"H. Kellerer, R. Mansini, U. Pferschy, M.G. Speranza, An efficient fully polynomial approximation scheme for the subset-sum problem, Technical Report, University of Brescia, 1997","DOI":"10.1007\/3-540-63890-3_42"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","article-title":"Complexity of scheduling multiprocessor tasks with prespecified processors allocation","volume":"55","author":"Hoogeveen","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(98)00102-1_BIB14","doi-asserted-by":"crossref","unstructured":"A.K. Amoura, E. Bampis, C. Kenyon, Y. Manoussakis, Scheduling independent multiprocessor tasks, in: Proceedings of the Fifth Annual European Symposium on Algorithms, ESA'97, LNCS vol. 1284, 1997, pp. 1\u201312","DOI":"10.1007\/3-540-63397-9_1"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198001021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819198001021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T04:45:27Z","timestamp":1580273127000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819198001021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0167819198001021"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(98)00102-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}