WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines
2013 ◽
Vol 2013
◽
pp. 1-7
◽
Keyword(s):
We consider the classical online scheduling problem over single and parallel machines with the objective of minimizing total weighted flow time. We employ an intuitive and systematic analysis method and show that the weighted shortest processing time (WSPT) is an optimal online algorithm with the competitive ratio ofP+1for the case of single machine, and it is (P+(3/2)−(1/2m))-competitive for the case of parallel machines(m>1), wherePis the ratio of the longest to the shortest processing time.
Keyword(s):
2015 ◽
Vol 32
(06)
◽
pp. 1550047
Keyword(s):
2010 ◽
Vol 110
(8-9)
◽
pp. 325-330
◽
Keyword(s):
2017 ◽
Vol 34
(05)
◽
pp. 1750022
2018 ◽
Vol 35
(03)
◽
pp. 1850013
◽
Keyword(s):
Keyword(s):
2002 ◽
Vol 19
(5)
◽
pp. 59-67
◽
2014 ◽
Vol 31
(04)
◽
pp. 1450030
◽
Keyword(s):