{'fraction_non_alphanumeric': 0.016290726817042606, 'fraction_numerical': 0.0, 'mean_word_length': 5.1461538461538465, '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 new metaheuristic procedure for improving the solution of the response time variability problem

The response time variability problem (RTVP) is a scheduling problem that arises whenever products, clients or jobs need to be sequenced in such a way that the variability in the time between the instants at which they receive the necessary resources is minimised. The RTVP is an NP-hard problem and heuristic and metaheuristic techniques are needed to solve non-small instances. The best results for the RTVP were obtained with a variable neighbourhood search algorithm and a tabu search algorithm. We propose a simulated annealing-based algorithm to solve the RTVP. A computational experiment shows that, on average, the proposed algorithm improves the best procedures published in the literature.