WANG, WEN-WEI; HE, LONG-MIN; CHENG, MING-BAO - In: Asia-Pacific Journal of Operational Research (APJOR) 27 (2010) 05, pp. 617-627
This paper considers minimizing total completion time in a two-stage flowshop scheduling problem with m identical … time at Stage 2 is NP – hard and gave a two-approximation algorithm in O(n3) time. In the case that all jobs have arbitrary … processing time at Stage 1 and at Stage 2, we give an approximation algorithm after pointing out that in this case the problem is …