Abstract. Wiener index is the sum of all distances in a graph. If there is not a directed u-v path in a digraph, we set the distance being 0. We study the following problem: Which orientations of a graph yield digraphs with the maximum Wiener index? We solve this problem for some Theta-graphs. In particular, we show that orientations having the maximum Wiener index do not need to be strongly connected.