Answers are grounded in this paper and cite their sources.
A genetic algorithm for scheduling computational task graphs is presented. The problem of assigning tasks to processing elements as a combinatorial optimization is formulated, and a heuristic based on a genetic algorithm is presented. The objective function to be minimized is the ‘time on completion’ of all tasks. Results are compared with those published in the literature and with randomly generated task graphs whose optimal schedules are known a priori.
No takes yet. Share an insight, caveat, or question.
Benten et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: