Scheduling a capacitated single machine with time deteriorating job values

We address the scheduling problem with the following characteristics: (i) there is a single machine available, (ii) the machine has limited capacity, and (iii) job value deteriorates with time. The problem is motivated from several real world situations, such as, downloading process of web pages, and scheduling of multiplexes. Since the problem is NP-hard, we propose new heuristics based on a multiplicative piece-wise metric as an approximation of the slope of job value deterioration. Computational results show that the proposed heuristics perform better than other existing heuristics for similar types of problems.