Minimizing the total weighted completion time in a two-agents scheduling problem