13780

Автор(ы): 

Автор(ов): 

3

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

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

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

Название: 

A Note on a Single Machine Scheduling Problem with Generalized Total Tardiness Objective Function

ISBN/ISSN: 

0020-0190

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

  • Information Processing Letters

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

to appear in Information Processing Letters; DOI: 10.1016/j.ipl.2011.10.1013; published online

Город: 

  • Oxford

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

  • Elsevier

Год издания: 

2011

Страницы: 

http://www.sciencedirect.com/science?_ob=ArticleListURL&_method=list&_ArticleListID=1849808165&_sort=r&_st=13&view=c&_acct=C000228598&_version=1&_urlVersion=0&_userid=10&md5=9d78eb57f43a7e7dab5822158441bb0d&searchtype=a
Аннотация
In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. A pseudo-polynomial time solution algorithm is 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. Computational results are presented for both special cases considered.

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

Гафаров Е.Р., Лазарев А.А., Werner F. A Note on a Single Machine Scheduling Problem with Generalized Total Tardiness Objective Function // Information Processing Letters. 2011. to appear in Information Processing Letters; DOI: 10.1016/j.ipl.2011.10.1013; published online. С. http://www.sciencedirect.com/science?_ob=ArticleListURL&_method=list&_ArticleListID=1849808165&_sort=r&_st=13&view=c&_acct=C000228598&_version=1&_urlVersion=0&_userid=10&md5=9d78eb57f43a7e7dab5822158441bb0d&searchtype=a.