A.V. Gurjanov – General Director of JSC «EDB «Electroavtomatika» named after P.A.Yefimov» (Saint-Petersburg) E-mail: postmaster@elavt.spb.ru

A.V. Shukalov – Ph. D. (Eng.), First Deputy General Director, Main Designer, 

JSC «EDB «Electroavtomatika» named after P.A.Yefimov» (Saint-Petersburg)

E-mail: aviation78@mail.ru

I.O. Zharinov – Dr. Sc. (Eng.), Associate Professor, Head of UNC, 

JSC «EDB «Electroavtomatika» named after P.A.Yefimov» (Saint-Petersburg)

E-mail: igor_rabota@pisem.net

O.O. Zharinov – Ph. D. (Eng.), Associate Professor, Saint-Petersburg State University of Aerospace Instrumentation E-mail: zharinov73@hotbox.ru

S.A. Leonovets – Post-graduate Student, ITMO University (Saint Petersburg) E-mail: ser2694@ya.ru

The problem of labor intensity reduction during the designing of construction documentation for a radio-electronics industry item is being studied. The labor intensity reduction during the designing of documentation allows to reduce the final price of the item. The labor intensity reduction while the documentation is being designed is based on the interconnection between construction documents representation which is based on the oriented graph model and its subdivision in partially-independent subgraphs. The tops of the graphs are the document codes and the edges of the graphs define the interconnection of the item engineering data in the limits of several construction documents/ Each partially-independent subgraph is a combination of the document codes which is programmed with an unvarying system of the computer aided design. The result of a division algorithm application is a set of document codes classified with the types of computer aided design programs which are normally used in various divisions of the same radio-electronics industry company. The graph division algorithm in the partially-independent subgraphs is represented as a scheme of blocks. The proposed algorithm innovation is a binary rule inclusion in the graph division procedure which prohibits to exclude the graph edges connecting the graph tops which correspond to the document codes programmed with unvarying computer aided design systems.

1. By'chkov I., Vashhuk Yu. Konstruktorskaya speczifikacziya – informaczionnaya osnova upravleniya predpriyatiem // SAPR i grafika. 2001. № 9. S. 90−95.
2. Paramonov P.P., Gatchin Yu.A., Zharinov I.O., Zharinov O.O., Dejko M.S. Princzipy' postroeniya otraslevoj sistemy' avtomatizirovannogo proektirovaniya v aviaczionnom priborostroenii // Nauchno-texnicheskij vestnik informaczionny'x texnologij, mexaniki i optiki. 2012. № 6. S. 111−117.
3. Zharinov I.O., Zharinov O.O., Shek-Iovsepyancz R.A., Suslov V.D. Oczenka snizheniya trudoemkosti podgotovki konstruktorskoj dokumentaczii s ispol'zovaniem CALS-texnologii v priborostroenii // Nauchno-texnicheskij vestnik informaczionny'x texnologij, mexaniki i optiki. 2012. № 4. S. 151−153.
4. Gur'yanov A.V., Shukalov A.V., Zharinov I.O., Leonovecz S.A., Didenko E.Yu. Upravlenie inzhenerny'mi danny'mi proekta pri avtomatizaczii podgotovki konstruktorskoj dokumentaczii // Nauchno-texnicheskij vestnik informaczionny'x texnologij, mexaniki i optiki. 2017. T. 17. № 1. S. 182−186.
5. Gatchin Yu.A., Zharinov I.O., Zharinov O.O. Arxitektura programmnogo obespecheniya avtomatizirovannogo rabochego mesta razrabotchika bortovogo aviaczionnogo oborudovaniya // Nauchno-texnicheskij informaczionny'x texnologij, mexaniki i optiki. 2012. № 2. S. 140−141.
6. Berczun V.N. Matematicheskoe modelirovanie na grafax. Ch. 2. Tomsk: Izdatel'stvo Tomskogo universiteta. 2013. 86 s.
7. Borisova L.F. Algoritmy' optimizaczii setevy'x struktur na baze grafov kodovy'x peresechenij pri ob''edinenii proizvol'ny'x grafov // Vestnik MGTU. 2011. T. 14. № 4. S. 799−810.
8. Starchenko A.V., Berczun V.N. Metody' parallel'ny'x vy'chislenij. Tomsk: Izdatel'stvo Tomskogo universiteta. 2013. 223 s.
9. Gergel' V.P. Vy'sokoproizvoditel'ny'e vy'chisleniya dlya mnogoproczessorny'x mnogoyaderny'x sistem. M.: MGU. 2010. 544 s.
10. Zyabirov E'.V., Tokarev S.P., Fedoseeva L.I. Metody' opredeleniya kratchajshego puti mezhdu vershinami grafa // Uspexi sovremennogo estestvoznaniya. 2011. № 7. S. 113−114.