The partition crank function was developed to give a combinatorial proof of the Ramanujan congruences. Two variants of the crank have been studied for overpartitions, a generalization of partitions. We introduce an infinite family, the d-th residual cranks, and extend some known inequalities.