{'fraction_non_alphanumeric': 0.01610305958132045, 'fraction_numerical': 0.0, 'mean_word_length': 5.346938775510204, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Influence of NBMAX and tabu list in the scheduling problem

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.