On-line Algorithms for a Single Machine Scheduling Problem

@inproceedings{Mao2011OnlineAF,
  title={On-line Algorithms for a Single Machine Scheduling Problem},
  author={Weizhen Mao and Rex K. Kincaid},
  year={2011}
}
An increasingly significant branch of computer science is the study of on-line algorithms. In this paper, we apply the theory of on-line algorithms to job scheduling. In particular, we study the nonpreemptive single machine scheduling of independent jobs with arbitrary release dates to minimize the total completion time. We design and analyze two on-line algorithms which make scheduling decisions without knowing about jobs that will arrive in future. 
1 Citations
28 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Efficient heuristics to minimize total flow time with release

  • C. Chu
  • dates, Oper. Res. Lett
  • 1992
Highly Influential
4 Excerpts

Tabu Search in Modern Heuristic Techniques for Combinatorial Problems

  • F. Glover, M. Laguna
  • 1993

and R

  • S. Chand, R. Traub
  • Uzsoy
  • 1993
3 Excerpts

Efficient heuristics to minimize total flow time with release dates , Oper

  • R. W. Conway, W. L. Maxwell, L. W. Miller
  • Res . Lett .
  • 1992

L

  • M. S. Manasse
  • A. McGeoch and D. D. Sleator
  • 1990

Similar Papers

Loading similar papers…