Andrews' generalization of MacMahon's partition theorem states that the number of partitions of n in which odd multiplicities are at least 2r + 1 is equal to the number of partitions in which odd parts are congruent to 2r + 1 (mod 4r + 2). In this note, we give a bijective proof of this generalization. Our result naturally extends the bijection of Andrews, Ericksson, Petrov, and Romik for MacMahon's partition theorem.