![]() |
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
We consider the problem of planning the cousmonaut's time in ISS with given set of tasks, time planning horizon and load constraints. Shown that the problem is NP-hard in a strong sense. The heuristic algorithm was proposed. Proved that proposed algorithm is exact for problem with requirement of performing all tasks. Program C++ was written and algorithm's work was qualitatively analyzed.