We consider the problem of three-machine flow-shop scheduling with a single server and equal processing times, we show that this problem is NP -hard in the strong sense and present an improved Y - H algorithm for it with worst-case bound 4 / 3.
ISSN: 1792-9687 (Print) 1792-9709 (Online)
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: