Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

@article{Bruno1981SequencingTW,
  title={Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan},
  author={John L. Bruno and Peter J. Downey and Greg N. Frederickson},
  journal={J. ACM},
  year={1981},
  volume={28},
  pages={100-113}
}
The problems of minimizing the expected makespan and minimizing the expected tic for a finite set of independent tasks with exponential service-time distributions on m ~ 2 it processors are considered. It is shown that a scheduling policy minimizes the expected flow timq only if it is shortest expected processing time tint, and that a policy minimizes the expected make and only if it is longest expected processing time fast. rE,,' WORDS ArCD PHRASES: scheduling, flow time, makespan, sequencing… CONTINUE READING

From This Paper

Topics from this paper.

Citations

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

Similar Papers

Loading similar papers…