{'fraction_non_alphanumeric': 0.027870680044593088, 'fraction_numerical': 0.005574136008918618, 'mean_word_length': 5.108843537414966, '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}}
Solving Constrained Multiple Resource Networks Both Forward and Backward Using Brooks Algorithm

Many Brooks algorithm (BAG)-based heuristics have been proposed to solve the constrained multiple resource problem. BAG starts at the beginning of a project network, determines a list of available tasks, and then uses a heuristic to select a task to schedule. This research modifies BAG to solve the project network in both a forward and backward (F&B) direction. This modified BAG approach was used on Patterson's 110 test problems with several selection heuristics, such as ACTIM, latest finish time (LFT), resource over time (ROT), and ACTRES. Results of this research show that solving the networks in both the F&B directions led to improvements of more than 30% for the average error, the maximum error and the percentage of optimum solutions found when compared to the traditional BAG approach.