Utilização da busca tabu para a geração de um modelo aplicado ao Job-shop Scheduling Problem considerando um sistema de manufatura flexível

Abstract

In this paper it is presented the development of scheduling model applied to Job-shop Scheduling Problem, in a Flexible Manufacturing System. The model considers as variables of decision the makespan, total tardiness time, total stop times (setup) and total idle time of production turns. The model proposed is composed to: (i) an objective function that reflects, through its variables of decision and its respective weights, the optimization strategies, and an (ii) architecture that is divided in five phases. The model used the Tabu Search algorithm which, through two strategies neighborhoods generation, searching the objective function optimization. The model architecture is based on extraction of the production demand, in concepts of Group Technology and Dispatching Rules, in the Tabu Search algorithm and save production plan, to deal the Part Selections (Part Families) and Scheduling Problems. The results and analysis are presented in the end of this paper.