This paper deals with the machine scheduling problems with the effects of deterioration and learning. In this model the processing times of jobs are defined as functions of their starting times and positions in a sequence. We introduce polynomial solutions for some single machine problems and...

The flow-shop minimum-length scheduling problem with n jobs processed on two machines is addressed where processing times are uncertain: only lower and upper bounds of the random processing times are given before scheduling, but their probability distributions are unknown. For such a problem,...