•  
  •  
 

Abstract

The focus of this work is to analyze linear deteriorating jobs in a single-machine scheduling problem with due-date assignment and maintenance activity. The linear deteriorating jobs means its processing time is an increasing function of their starting time. The objective is to minimize the total of earliness, tardiness and due-date cost. To solve the scheduling problem addressed in this work, we have to determine the job sequence, the common due-date, and the location of a maintenance activity. We show that the problem can be solved optimally in O(n2 log n) time.

COinS