The Solution of Certain Parallel Sequencing Problems

Tushkina, T. A.; Shakhbazyan, K. V.

doi:10.1007/978-1-4615-8588-6_2

Cited by 5 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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.…”

mentioning

confidence: 99%

Electronic computer solution of parallel sequencing problems

Sokhranskaya¹

1977

J Math Sci

View full text Add to dashboard Cite

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

show abstract

mentioning

confidence: 99%