{'fraction_non_alphanumeric': 0.017462165308498253, 'fraction_numerical': 0.0034924330616996507, 'mean_word_length': 5.142857142857143, '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}}
Optimizing Online Assignment of Harvesting Jobs to Trans-Regional Combines

This study investigated a two-round linear programming method for optimizing online assignment of harvesting jobs to trans-regional combines. A two-round biding process was constructed to provide the competitive quotations for the two-round linear programming method. There was a 25 percent limitation of price difference in the second bid versus the first one. It was found that using the two-round linear programming method significantly decreased the cost to hire the trans-regional combines for harvesting jobs by 4% compared with one-round biding process. This indicates that there is a possibility of developing a better online optimal algorithm based on a multi-round biding process and suggests that it is possible to determine the optimal change limitation and round number.