25257

Автор(ы): 

Автор(ов): 

3

Параметры публикации

Тип публикации: 

Тезисы доклада

Название: 

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)

Наименование источника: 

  • Abstracts of the EURO-INFORMS 26th European Conference on Operational Research (Rome, 2013)

Город: 

  • Рим

Издательство: 

  • Sapienza Università di Roma

Год издания: 

2013

Страницы: 

303
Аннотация
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.

Библиографическая ссылка: 

Карпов И.В., Лазарев А.А., Архипов Д.И. The research of the algorithm which was built for the polynomially solvable case of the NP-hard problem Lmax for single machine / Abstracts of the EURO-INFORMS 26th European Conference on Operational Research (Rome, 2013). Рим: Sapienza Università di Roma, 2013. С. 303.