In a learning effect environment, the machine improves continuously as a result of repeating the same or similar jobs, hence the later a given job is scheduled in the sequence, the shorter its processing time is. In this paper, we consider a new general learning effect, i.e. Dejong＇s learning effect. Using this Dejong＇s learning effect polynomial solutions for the single machine makespan minimization problem, total flow time minimization problem and two classes of single machine multi-criteria problems are obtained.
The form of a dual problem of Mond-Weir type for multi-objective programming problems of generalized functions is defined and theorems of the weak duality, direct duality and inverse duality are proven.
