Multi-objective sequencing on mixed-model parallel assembly lines is known as an NP-hard
problem. Hence, to optimize this problem, heuristic approaches need to be developed. In this research,
a Biogeography-Based Optimization (BBO) algorithm is adapted to optimize three objectives
simultaneously, which are minimum variance of production rates, minimum utility work, and
minimum setup times. The performance of BBO is compared with the well-known algorithm, Nondominated
Sorting Genetic Algorithms II (NSGA-II). The experimental results show that BBO outperforms NSGA-II in terms of convergence, ratios of non-dominated solutions and CPU time. In
contrast, it is found that the spread metric of NSGA-II is a marginally better than that to BBO.