## 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 ∑ ∞ n=1 1/\ab(nf(n))

∑n=1∞1/\ab(nf(n))

converges.

∑n=1∞1/\ab(nf(n))

converges.

Original language | English |
---|---|

Pages (from-to) | 287-293 |

Journal | Acta Informatica |

Volume | 36 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1999 |

Externally published | Yes |