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 © 2016
Scienpress Ltd is a Limited Liability company incorporated inEngland and Wales with registered number 08159166.
Suite 1359, Kemp House, 152 - 160 City RoadLondon EC1V 2NX, United Kingdom
Secured Payment Transactions by: