{'fraction_non_alphanumeric': 0.024489795918367346, 'fraction_numerical': 0.0, 'mean_word_length': 5.456140350877193, '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}}
An MILP approach to short-term scheduling of an industrial make-and-pack production facility with batch splitting and quality release times

We develop an MILP formulation for the short-term scheduling of an industrial make-and-pack plant producing consumer goods. We address a case study which includes sequence-dependent changeover times, heterogeneous storage units with finite capacities, quality release times, batch splitting, partial equipment connectivity, and transfer times. The planning problem consists in minimizing the production makespan while meeting given end-product demands. Our computational results show that for the first time, small instances of the case study can be solved to optimality within short CPU times.