{'fraction_non_alphanumeric': 0.02099236641221374, 'fraction_numerical': 0.0019083969465648854, 'mean_word_length': 5.357575757575757, '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}}
Genetic algorithm for Job Shop Scheduling with Earliness and Tardiness penalties

The just-in-time production philosophy has led to a growing interest in scheduling problems considering both Earliness and Tardiness (E/T) penalties. An E/T schedule model, with the consideration of different penalties for tardiness, earliness and flowtime of jobs, is introduced to minimize total production costs. Based on classical genetic algorithm, a new Enhanced Genetic Algorithm (EGA) is designed to solve tardy and early problems. In order to avoid infeasible decoding solutions and reduce simultaneously tardiness costs, the chromosome-repair operator based on critical paths is put forward to solve the problem that some jobs violate the due date constraints. The objective-value revision operator based on chromosome rescheduling is introduced to reduce in-process and final goods inventory costs by delaying job release date. The proposed approaches have been tested on a wide range of 80 scheduling problems and satisfactory results have been obtained.