Scheduling of directed acyclic graphs by a genetic algorithm with a repairing mechanism
Adil Amirjanov, Константин Соболев · Concurrency and Computation Practice and Experience · 2016
Abstract This study has developed a genetic algorithm (GA) approach to the problem of task scheduling for multiprocessor systems. The proposed GA implements the local repairing mechanism and the penalty method, and it does not need tuning of any parameters for high performance. Comparison with other scheduling methods, based on a GA approach, indicates that the proposed GA is competitive in solution quality and also computational cost.