标题：Research and Modification of the Universal Method of Scheduling and Operational Planning of Objects with a Network Representation of Discrete Type Production
期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2020
卷号：20
期号：10
页码：31-39
DOI：10.22937/IJCSNS.2020.20.10.5
出版社：International Journal of Computer Science and Network Security
摘要：We study the efficiency of the universal method of scheduling and operational planning for objects with a network representation of discrete production processes (UMSOP) by means of statistical modeling. We claim the efficiency of the method in general and of using PSC-algorithms to solve NP-hard single-stage scheduling problems used in UMSOP. We present a modification of UMSOP, which consists in a proposition to use a new efficient approximation algorithm as a part of the operational planning model. The algorithm is created for the single-stage scheduling problem that allows to solve the operational plan adjusting problems more efficiently, comparing to the single-stage scheduling problem used in UMSOP. We show that the obtained solution is conditionally optimal and give a lower bound to the optimal value of this new problem’s functional.
