{'fraction_non_alphanumeric': 0.007462686567164179, 'fraction_numerical': 0.0, 'mean_word_length': 5.548780487804878, '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}}
Hybrid Flowshop Scheduling with Finite Transportation Capacity

This paper studies a class of hybrid flowshop scheduling problem characterized by release time, transportation time and transportation capacity of one unit for each transporter. This problem is formulated as an integer programming model and a Lagrangian relaxation algorithm is designed to solve it. Testing results on problems of small to medium sizes show that the Lagrangian relaxation algorithm can obtain an acceptable near optimal schedule within a shorter CPU time.