source data for article entitled multi-objective parallel variable neighborhood search for energy consumption scheduling in blocking flow shops

A multi-objective parallel variable neighborhood search (MPVNS) algorithm is proposed for solving the multi-objective blocking flow shop scheduling problem. The MPVNS is compared with non-dominated sorting genetic algorithm (NSGA-II) and bi-objective multi-start simulated annealing algorithm (BMSA). This data provide the original results obtained by the three algorithms, which are compared in a research paper entitled Multi-objective parallel variable neighborhood search for energy consumption scheduling in blocking flow shops.