{'fraction_non_alphanumeric': 0.017584994138335287, 'fraction_numerical': 0.0, 'mean_word_length': 5.46969696969697, '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 genetic algorithm for a re-entrant job-shop scheduling problem with sequence-dependent setup times

This article addresses a re-entrant job-shop scheduling problem with sequence-dependent setup times. The disjunctive graph model with the objective of the minimum makespan is used to capture the interactions between machines. On the basis of this representation, two heuristic procedures and a genetic algorithm are proposed to obtain near-optimal solutions for this problem. Also, an experimental design method for determining the various genetic parameters based on the Taguchi approach is presented. A comparative study is conducted to examine the performance of these proposed algorithms and the results show that the genetic algorithm outperforms the other heuristic procedures, which are modified versions of recently published existing methods.