8521

Автор(ы): 

Автор(ов): 

3

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

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

Книга (брошюра, монография, стандарт)

Название: 

Single Machine Scheduling With a Generalized Total Tardiness Objective Function

Город: 

  • Magdeburg

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

  • Otto-von-Guericke Universitaet

Год издания: 

2010

Объём, стр.: 

8
Аннотация
In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. An NP-hardness proof and a pseudo-polynomial time solution algorithm are proposed for a special case of this problem. Moreover, we present a new graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number of tardy jobs on a single machine. The latter algorithm improves the complexity of an existing pseudo-polynomial algorithm by Lawler.

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

Гафаров Е.Р., Лазарев А.А., Werner F. Single Machine Scheduling With a Generalized Total Tardiness Objective Function. Magdeburg: Otto-von-Guericke Universitaet, 2010. – 8 с.