Find the best set of triples of objects, using each object at max one time
Your problem is NP-hard.  In particular, 3-dimensional matching is a special case of your problem, and 3-dimensional matching is NP-hard -- so your problem is, too.