%0 Journal Article
%T Two-machine Flow Shop Scheduling Problem with a Single Server and Equal Processing Times
%A Shi ling
%A Cheng xue-guang
%J Journal of Computations & Modelling
%D 2012
%I Scienpress Ltd
%X 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.
%U http://www.scienpress.com/Upload/JCM/Vol%202_3_8.pdf