Scheduling the non-stop modernization of the complex of N>>1 entrprises with largely varied inputs—outputs on account of their profits being reinvested
"Математика. Компьютер. Образование". Cб. трудов X международной конференции. Под общей редакцией Г.Ю. Ризниченко Ижевск: Научно-издательский центр "Регулярная и хаотическая динамика", 2003. Vol. 1. Pp. 188-206.
Non-Marcovian problem of the theory of schedules is solved to minimise the complete reconstruction time for the whole complex of N>>1 enterprises which differ strongly one from the other in inputoutput indexes and as a result in rates of their contribution into one common fund for the reconstruction above. The percent growth and inflation decrease of these accumulations are taken into account. By using of «permutation method» the expressions are deduced for time dependent functions of priority named earlier as ordering potentials in direct and reversed time. Proposed are a) the way to decompose the problem in a tree of subtasks of much less dimensionalities, b) the way of solving the lowest level subtask by the method of branches and boundaries, c) so called «greedy» algorithm for finding an (ε-) optimal decision and d) an exact decision of proper evaluation problem.