|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
Metric and Approximated Solution of the Single Machine Total Tardiness Minimization Scheduling Problemтезисы доклада
- Авторы: Лазарев А.А., Коренев П.С.
- Сборник: Proceedings of the 14th Symposium on Information Control Problems in Manufacturing (INCOM’12, Bucharest, Romania)
- Тезисы
- Год издания: 2012
- Место издания: Bucharest
- Первая страница: 399
- Последняя страница: 402
- Аннотация: In this paper, we consider the NP-hard minimizing total tardiness on a single machine scheduling problem. We propose a metric for that problem and present a polynomial approximation scheme based on search for the polynomially solvable instance which has a minimal distance from an initial instance.
- Добавил в систему: Лазарев Александр Алексеевич