Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times

Abstract

This paper investigates a single machine scheduling problem with deteriorating jobs. By a deteriorating job, we mean that the processing time is an increasing function of its execution starting time. Job deterioration is described by a function which is proportional to a linear function of time. The objective is to find a schedule that minimizes total absolute differences in completion times ( TADC). We show that the optimal schedule is V-shaped, i.e., jobs are arranged in descending order of their deterioration rates if they are placed before the job with the smallest deterioration rate, but in ascending order of their deterioration rates if placed after it. We also prove some other properties of an optimal schedule, and propose two heuristic algorithms that are tested against a lower bound. We also provide computational results to evaluate the performance of the heuristic algorithms.