For a graph G, let D(G) be the set of all strong digraphs D obtained by the orientations of G. The orientation number of G is min {d(D)| D ∈ D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, we determine the orientation number for some subgraphs of complete bipartite graphs.