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

This paper studies general, no-wait or no-idle flow shop scheduling problems with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. A linear deterioration function with identical normal processing times of all jobs is assumed and some...

In this paper, we consider a three-machine permutation flow shop scheduling problem under simple linear deterioration. By a simple linear deterioration function, we mean that the processing time of a job is a simple linear function of its execution start time. The objective is to find a sequence...