%0 Journal Article %A Witkowski, Tadeush %A Antchak, Arkadiush %D 2003 %I Begell House %N 9 %P 12 %R 10.1615/JAutomatInfScien.v35.i9.30 %T The Genetic Algorithms are a Modern Means of Searching Quasioptimal Solutions %U https://www.dl.begellhouse.com/journals/2b6239406278e43e,2794e63141119aac,7681c6c67ce318ed.html %V 35 %X We consider the use of genetic algorithms for solving combinatorial problems which appear while planning of production processes. On examples we discuss the methods of representation of problems of synthesis of schedules which genetic algorithms and operators of crossover and mutation are applied to. %8 2003-09-01