Scheduling Jobs with Varying Processing Times


In this paper the makespan scheduling problem on one machine and C ,,,= criterion is considered. Job processing times are described by increasing linear functions depending on the starting times of the jobs. Two polynomial-time algorithms for finding an optimal schedule are given. 
DOI: 10.1016/0020-0190(95)00009-2