WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines
WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines
复制标题
DOI：
10.1155/2013/343287
复制
发表时间：
2013-10
影响因子：
--
通讯作者：
Jiping Tao;Tundong Liu
中科院分区：
文献类型：
--
作者：
Jiping Tao;Tundong Liu
本文研究单机和并行机上的经典在线排序问题，目标是最小化总加权流时间。本文采用一种直观的、系统的分析方法，证明了加权最短加工时间（WSPT）是一种最优的在线算法，在单机情况下，WSPT的竞争比为;在并行机情况下，WSPT的竞争比为（），其中P为最长加工时间与最短加工时间之比。
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 for the case of single machine, and it is ()-competitive for the case of parallel machines , where P is the ratio of the longest to the shortest processing time.