Authors:
Antonio Gabriel Rodrigues
and
Arthur Tórgo Gómez
Affiliation:
Universidade do Vale do Rio dos Sinos, Brazil
Keyword(s):
Scheduling Problem, Part Selection Problem, Part Family, Tabu Search, Flexible Manufacturing Systems, Cluster Identification, Keep Tool Needed Soonest approach.
Related
Ontology
Subjects/Areas/Topics:
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Optimization Algorithms
Abstract:
Considering a Job Shop Scheduling Problems with tooling and due date constraints, experiments were made with a computational model based in Cluster Analysis and Tabu Search. Two minimization policies can be done in this model: swtiching instants and tardiness time. Previous experiments identify the conflict between these policies, as the positive influence of variation of TS parameters. This paper presents experiments considering the influence of the variation of TS paramenters nbmax (number of non-improving iterations performed by TS) and tabu list size.