Search

This paper investigates the scheduling problems with general deterioration models. By the deterioration models, the actual processing time functions of jobs depend not only on the scheduled position in the job sequence but also on the total weighted normal processing times of the jobs already processed. In this paper, the objective is to minimize the makespan. For the singlemachine scheduling problems with general deterioration effects, we show that the considered problems are polynomially solvable. For the flow shop scheduling problems with general deterioration effects, we also show that the problems can be optimally solved in polynomial time under the proposed conditions. [ABSTRACT FROM AUTHOR]