WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines
Jiping Tao, Tundong Liu
Source abstract
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 of P + 1 for the case of single machine, and it is ( P + ( 3 / 2 ) − ( 1 / 2 m ) )-competitive for the case of parallel machines ( m > 1 ) , where P is the ratio of the longest to the shortest processing time.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.