{'fraction_non_alphanumeric': 0.02142857142857143, 'fraction_numerical': 0.0, 'mean_word_length': 4.5394736842105265, '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 parallel machines scheduling

We study the scheduling situation where a set of jobs have to be scheduled on parallel identical machines. Jobs are subjected to release dates and the objective is to minimize a regular min sum criteria F = ∑ fi(Ci). In this talk, we review the existing lower bounds for this problem and we introduce two new ones. All of them are theoretically and experimentally compared.