A Pareto block-based estimation and distribution algorithm for multi-objective permutation flow shop scheduling problem

Multi-objective flow shop scheduling plays a key role in real-life scheduling problem which attract the researcher attention. The primary concern is to find the best sequence for flow shop scheduling problem. Estimation of Distribution Algorithms (EDAs) has gained sufficient attention from the researchers and it provides prominent results as an alternate of traditional evolutionary algorithms. In this paper, we propose the pareto optimal block-based EDA using bivariate model for multi-objective flow shop scheduling problem. We apply a bivariate probabilistic model to generate block which have the better diversity. We employ the non-dominated sorting technique to filter the solutions. To check the performance of proposed approach, we test it on the benchmark problems available in OR-library and then we compare it with non-dominated sorting genetic algorithm-II (NSGA-II). Computational results show that pareto optimal BBEDA provides better result and better convergence than NSGA-II.