17762

Автор(ы): 

Лазарев А. А. (ИПУ РАН, Лаборатория 68)
Коренев П. С. (ИПУ РАН, Лаборатория 41)

Автор(ов): 

2

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

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

Доклад

Название: 

Metric and Approximated Solution of the Single Machine Total Tardiness Minimization Scheduling Problem

Электронная публикация: 

Да

Наименование конференции: 

  • 14th IFAC Symposium on Information Control Problems in Manufacturing (INCOM’12, Bucharest, Romania)

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

  • Proceedings of the 14th IFAC Symposium on Information Control Problems in Manufacturing (INCOM’12, Bucharest)

Город: 

  • Bucharest

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

  • University Politehnica of Bucharest, CIMR Research Centre

Год издания: 

2012

Страницы: 

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.

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

Лазарев А.А., Коренев П.С. Metric and Approximated Solution of the Single Machine Total Tardiness Minimization Scheduling Problem / Proceedings of the 14th IFAC Symposium on Information Control Problems in Manufacturing (INCOM’12, Bucharest). Bucharest: University Politehnica of Bucharest, CIMR Research Centre, 2012. С. 399-402.