Two-machine Flow Shop Scheduling Problem with a Single Server and Equal Processing Times

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