A Note on a Single Machine Scheduling Problem with Generalized Total Tardiness Objective Functionстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 18 июля 2013 г.
Аннотация: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.