{'fraction_non_alphanumeric': 0.016853932584269662, 'fraction_numerical': 0.003745318352059925, 'mean_word_length': 5.5182926829268295, '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}}
Efficient heuristics and metaheuristics for the unrelated parallel machine scheduling problem with release dates and setup times

Parallel machine scheduling problems are among the most studied scheduling problems in the literature. We study the unrelated parallel machine scheduling problem with release dates and machine-and sequence-dependent setup times to minimize the makespan. We introduce three heuristics, five local search methods and three metaheuristics for the problem: the Late Acceptance Hill Climbing and two variants of Simulated Annealing. Furthermore, we introduce a three-set 1620-instance benchmark in which the number of jobs and machines, release dates, processing and setup times are generated according to existing procedures. The proposed approaches are analyzed and compared on the proposed benchmark. We compare the proposed heuristics and derive the best heuristic to be used to generate the initial solution of the metaheuristics. Moreover, we show that the different metaheuristics are efficient, each performing best on one of the sets.