{'fraction_non_alphanumeric': 0.01276595744680851, 'fraction_numerical': 0.0, 'mean_word_length': 5.231788079470198, '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}}
Multi-Skill Resource-Constrained Project Scheduling : Formulation and Inequalities

In this paper we study an extension of the resource constrained project scheduling problem in which each resource can perform more than one skill and such that each activity may need several resources for each required skill. We propose a mixedinteger linear programming formulation for this problem. Several sets of additional inequalities are also proposed. The goal is to obtain a model that can be solved efficiently by a general solver, which is an important feature for practitioners. Due to the fact that some of the above mentioned inequalities require a valid upper bound to the problem, a heuristic procedure is proposed. Computational experience is reported based on randomly generated data, showing that for instances of reasonable size the proposed model enlarged with the additional inequalities can be solved efficiently by a general solver.