{'fraction_non_alphanumeric': 0.02176696542893726, 'fraction_numerical': 0.0, 'mean_word_length': 5.109375, '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}}
Parallel branch and bound algorithms for a class of scheduling problems

Scheduling consists in organizing in time the execution of a set of tasks. Works done in this field, generally, deal with special cases. Thus, the models already developed remain too particular to be applied to any scheduling problem. Here, the author presents the solution of a general type of deterministic scheduling problems which takes into account: priority constraints, resources constraints (disjunctive and cumulative), different types of resources of which the supply can vary with time (in a discrete way), the needs of resources that can vary during the execution of each task and performance measures which are an arbitrary non-decreasing function of the completion time of all the set of tasks.