25172 | ИПУ РАН

Автор(ы):

Автор(ов):

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

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

Доклад

Название:

A Graphical Approach for Solving Single Machine Scheduling Problems Approximately

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

Да

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

7th IFAC Conference on Manufacturing Modelling, Management, and Control (MIM`2013, Saint Petersburg)

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

Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control (MIM`2013, Saint Petersburg)

Город:

Санкт-Петербург

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

ИПУ РАН

Год издания:

2013

Страницы:

1356-1361

Аннотация

For five single machine total tardiness problems a fully polynomial-time approximation scheme (FPTAS) based on a graphical algorithm is presented. The FPTAS has the best running time among the known approximation schemes for these problems.

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

Гафаров Е.Р., Долгий А.Б., Лазарев А.А., Werner F. A Graphical Approach for Solving Single Machine Scheduling Problems Approximately / Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control (MIM`2013, Saint Petersburg). СПб.: ИПУ РАН, 2013. С. 1356-1361.