Scheduling of directed acyclic graphs by a genetic algorithmrnwith a repairing mechanism

摘要

This study has developed a genetic algorithm (GA) approach to the problem of task scheduling forrnmultiprocessor systems. The proposed GA implements the local repairing mechanism and thernpenalty method, and it does not need tuning of any parameters for high performance. Comparisonrnwith other scheduling methods, based on a GA approach, indicates that the proposed GA isrncompetitive in solution quality and also computational cost.