In Cassioli et al. (2015), the complexity of finding DMDGP re-orders was stated to be NP-complete by inclusion, which fails to provide a complete picture. In this paper we show that this problem is indeed NP-complete for , but it is in P for each fixed .