%0 Journal Article
%T Minimizing Total Completion Time in a Flow-shop Scheduling Problems with a Single Server
%A Shi ling
%A Cheng xue-guang
%J Journal of Applied Mathematics and Bioinformatics
%D 2012
%I Scienpress Ltd
%X We consider 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 and present a busy schedule for it with worst-case bound 7 / 6
%K flow-shop scheduling problem
%K total completion time
%U http://www.scienpress.com/Upload/JAMB/Vol%202_3_3.pdf