{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T06:55:40Z","timestamp":1768719340497,"version":"3.49.0"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2018,12]]},"abstract":"<jats:p> In this paper, we consider the online single machine scheduling problem to minimize the maximum weighted completion time of the jobs. For the preemptive problem, we show that the LW (Largest Weight first) rule yields an optimal schedule. For the non-preemptive problem, Li [Li, W (2015). A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completion time. Asia-Pacific Journal of Operational Research, 32(4), 1550030 (10 pages)] presented a lower bound 2, and then provided an online algorithm with a competitive ratio of 3. In this paper, we present two online algorithms with the best-possible competitive ratio of [Formula: see text] for the non-preemptive problem. <\/jats:p>","DOI":"10.1142\/s0217595918500483","type":"journal-article","created":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T02:01:08Z","timestamp":1541556068000},"page":"1850048","source":"Crossref","is-referenced-by-count":13,"title":["Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time"],"prefix":"10.1142","volume":"35","author":[{"given":"Xing","family":"Chai","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China"}]},{"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China"}]},{"given":"Wenhua","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China"}]},{"given":"Liqi","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Information and Management Science, Henan Agricultural University, Zhengzhou, Henan 450003, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2018,12,6]]},"reference":[{"key":"S0217595918500483BIB001","doi-asserted-by":"publisher","DOI":"10.1201\/9781420072747-c3"},{"key":"S0217595918500483BIB002","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0092"},{"key":"S0217595918500483BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/1099-1425(200011\/12)3:6<333::AID-JOS53>3.0.CO;2-8"},{"key":"S0217595918500483BIB004","first-page":"121","volume":"11","author":"Feng Q","year":"2007","journal-title":"OR Transactions"},{"key":"S0217595918500483BIB005","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196296823"},{"key":"S0217595918500483BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S021759591550030X"},{"key":"S0217595918500483BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.05.041"},{"key":"S0217595918500483BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585872"},{"key":"S0217595918500483BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-014-0060-0"},{"key":"S0217595918500483BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.10.001"},{"key":"S0217595918500483BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-010-0172-2"},{"key":"S0217595918500483BIB013","doi-asserted-by":"publisher","DOI":"10.1002\/nav.5"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595918500483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T19:30:40Z","timestamp":1565119840000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595918500483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":12,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2018,12,6]]},"published-print":{"date-parts":[[2018,12]]}},"alternative-id":["10.1142\/S0217595918500483"],"URL":"https:\/\/doi.org\/10.1142\/s0217595918500483","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12]]}}}