Comparing deterministic, robust and online scheduling using entropy

@inproceedings{Gan2005ComparingDR,
  title={Comparing deterministic, robust and online scheduling using entropy},
  author={Heng-Soon Gan and Andrew Wirth},
  year={2005}
}
We conjecture that when the uncertainty of scheduling information increases, one should change from deterministic, through robust to, finally, online scheduling techniques. Previously, extensive mathematical investigations have been carried out on the stability of a deterministic schedule for uncertain operation processing times. In this paper, we will use an empirical approach and an entropy measure to justify the transition between deterministic, robust and online scheduling. The use of an… CONTINUE READING

Similar Papers

Loading similar papers…