Tynynyka, Оlexandr; Тининика, Олександр Миколайович; Тыныныка, Александр Николаевич
(Odessa National Polytechnic University, 2017)
An easy and close to the optimal heuristic algorithm to solve a problem of scheduling theory with some restriction is offered. Such algorithms it is useful to represent of a secure Petri net. The figure steps for solving ...