{'fraction_non_alphanumeric': 0.017173051519154558, 'fraction_numerical': 0.005284015852047556, 'mean_word_length': 5.591304347826087, '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}}
Using Swap‐Based Search Trees to obtain Solutions for Resource Constrained Project Scheduling Problems

The high level of complexity in modern construction projects causes the problem of scheduling the involved tasks under precedence and resource constraints to be a great challenge. Additionally applications on real construction sites require non linear and non continuous constraints and objective functions. In order to optimize large scale construction sites in practice, this paper proposes a new optimization approach based on creating search trees from swapping and delaying tasks. The convergence of the proposed algorithm is analyzed and its complexity is compared to other available algorithms. (© 2014 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)