Optimal Selection of Non-Overlapping Jobs
If you consider each task as a node of a graph, and each conflict as an edge, this is a weighted maximum independent set problem.
It is NP-hard, but you should get good results with a mixed integer programming solver, such as CBC.