Comments on "Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine"

Authors:
Jiping Tao;Zhijun Chao;Yugeng Xi
Affiliations:
Department of Automation, Shanghai Jiao Tong University, Shanghai, China;Department of Automation, Shanghai Jiao Tong University, Shanghai, China;Department of Automation, Shanghai Jiao Tong University, Shanghai, China
Venue:
Journal of Global Optimization
Year:
2011

Citing 3
Cited 0

Developments from a June 1996 seminar on Online algorithms: the state of the art

Developments from a June 1996 seminar on Online algorithms: the state of the art
Optimal On-Line Algorithms for Single-Machine Scheduling

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Competitive Analysis of a Better On-line Algorithm to Minimize Total Completion Time on a Single-machine

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the single machine scheduling problem of minimizing the total completion time, Montoya Torres (J Glob Opt 27:97---103, 2003) presented a semi-online algorithm under the assumption that release dates are known in advance, and showed that it was $${\sqrt{3}}$$ -competitive. However, there are flaws in the proof, and the conclusion about the competitive ratio is not correct. In this note, we show that the semi-online algorithm cannot perform better than the best non-clairvoyant online algorithm with a competitive ratio of 2.