{'fraction_non_alphanumeric': 0.026845637583892617, 'fraction_numerical': 0.0, 'mean_word_length': 5.489130434782608, '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}}
Lower bounds for constrained task allocation problem in distributed computing environment

In this paper, we propose three lower bounds to the constrained task allocation problem (CTAP). These three lower bounds are: a heuristic lower bound (HLB), a linear programming relaxation (LPR) lower bound and a lagrangean relaxation with subgradient optimization (LRSO) based lower bound. We empirically compare the performance of these three bounds under different task executing times. Our experiments with real-world CTAPs indicate that the LPR provides efficient and tight lower bounds for the CTAP.