SOLVING A MULTI-OBJECTIVE MANUFACTURING CELL SCHEDULING PROBLEM WITH THE CONSIDERATION OF WAREHOUSES USING A SIMULATED ANNEALING BASED PROCEDURE

ADRIÁN TONCOVICH; DANIEL A. ROSSIT; MARIANO FRUTOS; DIEGO G. ROSSIT

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS

GROWING SCIENCE

Lugar: Ottawa; Año: 2019 vol. 10 p. 1 - 16

1923-2926

The competition manufacturing companies face has driven the development of novel and efficient methods that enhance the decision making process. In this work, a specific flow shop scheduling problem of practical interest in the industry is presented and formalized using a mathematical programming model. The problem considers a manufacturing system arranged as a work cell that takes into account the transport operations of raw material and final products between the manufacturing cell and warehouses. For solving this problem, we present a multiobjective metaheuristic strategy based on simulated annealing, the Pareto Archived Simulated Annealing (PASA). We tested this strategy on two kinds of benchmark problem sets proposed by the authors. The first group is composed by small-sized problems. On these tests, PASA was able to obtain optimal or near-optimal solutions in significantly short computing times. In order to complete the analysis, we compared these results to the exact Pareto front of the instances obtained with augmented ε-constraint method. Then, we also tested the algorithm in a set of larger problems to evaluate its performance in more extensive search spaces. We performed this assessment through an analysis of the hypervolume metric. Both sets of tests showed the competitiveness of the Pareto Archived Simulated Annealing to efficiently solve this problem and obtain good quality solutions while using reasonable computational resources.