{'fraction_non_alphanumeric': 0.017241379310344827, 'fraction_numerical': 0.0034482758620689655, 'mean_word_length': 5.916666666666667, '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}}
Metaheuristics to solve the software project scheduling problem

This document describes the software project scheduling problem as a combinatorial optimization problem trough the Project Scheduling Problem (PSP). The authors represent the problem as a single-objective problem, which is solved through a group of metaheuristics, including an hybrid strategy that allows to schedule software projects, by minimizing either cost or duration. The metaheuristics implemented were validated with 18 instances of software projects with different number of developers, tasks and skills.