![]() |
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ИНХС РАН |
||
We consider the approach to construct approximation schedule withthe guaranteed absolute error for the $NP$-hard schedulingproblems minimizing maximum lateness.