Scheduling tasks in real-time systems using evolutionary strategies

Finding feasible schedules for tasks running in hard, real-time distributed computing systems is generally NP-hard. This paper describes a heuristic algorithm using evolutionary strategies. Our results indicate that the evolutionary strategies can find feasible schedules (assuming they exist) in very short periods of time.<<ETX>>

[1]  Krithi Ramamritham,et al.  Allocation and scheduling of complex periodic tasks , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[2]  Garrison W. Greenwood,et al.  Scheduling tasks in multiprocessor systems using evolutionary strategies , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.