Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times

This paper deals with flowshop/sum of completion times scheduling problems, working under a “no‐idle” or a “no‐wait” constraint, the former prescribes for the machines to work continuously without idle intervals and the latter for the jobs to be processed continuously without waiting times between consecutive machines. Under either of the constraints the problem is unary NP‐Complete for two machines. We prove some properties of the optimal schedule for n/2/F, no‐idle/σCi. For n/m/P, no‐idle/σCi, and n/m/P, no‐wait/σCi, with an increasing or decreasing series of dominating machines, we prove theorems that are the basis for polynomial bounded algorithms. All theorems are demonstrated numerically.