On-line scheduling to minimize average completion time revisited

  title={On-line scheduling to minimize average completion time revisited},
  author={Nicole Megow and Andreas S. Schulz},
  journal={Oper. Res. Lett.},
We consider the scheduling problem of minimizing the average weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith’s ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms. 
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 43 extracted citations


Publications referenced by this paper.

Similar Papers

Loading similar papers…