Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time
2018 ◽
Vol 35
(06)
◽
pp. 1850048
Keyword(s):
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.
2017 ◽
Vol 34
(05)
◽
pp. 1750022
2016 ◽
Vol 44
(5)
◽
pp. 676-679
◽
2012 ◽
Vol 112
(1-2)
◽
pp. 55-58
◽
Keyword(s):
2004 ◽
Vol 21
(6)
◽
pp. 567-575
◽
2016 ◽
Vol 44
(6)
◽
pp. 772-774
◽
2009 ◽
Vol 208
(2)
◽
pp. 355-358
◽
2016 ◽
Vol 66
◽
pp. 141-152
◽