To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Research and Modification of the Universal Method of Scheduling and Operational Planning of Objects with a Network Representation of Discrete Type Production |
|
Author |
Sergii Telenyk, Alexander Pavlov, Elena Misura, Taras Lisetsky, Elena Khalus, and Oleg Melnikov |
| Citation |
Vol. 20 No. 10 pp. 31-39 |
|
Abstract |
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. |
|
Keywords |
Scheduling, Operational planning, Discrete production, PSC algorithms, Approximation algorithm |
|
URL |
