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...

We consider a single-machine common due-window assignment scheduling problem, in which the processing time of a job is a function of its position in a sequence and its resource allocation. The window location and size, along with the associated job schedule that minimizes a certain cost...

In this paper we consider flow shop scheduling problems with a time-dependent learning effect. The time-dependent learning effect of a job on a machine is assumed to be a function of the total normal processing time of the jobs scheduled in front of the job on the machine. The objective is to...