@misc{Józefczyk_Jerzy_Wybrane_2002,
 author={Józefczyk, Jerzy},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2002},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={pol},
 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.},
 type={Text},
 title={Wybrane algorytmu rozwiązania problemu szeregowania zadań n uwzględnieniem ruchu realizatorów},
 URL={http://www.rcin.org.pl/Content/107727/PDF/RB-2002-13.pdf},
 keywords={Algorytm ewolucyjny, Szeregowanie zadań},
}