Comparison of genetic representation schemes for scheduling soft real-time parallel applications

@inproceedings{Dandass2006ComparisonOG,
  title={Comparison of genetic representation schemes for scheduling soft real-time parallel applications},
  author={Yoginder S. Dandass and Amit C. Bugde},
  booktitle={GECCO},
  year={2006}
}
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applications represented as directed acyclic graphs (DAGs). The execution time requirements of the applications' tasks are assumed to be stochastic and are represented as probability… CONTINUE READING