We consider a no-wait m-machine flowshop scheduling problem which is common in different manufacturing industries such as steel, pharmaceutical, and chemical. The objective is to minimize total tardiness since it minimizes penalty costs and loss of customer goodwill. We also consider the performance measure of total completion time which is significant in environments where reducing holding cost is important. We consider both performance measures with the objective of minimizing total tardiness

more »

... subject to the constraint that total completion time is bounded. Given that the problem is NP-hard, we propose an algorithm. We conduct extensive computational experiments to compare the performance of the proposed algorithm with those of three well performing benchmark algorithms in the literature. Computational results indicate that the proposed algorithm reduces the error of the best existing benchmark algorithm by 88% under the same CPU times. The results are confirmed by extensive statistical analysis. Specifically, ANOVA analysis is conducted to justify the difference between the performances of the algorithms, and a test of hypothesis is performed to justify that the proposed algorithm is significantly better than the best existing benchmark algorithm with a significance level of 0.01.