摘要

In this paper we consider a single-machine scheduling problem with the effects of learning and deterioration. In this model, job processing times are defined by functions of their starting times and positions in the sequence. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the Sum of earliness, tardiness and due-date. We show that the problem remains polynomially solvable under the proposed model.