"All-different hypergraph coloring" - known problem?
I believe this is known in the literature as the problem of finding a strong k-coloring for a k-uniform hypergraph.  This should be a good place to start: [PDF].