-
Jiping Tao, Tundong Liu, WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines, Mathematical Problems in Engineering, 2013,: - Jiping Tao, Zhijun Chao, Yugeng Xi, Comments on "Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine", Journal of Global Optimization, 2011,49(2):359-362
- Jiping Tao, Zhijun Chao, Yugeng Xi, Ye Tao, An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time, Information Processing Letters, 2010,110(8):325-330
- Jiping Tao, Zhijun Chao, Yugeng Xi, A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times, Journal of Industrial and Management Optimization, 2010,6(2):269-282
- 陶继平, 席裕庚, 一种新的在线调度算法竞争比分析方法——基于实例转换的方法, 系统科学与数学, 2009,29(10):1381-1389
- 刘暾东, 郑炳辉, 范天娥, 张华飞, 陶继平, 基于分解协调的 SWCC-OBS 网络路由选择研究, 光电子. 激光, 2013,24(9):1720-1726
摘要：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+32−12m) -competitive for the case of parallel machines ( m>1 ), where P is the ratio of the longest to the shortest processing time.