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

We consider single-machine scheduling problem in which the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on...