A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem