We describe the realization on the M-20 electronic computer of the solution algorithms for certain parallel sequencing problems. We present the results of statistical experiments on these algorithms.Tushkina and Shakhbazy.an [1] proposed algorithms for solving three problems on the compilation of locally optimal schedules for a system with installations working in parallel. The conditions of these problems were formulated in the following manner. Let Cv be an oriented graph without loops and multiple arcs and with a given numbering of the vertices. ing the parallel sequencing problems was ~3 minutes. We also performed a series of statistical experiments on the parallel sequencing algorithms. For this purpose we compiled the program: generator of random graphs GRG. From the specified rrt and rt at the indicated place on the MIASU the