Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
复制标题
DOI：
10.1111/j.1475-3995.2005.501_1.x
复制
发表时间：
2005-05
期刊：
影响因子：
--
通讯作者：
T. Cheng;L. Kang;L. Kang;C. T. Ng
中科院分区：
文献类型：
--
作者：
T. Cheng;L. Kang;L. Kang;C. T. Ng
研究了加工时间是起始时间的递减函数的作业调度问题。我们考虑单台机器的情况和处理时间的共同递减率。问题是确定一个最优的到期日和时间表的组合，以最小化到期日，提前和迟到的惩罚总和。我们给出了一个O（n log n）时间的算法来解决这个问题。
We study the problem of scheduling jobs whose processing times are decreasing functions of their starting times. We consider the case of a single machine and a common decreasing rate for the processing times. The problem is to determine an optimal combination of the due date and schedule so as to minimize the sum of due date, earliness and tardiness penalties. We give an O(n log n) time algorithm to solve this problem.