{'fraction_non_alphanumeric': 0.021798365122615803, 'fraction_numerical': 0.0, 'mean_word_length': 5.074380165289257, '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}}
Batch scheduling problem with multiple due-dates constraint

This paper describes the issue of batch scheduling in food production. In the case of perishable product, such as food produce, the lead-time from production to shipping should be decreased. The other hand, products are shipped at diverse times depending on a demand of sellers, because the types of sellers has become diversified such as supermarkets, convenience stores and etc. production of quantity demanded must be completed by time to ship it then. The authors consider a problem with due-dates constraints and construct the algorithm to find the optimal schedule that satisfy the due-dates constraints, and minimize total difference between due-date and completion.