The orientable domination number, DOM(G), of a graph G is the largest domination number over all orientations of G. In this paper, DOM is studied on different product graphs and related graph operations. The orientable domination number of arbitrary corona products is determined, while sharp lower and upper bounds are proved for Cartesian and lexicographic products. A result of Chartrand et al. (1996) is extended by establishing the values of DOM(Kn1,n2,n3) for arbitrary positive integers n1,n2 and n3. While considering the orientable domination number of lexicographic product graphs, we answer in the negative a question concerning domination and packing numbers in acyclic digraphs posed in Brešar et al. (2022).