{'fraction_non_alphanumeric': 0.01814300960512273, 'fraction_numerical': 0.0, 'mean_word_length': 4.826086956521739, '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}}
An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times

The single machine total weighted tardiness problem with sequence-dependent setup times (often known as problem ) requires a given set of jobs to be sequenced on a single machine, where a setup time is required before the processing of each job that depends on both the preceding job and the job to be processed next. The goal is to minimise the sum of weighted tardiness, where the tardiness of a job is zero if it is completed by its due date and is equal to its completion time minus its due date otherwise. In this paper, we develop an Iterated Local Search (ILS) heuristic and compare its performance with the state-of-the-art metaheuristic algorithms from the literature. The proposed ILS algorithm obtains high-quality solutions using computation times that is comparable to its competitors.