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, 2020, Issue 6, Pages 17–28
DOI: https://doi.org/10.31857/S0005231020060025
(Mi at15530)
 

This article is cited in 3 scientific papers (total in 3 papers)

Topical issue (end)

The network programming method in project scheduling problems

V. N. Burkova, I. V. Burkovaa, V. G. Zaskanovb

a Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
b Samara State Aerospace University, Samara, Russia
Full-text PDF (203 kB) Citations (3)
References:
Abstract: The network programming method is applied to the discrete problem of minimizing the costs of a project with a given duration. Two basic algorithms for solving this problem in the cases of independent and sequential jobs are described. More complex cases of project scheduling on networks (tree network and aggregated network) are treated by the sequential application of the basic algorithms. For the case of a build-up assembly network, a new method based on the following idea is proposed: an appropriate set of jobs is determined and their durations are fixated so that the resulting network becomes either a tree or an aggregated network. All possible alternatives for fixating the durations of jobs from such a set are considered and, for each alternative, the problem is completely solved. The best alternative among all possible ones is selected. The case of project scheduling on an arbitrary network is also studied.
Keywords: job duration, job costs, tree network, aggregated network, network programming method.
Funding agency Grant number
Russian Foundation for Basic Research 18-07-01258_а
Russian Science Foundation 16-19-10609
This work was supported in part by the Russian Foundation for Basic Research, project no. 18-07-01258, and the Russian Science Foundation, project no. 16-19-10609.
Presented by the member of Editorial Board: A. A. Lazarev

Received: 10.07.2019
Revised: 22.10.2019
Accepted: 28.11.2019
English version:
Automation and Remote Control, 2020, Volume 81, Issue 6, Pages 978–987
DOI: https://doi.org/10.1134/S000511792006003X
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: V. N. Burkov, I. V. Burkova, V. G. Zaskanov, “The network programming method in project scheduling problems”, Avtomat. i Telemekh., 2020, no. 6, 17–28; Autom. Remote Control, 81:6 (2020), 978–987
Citation in format AMSBIB
\Bibitem{BurBurZas20}
\by V.~N.~Burkov, I.~V.~Burkova, V.~G.~Zaskanov
\paper The network programming method in project scheduling problems
\jour Avtomat. i Telemekh.
\yr 2020
\issue 6
\pages 17--28
\mathnet{http://mi.mathnet.ru/at15530}
\crossref{https://doi.org/10.31857/S0005231020060025}
\elib{https://elibrary.ru/item.asp?id=43297638}
\transl
\jour Autom. Remote Control
\yr 2020
\vol 81
\issue 6
\pages 978--987
\crossref{https://doi.org/10.1134/S000511792006003X}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000540264200003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85086439131}
Linking options:
  • https://www.mathnet.ru/eng/at15530
  • https://www.mathnet.ru/eng/at/y2020/i6/p17
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024