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 © 2019
Scientific Press International Limited
11b Chevron Place, Ilam, Christchurch
8041, New Zealand