{'fraction_non_alphanumeric': 0.013020833333333334, 'fraction_numerical': 0.0, 'mean_word_length': 5.152, '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}}
Scheduling job shop problems with sequence-dependent setup times

In this work we consider job shop problems where the setup times are sequence dependent under minimisation of the maximum completion time or makespan. We present a genetic algorithm to solve the problem. The genetic algorithm is hybridised with a diversification mechanism, namely the restart phase, and a simple form of local search to enrich the algorithm. Various operators and parameters of the genetic algorithm are reviewed to calibrate the algorithm by means of the Taguchi method. For the evaluation of the proposed hybrid algorithm, it is compared against existing algorithms through a benchmark. All the results demonstrate that our hybrid genetic algorithm is very effective for the problem.