![]() |
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
We consider the classical NP-hard scheduling problem Lmax for single machine. Polynomially solvable cases was found and an algorithm was constructed for them. We explore the possibility of using of this algorithm in other cases and the difference with the optimal schedule.