{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:58:59Z","timestamp":1649120339586},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,6]]},"abstract":"<jats:p> We study the worst-case performance of approximation algorithms for the problem of multiprocessor task scheduling on m identical processors with resource augmentation, whose objective is to minimize the makespan. In this case, the approximation algorithms are given k (k \u2265 0) extra processors than the optimal off-line algorithm. For on-line algorithms, the Greedy algorithm and shelf algorithms are studied. For off-line algorithm, we consider the LPT (longest processing time) algorithm. Particularly, we prove that the schedule produced by the LPT algorithm is no longer than the optimal off-line algorithm if and only if k \u2265 m - 2. <\/jats:p>","DOI":"10.1142\/s0129054111008519","type":"journal-article","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T08:52:34Z","timestamp":1307695954000},"page":"971-982","source":"Crossref","is-referenced-by-count":0,"title":["WORST-CASE PERFORMANCE EVALUATION ON MULTIPROCESSOR TASK SCHEDULING WITH RESOURCE AUGMENTATION"],"prefix":"10.1142","volume":"22","author":[{"given":"DESHI","family":"YE","sequence":"first","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou 310027, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"QINMING","family":"HE","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou 310027, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1002\/1099-1425(200009\/10)3:5<249::AID-JOS46>3.0.CO;2-9"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1002\/1099-1425(200009\/10)3:5<273::AID-JOS48>3.0.CO;2-0"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/0212033"},{"key":"rf5","volume-title":"Online Computation and Competitive Analysis","author":"Borodin A.","year":"1998"},{"key":"rf6","first-page":"207","volume":"18","author":"Brown D. J.","journal-title":"Acta Informatica"},{"key":"rf7","volume-title":"Handbook of scheduling: Algorithms, Models and Performance Analysis","author":"Drozdowski M.","year":"2004"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.06.001"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-8497-6"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"rf18","volume-title":"Handbook of Scheduling","author":"Pruhs K.","year":"2003"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9125-x"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-007-0032-x"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111008519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:33:29Z","timestamp":1565123609000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111008519"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":14,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,6]]}},"alternative-id":["10.1142\/S0129054111008519"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111008519","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}