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