ИСТИНА |
Войти в систему Регистрация |
|
ИПМех РАН |
||
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.
№ | Имя | Описание | Имя файла | Размер | Добавлен |
---|---|---|---|---|---|
1. | 1-s2.0-S1474667016331378-main.pdf | 1-s2.0-S1474667016331378-main.pdf | 321,8 КБ | 17 мая 2016 [Lazarev] |