{'fraction_non_alphanumeric': 0.017434620174346202, 'fraction_numerical': 0.0024906600249066002, 'mean_word_length': 4.826086956521739, '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}}
A Parallel Method for the Assignment Problem

In this paper, a two-phase method is presented for the selection of machines to be kept on the shop floor and the assignment of parts to be manufactured for these machines. In the first phase, dynamic programming or a heuristic procedure identifies a set of feasible solutions to a "knapsack problem. " In the second phase, implicit enumeration technique or a greedy algorithm solves an assignment problem. The proposed method is written in language C and runs on a parallel virtual machine called PVM-W95. The results obtained from the parallel implementation on several examples which are found in the literature, as well as examples generated at random, were used to establish a comparison with the sequential algorithm and to perform a speedup analysis.