The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time


Allahverdi A., Al-Anzi F. S.

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, no.1-2, pp.166-177, 2008 (SCI-Expanded) identifier identifier

Abstract

In this paper, we address the two-stage assembly flowshop scheduling problem with a weighted sum of makespan and mean completion time criteria, known as bicriteria. Since the problem is NP-hard, we propose heuristics to solve the problem. Specifically, we propose three heuristics; simulated annealing (SA), ant colony optimization (ACO), and self-adaptive differential evolution (SDE). We have conducted computational experiments to compare the performance of the proposed heuristics. It is statistically shown that both SA and SDE perform better than ACO. Moreover, the experiments reveal that SA, in general, performs better than SDE, while SA consumes less CPU time than both SDE and ACO. Therefore, SA is shown to be the best heuristic for the problem.