Heuristic algorithms for the problem of task scheduling with moving executors
New heuristic algorithms for solving the task scheduling problem with moving executors to minimize the sum of completion times are considered. The corresponding combinatorial optimization problem is formulated for single executor. A hybrid solution algorithm is introduced and investigated, where evolutionary as well as simulated annealing procedures are applied. A simulated annealing algorithm assists the evolutionary algorithm in three different ways. It is used for the generation of the initial set of solutions of the evolutionary algorithm. Moreover, this algorithm attempts to enhance the best solutions at current iterations of the evolutionary procedure. The results of the evaluation of the solution algorithms, which have been performed during the computer simulation experiments, are presented. The influence of the parameters of the solution algorithm as well as the task scheduling problem on the quality of results and on the time of computation is investigated.
Bibliogr. 11 poz., wykr.