Probabilistic Analysis for Scheduling with Con icts

@inproceedings{Irani2008ProbabilisticAF,
  title={Probabilistic Analysis for Scheduling with Con icts},
  author={Sandy Irani and Vitus Leung},
  year={2008}
}
In this paper, we consider scheduling jobs that may be competing for mutually exclusive resources. We model the connicts between jobs with a connict graph, so that all concurrently running jobs must form an independent set in the graph. Our goal is to bound the maximum response time of any job in the system. We adopt a discrete model of time and assume that… CONTINUE READING