A problem in the design of bus interconnection networks is to find directed hypergraphs with minimum diameter for fixed values of the order, processors degree and bus size. In this paper we propose the partial line hyperdigraph as a technique for it. The partial line hyperdigraph is related to the line hyperdigraph [1], the partial line digraph [6] and the line digraph [7]. Partial line hyperdigraphs have also good connectivity, expandability and easy routing. Specially interesting results are obtained for the generalized Kautz hyperdigraph.