A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect

The note deals with machine scheduling problems with a more general learning effect model, i.e., the actual job processing time is a function of the sum of the function of the processing times of the jobs already processed and job position. We show that some single machine scheduling problems are still polynomially solvable under the proposed model. We also show that some special cases of the flow shop scheduling problems can be solved in polynomial time.