-
New methods for the multi-skills project scheduling problem
In this Phd Thesis we introduce several procedures to solve the Multi-Skill Project Scheduling Problem (MSPSP). The aim is to find a schedule that minimizes the... -
Parallel heterogeneous Branch and Bound algorithms for multi-core and multi-G...
Branch and Bound (B&B) algorithms are attractive for solving to optimality combinatorial optimization problems (COPs) by exploring a tree-based search space....
