Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 1980, Issue 9, Pages 112–120 (Mi at7180)  
Developing Systems

A decompositional algorithm for determining the times of factory commissioning

S. S. Serov

Moscow
Full-text PDF (1369 kB)
Abstract: A decompositional algorithm is proposed for finding the times of commissioning for new factories, a problem which is isolated from the general deployment problem. The decomposition implies isolation of three particular problems, determining a set of sites, of a set of factories, and of an admissible permutation of factories.

Received: 08.01.1980
Document Type: Article
UDC: 65.5.012.122
Language: Russian
Citation: S. S. Serov, “A decompositional algorithm for determining the times of factory commissioning”, Avtomat. i Telemekh., 1980, no. 9, 112–120
Citation in format AMSBIB
\Bibitem{Ser80}
\by S.~S.~Serov
\paper A decompositional algorithm for determining the times of factory commissioning
\jour Avtomat. i Telemekh.
\yr 1980
\issue 9
\pages 112--120
\mathnet{http://mi.mathnet.ru/at7180}
Linking options:
  • https://www.mathnet.ru/eng/at7180
  • https://www.mathnet.ru/eng/at/y1980/i9/p112
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:79
    Full-text PDF :32
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024