Abstract.
This note deals with the scheduling problem of minimizing the sum of job completion times in a system with n jobs and a single machine. We investigate the on-line version of the problem where every job has to be scheduled immediately and irrevocably as soon as it arrives, without any information on the later arriving jobs. We prove that for any sufficiently smooth, non-negative, non-decreasing function f(n) there exists an O(f(n))-competitive on-line algorithm for minimizing the total completion time if and only if the infinite sum \(\sum_{n=1}^{\infty}1/\ab \big(nf(n)\big)\) converges.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 6 May 1997 / 3 February 1999
Rights and permissions
About this article
Cite this article
Fiat, A., Woeginger, G. On-line scheduling on a single machine: minimizing the total completion time. Acta Informatica 36, 287–293 (1999). https://doi.org/10.1007/s002360050162
Issue Date:
DOI: https://doi.org/10.1007/s002360050162