![]() |
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
We consider the problem of trainings planning on ISS. Shown that the problem is a combination of a k Partition Problem and an Assignment Problem. NP-compleeteness is proofed. A heuristic and an exact algorithms are proposed.