Single machine due-date scheduling of jobs with decreasing start-time dependent processing times

Published version at http://dx.doi.org/10.1111/j.1475-3995.2005.501_1.xWe 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.Department of Logistics and Maritime StudiesAuthor name used in this publication: T. C. E. ChengAuthor name used in this publication: L. Y. KangAuthor name used in this publication: C. T. N