We give an O(n log n) time algorithm to preemptively schedule n equal-length jobs with release times on two identical, parallel machines so as to minimize the mean flow time. The complexity of the ...

This paper considers the general, no-wait and no-idle flow shop scheduling problems with deteriorating jobs. By a deteriorating job we mean that the processing time is an increasing function of its ...