Inny tytuł:

Raport Badawczy = Research Report ; RB/13/2002

Wydawca:

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

Miejsce wydania:

Warszawa

Opis:

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

Abstrakt:

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.

Czasopismo/Seria/cykl:

Raport Badawczy = Research Report

Szczegółowy typ zasobu:

Report

Identyfikator zasobu:

oai:rcin.org.pl:107727

Źródło:

RB-2002-13

Język:

pol

Język streszczenia:

pol

Prawa:

Creative Commons Attribution BY 4.0 license

Zasady wykorzystania:

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: ; -

Digitalizacja:

Systems Research Institute of the Polish Academy of Sciences

Lokalizacja oryginału:

Library of Systems Research Institute PAS

Dofinansowane ze środków:

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.

Dostęp:

Open