Abstract
We consider the problem of two-machine flow-shop scheduling with a single server and unit processing times, and show that this problem is NP -hard in the strong sense.
ISSN: 1792-7552 (Online)1792-7544 (Print)