Problem-Independent Approach to Multiprocessor Dependent Task Scheduling

Abstract

This paper concerns Directed Acyclic Graph task scheduling on parallel executors. The problem is solved using two new implementations of Tabu Search and genetic algorithm presented in the paper. A new approach to solution coding is also introduced and implemented in both metaheuristics algorithms. Results given by the algorithms are compared to those generated by greedy LPT and SS-FF algorithms; and HAR algorithm. The analysis of the obtained results of multistage simulation experiments confirms the conclusion that the proposed and implemented algorithms are characterized by very good performance and characteristics.

AIT-S for Single-Machine Weighted Tardiness Problem

“…The proposals for solving the SMTWT problem have been presented and studied in many works. The most popular ones developed in this¯eld are algorithms based on local search (iterated local search), 6,7 the ideas of evolutionary algorithms, in particular genetic algorithm (GA), 8,9 and taboo search approach 10 as well as simulated annealing (SA). 11 In the last years, some interesting works occurred.…”