Minimizing Total Completion Time in a Flow-shop Scheduling Problems with a Single Server

We consider the problem of two-machine flow-shop scheduling with a single server and equal processing times, we show that this problem is NP -hard in the strong sense and present a busy schedule for it with worst-case bound 7 / 6