The results of the analysis of the main methods of solution of the problem of scheduling: the method of simulated annealing, branch and bound method, genetic algorithms, the ant algorithm. It is shown that problem solving scheduling classes it is advisable to use a amendment of genetic algorithm, that due to the possibility of the specified number of iterations will provide close to optimal or acceptable solution.
schedule method simulated annealing, branch and bound method, genetic algorithms, the ant algorithm
"Analiz metodiv rozviazku zadachi skladannia rozkladu zaniat" [Analysis method for solving the problem of class schedules],
Information Processing Systems,