This repository contains the complete code used for implmeneting the three metaheuristic approaches (MOGWO, NSGA-II, and MOSS), along with the dataset of small-sized instances for which the epsilon-constraint method is used to find the optimal Pareto front. These correspond to the following publications:
Tamer F. Abdelmaguid. 2020. "Bi-Objective Dynamic Multiprocessor Open Shop Scheduling: An Exact Algorithm." Algorithms 13, no. 3: 74. https://doi.org/10.3390/a13030074