Subtitle:

Raport Badawczy = Research Report ; RB/13/2002

Publisher:

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

Place of publishing:

Warszawa

Description:

21 pages ; 21 cm ; Bibliography p. 20-21

Abstract:

In this report scheduling of tasks on moving executors is considered. It is formulated as the discrete optimization problem. The overview of solution algorithms is given. Approximate and AI-based algorithms are presented. In the approximate algorithm the solution algorithms for solving the classical scheduling problem and TSP are applied. Different versions of the evolutionary algorithm are also described. They comprise adaptation or learning of crossover and mutation probabilities. The comparison of the scheduling algorithms presented via computer simulation is given.

Relation:

Raport Badawczy = Research Report

Detailed Resource Type:

Report

Resource Identifier:

oai:rcin.org.pl:107727

Source:

RB-2002-13

Language:

pol

Language of abstract:

pol

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