{'fraction_non_alphanumeric': 0.029661016949152543, 'fraction_numerical': 0.0, 'mean_word_length': 5.883495145631068, '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}}
A novel Variable Neighborhood Particle Swarm Optimization for multi-objective Flexible Job-Shop Scheduling Problems

This paper introduces a hybrid metaheuristic, the variable neighborhood particle swarm optimization (VNPSO), consisting of a combination of the variable neighborhood search (VNS) and particle swarm optimization (PSO). The proposed VNPSO method is used for solving the multi-objective flexible job-shop scheduling problems (FJSP). The details of implementation for the multi-objective FJSP and the corresponding computational experiments are reported. The results indicate that the proposed algorithm is an efficient approach for the multi-objective FJSP. especially for large scale problems.