Robust supply chain network design that considers supply resiliency, plays vital role in supply chain risk management in dealing with various operational and disruption risks. This study developed a novel three-stage decision approach to consider two echelons robust and resilient supply chain networks. We present a mixed-integer non-linear programming model with two objective functions. The objectives are maximization of SCN profit and maximization of resiliency, where robustness, agility, leanness, flexibility, and integrity can be defined as the five resiliency criteria. Fuzzy Simultaneous Evaluation of Criteria and Alternatives (FSECA) and Simple Multi-Attribute Rating technique (SMART) have been used to obtain the supplier resiliency and weighted importance of resilience criteria. Then, a robust optimization model is built based on uncertainty parameters considering supplier resiliency. A Non-dominated Sorting Genetic Algorithm (NSGAII) and Multi Objective Particle Swarm optimization (MOPSO) were used to solve the robust model on a large scale. parameters calibrated by the Taguchi method and five metrics of performance evaluation were considered to compare the meta-heuristic algorithms. We demonstrate the proposed NSGAII algorithm over a competing method based on five performance metrics. The research findings reveal the optimal level of robust supply chain networks based on algorithm performance and Taguchi analyses. Moreover, the results indicate that when profit increases, resilience can increase simultaneously.

Optimizing the trade-off between crucial decisions has been a prominent issue to help decision-makers for synchronizing the production scheduling and distribution planning in supply chain management. In this article, a bi-objective integrated scheduling problem of production and distribution is addressed in a production environment with identical parallel machines. Besides, two objective functions are considered as measures for customer satisfaction and reduction of the manufacturer’s costs. The first objective is considered aiming at minimizing the total weighted tardiness and total operation time. The second objective is considered aiming at minimizing the total cost of the company’s reputational damage due to the number of tardy orders, total earliness penalty, and total batch delivery costs. First, a mathematical programming model is developed for the problem. Then, two well-known meta-heuristic algorithms are designed to spot near-optimal solutions since the problem is strongly NP-hard. A multi-objective particle swarm optimization (MOPSO) is designed using a mutation function, followed by a non-dominated sorting genetic algorithm (NSGA-II) with a one-point crossover operator and a heuristic mutation operator. The experiments on MOPSO and NSGA-II are carried out on small, medium, and large scale problems. Moreover, the performance of the two algorithms is compared according to some comparing criteria. The computational results reveal that the NSGA-II performs highly better than the MOPSO algorithm in small scale problems. In the case of medium and large scale problems, the efficiency of the MOPSO algorithm was significantly improved. Nevertheless, the NSGA-II performs robustly in the most important criteria.

Modeling the simple assembly line balancing (SALB) problem has covered a wide range of real-world applications. The recent advances in optimization problems have created the opportunities to tackle more challenging problems. This paper presents a multi-objective decision making problem to consider two objectives, cost and cycle time, for simple assembly line balancing. The problem is formulated as a mixed integer nonlinear optimization and the proposed study of this paper uses two metaheuristics to solve the resulted problem on some benchmark problems. The preliminary results have indicated that multi objective particle swarm optimization (MOPSO) has provided better quality solutions while the hybrid method based on MOPSO and simulated annealing has yielded more non-dominated Pareto solutions.

In decision making when multiple criteria are determined, the best choice depends on having complete information and proper decision-making technique. The permutation method is one of the popular techniques used in the context of multiple criteria decision making (MCDM). In this paper, a method is presented where there is more than one vector of weights for the criteria and there are uncertainties associated with criteria weights or there are multiple decision makers. We first take different weight vectors to create a multi-objective problem and then we solve them simultaneously to achieve appropriate Pareto solutions of the permutation method. Therefore, MOPSO and NSGA-II algorithms are utilized to find non-dominated solutions. Some examples in different sizes are considered to compare the efficiency of the proposed methods. Results show that by increasing the number of options and considering the computational time, the proposed methods perform better compared with the exact method. Moreover, NSGA-II is more efficient than MOPSO for the considered problem.