A class of on-line scheduling algorithms to minimize total completion time

@article{Lu2003ACO,
  title={A class of on-line scheduling algorithms to minimize total completion time},
  author={Xiwen Lu and Ren{\'e} Sitters and Leen Stougie},
  journal={Oper. Res. Lett.},
  year={2003},
  volume={31},
  pages={232-236}
}
We consider the problem of scheduling jobs on-line on a single machine and on identical machines with the objective to minimize total completion time. We assume that the jobs arrive over time. We give a general 2-competitive algorithm for the single machine problem. The algorithm is based on delaying the release time of the jobs, i.e., making the jobs artificially later available to the on-line scheduler than the actual release times. Our algorithm includes two known algorithms for this problem… CONTINUE READING
Highly Cited
This paper has 90 citations. REVIEW CITATIONS

Citations

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

91 Citations

051015'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 91 citations based on the available data.

See our FAQ for additional information.