{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:39:15Z","timestamp":1648755555338},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p> We study the problem of online scheduling parallel jobs with bounded processing times on 2 machines, and the objective is to minimize makespan. A parallel job requires simultaneous processing on a pre-specified, job-dependent number of machines. The problem is online in the sense that jobs are presented one by one. Once a job is presented, we must irrevocably assign it to some time slot before the next one shows up. We investigate the case where the processing times of jobs are bounded within interval [a, \u03b1a] where a &gt; 0 and \u03b1 &gt; 1. We first prove a lower bound of competitive ratios for online algorithms equal [Formula: see text] when \u03b1 \u2265 2 and [Formula: see text] when 1 &lt; \u03b1 &lt; 2, respectively. We further prove that the Greedy algorithm proposed in Chan et al. (2008) is [Formula: see text]-competitive in the case but it cannot be better than [Formula: see text]-competitive. The results imply that when 1 &lt; \u03b1 &lt; 2 Greedy has a competitive ratio better than 2, which is the competitive ratio of Greedy in the case without processing time bound. <\/jats:p>","DOI":"10.1142\/s1793830910000760","type":"journal-article","created":{"date-parts":[[2010,10,12]],"date-time":"2010-10-12T04:44:00Z","timestamp":1286858640000},"page":"425-432","source":"Crossref","is-referenced-by-count":0,"title":["ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES"],"prefix":"10.1142","volume":"02","author":[{"given":"MING","family":"LIU","sequence":"first","affiliation":[{"name":"School of Economics &amp; Management, Tongji University, Shanghai 200092, P. R. China"},{"name":"School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi Province 710049, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YINFENG","family":"XU","sequence":"additional","affiliation":[{"name":"School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi Province 710049, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHENGBIN","family":"CHU","sequence":"additional","affiliation":[{"name":"School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi Province 710049, P. R. China"},{"name":"Laboratoire G\u00e9nie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92295, Chatenay-Malabry Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FEIFENG","family":"ZHENG","sequence":"additional","affiliation":[{"name":"School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi Province 710049, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","volume-title":"Online Computation and Competitive Analysis","author":"Borodin A.","year":"1998"},{"key":"rf2","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"Pruhs K.","year":"2004"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.07.005"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-8497-6"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.06.001"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"rf8","first-page":"107","volume":"9","author":"Faigle U.","journal-title":"Acta Cybern."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:34:52Z","timestamp":1565127292000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":7,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.1142\/S1793830910000760"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000760","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}