{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:37:47Z","timestamp":1787337467938,"version":"build-2736575974"},"reference-count":4,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1998,1]]},"abstract":"<jats:p>\n                    This paper considers the problem of on-line scheduling a set of independent jobs on m uniform machines (M\n                    <jats:sub>1<\/jats:sub>\n                    , M\n                    <jats:sub>2<\/jats:sub>\n                    ,..., M\n                    <jats:sub>m<\/jats:sub>\n                    ) in which machine M\n                    <jats:sub>i<\/jats:sub>\n                    's processing speed is s\n                    <jats:sub>i<\/jats:sub>\n                    =1 (i=1,..., m-1) and s\n                    <jats:sub>m<\/jats:sub>\n                    =s &gt;1. List scheduling [Y. Cho and S. Sahni, SIAM J. Comput., 9 (1980), pp. 91--103] guarantees a worst-case performance of $\\frac{3m-1}{m+1} (m\\ge 3)$ and $\\frac{1+\\sqrt 5}2 (m=2)$ for this problem. We prove that this worst-case bound cannot be improved for m=2 and m=3 and for every $m\\ge 4,$ an algorithm with worst-case performance at most $\\frac{3m-1}{m+1}-\\e$ is presented when s\n                    <jats:sub>m<\/jats:sub>\n                    =2,$ where e is a fixed positive number, and then we improve the bound for general s\n                    <jats:sub>m<\/jats:sub>\n                    =s &gt; 1.\n                  <\/jats:p>","DOI":"10.1137\/s0097539799527969","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"414-422","source":"Crossref","is-referenced-by-count":27,"title":["An On-Line Algorithm for Some Uniform Processor Scheduling"],"prefix":"10.1137","volume":"27","author":[{"given":"Rongheng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lijie","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,28]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0209007"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0222026"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, H. Karloff, and R. Vohra,\n                      New algorithms for an ancient scheduling problem\n                      , in Proc. 24th ACM Symp. on Theory of Computing, 1992, pp. 51\u201358.","DOI":"10.1145\/129712.129718"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0097539799527969","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:12:07Z","timestamp":1787335927000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0097539799527969"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["10.1137\/S0097539799527969"],"URL":"https:\/\/doi.org\/10.1137\/s0097539799527969","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}