25430

Автор(ы): 

Автор(ов): 

3

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

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

Статья в журнале/сборнике

Название: 

Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one.

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

Да

ISBN/ISSN: 

ISSN 0254-5330; ISSN 1572-9338/e

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

  • Annals of Operations Research

Обозначение и номер тома: 

No.196

Город: 

  • Berlin

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

  • Springer Berlin

Год издания: 

2012

Страницы: 

247-261. http://www.zentralblatt-math.org/zmath/en/search/?q=ai:lazarev.alexander-a
Аннотация
We consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed. We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial running time. This result settles the complexity status of the problem under consideration which was open.

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

Гафаров Е.Р., Лазарев А.А., Werner F. Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one. // Annals of Operations Research. 2012. No.196. С. 247-261. http://www.zentralblatt-math.org/zmath/en/search/?q=ai:lazarev.alexander-a.