Approximate Algorithm for Solving the General Problem of Scheduling Theory With High Accuracy
2019 ◽
Vol 7
(4)
◽
pp. 71-85
Keyword(s):
An approximate iterative algorithm is described, allowing the solving of general problems in the theory of schedules. The theoretical and experimental characteristic of the new algorithm are given, as well as ways of finding out its variable indicators by using parallelization computing and the implementation of a parallel version of the algorithm microprocessor. In this way, the authors have described a practical approximate algorithm for time, to solve the general problem of scheduling theory with an average error of 8% less.
Keyword(s):
2012 ◽
Vol 178-181
◽
pp. 1250-1253
Keyword(s):
2017 ◽
Vol 1
(1)
◽
pp. 8
Keyword(s):
Keyword(s):
2020 ◽
Keyword(s):
2019 ◽
Vol XLII-4/W18
◽
pp. 483-488
Keyword(s):
2011 ◽
Vol 120
◽
pp. 226-229
Keyword(s):