|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
The research of the algorithm which was built for the polynomially solvable case of the NP-hard problem Lmax for single machineдоклад на конференции
- Авторы: Карпов И.В., Архипов Д.И., Лазарев А.А.
- Международная Конференция : EURO-INFORMS 26th European Conference on Operational Research (Rome, 2013)
- Даты проведения конференции: 2013
- Тип доклада: не указан
- Докладчик: не указан
- Место проведения: Рим, Италия, Италия
-
Аннотация доклада:
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.
- Добавил в систему: Лазарев Александр Алексеевич