Skip to Main Content
The sensitivity analysis of a cellular genetic algorithm with local search is used to design a new and simpler heuristic for the problem of scheduling independent tasks. The proposed heuristic improves the previously known Min-Min heuristic. Moreover, it provides schedules of similar quality to the reference cellular genetic algorithm in a significantly reduced runtime. This heuristic is evaluated across twelve different classes of scheduling instances.