Scheduling jobs with values exponentially deteriorating over time

In this paper we study a new type of single machine scheduling problem, where the critical scheduling parameter, that is job value, deteriorates exponentially over time. A heuristic algorithm for finding a sub-optimal solution of the problem and the computer program created for testing the algorithm are presented. The algorithm has been tested in a case of remanufacturing of PCs and it has been shown that it yields near optimal schedules.