Subtitle:

Raport Badawczy = Research Report ; RB/19/2004

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Description:

16 pages ; 21 cm ; Bibliography p. 15-16

Abstract:

In the paper, 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. Hybrid solution algorithms are introduced and investigated, where evolutionary as well as simulated annealing procedures are applied. A simulated annealing algorithm assists an 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 improve 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.

Relation:

Raport Badawczy = Research Report

Detailed Resource Type:

Report

Resource Identifier:

oai:rcin.org.pl:139583

Source:

RB-2004-19

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open