{'fraction_non_alphanumeric': 0.024324324324324326, 'fraction_numerical': 0.005405405405405406, 'mean_word_length': 5.279661016949152, '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}}
Batching and sequencing of incompatible job families for a single machine problem

This paper extends the work of Omar and Suppiah [1] and proposes three combinations of heuristics that aim to minimize the total weighted tardiness for batching and sequencing of jobs originated from incompatible families with sequence dependent family setup time to be processed on a single machine. The developed three-combination include EDD-EDD, EDD-BATCS and ATC-BATCS. Computational performance experiments of EDD-EDD, EDD-BATCS and ATC-BATCS using 640 randomly generated instances was studied. The results indicate that the ATC-BATCS has outperformed the other two heuristics in terms of quality of the solution (minimizing total weighted tardiness).