{'fraction_non_alphanumeric': 0.01277139208173691, 'fraction_numerical': 0.0, 'mean_word_length': 5.533333333333333, '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}}
The coordinated scheduling of steelmaking with multi-refining and tandem transportation

This article explores coordinated scheduling problem arising in steelmaking and multi-refining operations. Jobs are first processed in converters and then transported downstream to be processed in refining furnaces in which two different transporters are employed in tandem at the stage of transportation. There exist multi-refining jobs. The objective is to minimize the maximum completion time satisfying no transporters conflict and buffer space. For the model, we develop a tabu search algorithm and provide the worst case analysis. Computational tests are evaluated to show the efficiency brought by the tabu search algorithm relative to lower bound and sequenced and separately algorithm.