The classical assignment problem is solved by the use of the following algorithms, in the context of Graph Theory, e.g., Forda-Fulkerson algorithm [7] or Branch and Bound [41], Operational Research, e.g., simplex algorithm [42], Hungarian method [43], heuristics algorithms, e.g., ...