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-6939 (Online)1792-6602 (Print)
Scienpress.com Copyright © 2019
Scientific Press International Limited
2 Bennington Way, Wigram, Christchurch
8042, New Zealand