For positive integers r and n with r ≤ n, let Pn,r be the family of all sets {(x 1 , y 1 ), . . . , (xr, yr)} such that x 1 , . . . , xr are distinct elements of [n] := {1, . . . , n} and y 1 , . . . , yr are also distinct elements of [n]. Pn,n describes permutations of [n]. For r < n, Pn,r describes r-partial permutations of [n]. Families A 1 , . . . , A k of sets are said to be cross-intersecting if, for any distinct i and j in [k], any set in A i intersects any set in A j . A sharp bound for the sum of sizes of cross-intersecting subfamilies of Pn,n has recently been established by the author. We generalize this bound by showing that, if A 1 , . . . , A k are cross-intersecting subfamilies of Pn,r, thenWe also determine the structures for which the bound is attained when r < n. Our main tool is an extension of Katona's cyclic permutation method.