Książka = Book ; KS/1/2002/P06
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
[1-2], 81-99 pages ; 21 cm ; Bibliography p. 98-99
Scheduling of tasks on moving executors is considered. ft is formulated as a discrete optimization problem. The overview of solution algorithms is given. Approximate and Al-based algorithms are presented. In the approximate algorithm the 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. A comparison of the scheduling algorithms presented via computer simulation is given.
Creative Commons Attribution BY 4.0 license
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: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
Oct 15, 2021
Aug 25, 2021
35
https://rcin.org.pl/ibsys/publication/243551
Józefczyk, Jerzy
Józefczyk, Jerzy
Józefczyk, Jerzy
Józefczyk, Jerzy
Józefczyk, Jerzy