Minimizing maximum lateness under linear deterioration

Abstract The paper deals with a single machine scheduling problem, where job processing time is given as a start time dependent linear function. The objective is to find such a schedule (processing order) which minimizes the maximum lateness criterion. We show that the problem is NP-complete and present two heuristic algorithms. An experimental analysis of the proposed algorithms is also given.