{'fraction_non_alphanumeric': 0.015957446808510637, 'fraction_numerical': 0.0, 'mean_word_length': 5.075268817204301, '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 job-shop batch scheduling method based on game theory

As the scheduling objective of taking the maximal profit of each task consisting of work pieces submitted bycustomers, a non-cooperation game model for batch scheduling is presented. In order to effectively find the Nash equilibrium point of the model, a strategy about multiple transport and gapless equivalent batch splitting is adopted. A hybrid adaptive genetic algorithm based on hill-climbing method is designed. A numerical case study is carried out to demonstrate the validity of scheduling methods.