上海大学学报(英文版)
上海大學學報(英文版)
상해대학학보(영문판)
JOURNAL OF SHANGHAL UNIVERSITY
2008年
3期
204-209
,共6页
scheduling%single-machine%linear decreasing processing time%earliness%tardiness
In this paper, a single-machine scheduling model with a given common due date is considered. Job processing time is a linear decreasing function of its starting time. The objective function is to minimize the total weighted earliness award and tardiness penalty. Our aim is to find an optimal schedule so as to minimize the objective function. As the problem is NP-hard, some properties and polynomial time solvable cases of this problem are given. A dynamic programming algorithm for the general case of the problem is provided.
