{'fraction_non_alphanumeric': 0.020833333333333332, 'fraction_numerical': 0.023284313725490197, 'mean_word_length': 5.007352941176471, '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}}
Using Tabu Search to Solve the Job Shop Scheduling Problem with Sequence Dependent Setup Times

Motivation The Job Shop Scheduling problem is among the NP-Hard [6] problems with the most practical usefulness. Industrial tasks ranging from assembling cars to scheduling airplane maintenance crews are easily modeled as instances of this problem, and improving solutions by even as little as one percent can have a significant financial impact. Furthermore, this problem is interesting from a theoretical standpoint as one of the most difficult NP-Hard problems to solve in practice. To cite the canonical example, one 10x10 (that is, 10 jobs with 10 operations each) instance of this problem – denoted MT10 in the literature – was introduced by Muth and Thompson in 1963, but not provably optimally solved until 1989.