Metadata language
Książka = Book ; KS/1/2002/P06
Creator: Publisher:Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
Place of publishing: Date issued/created: Description:[1-2], 81-99 pages ; 21 cm ; Bibliography p. 98-99
Type of object: Abstract: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.
Relation: Resource type: Detailed Resource Type: Source: Language: Language of abstract: 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: Access: