We investigate the problem of reallocation with priorities where one has to assign objects or positions to individuals. Agents can have an initial ownership over an object. Each object has a priority ordering over the agents. In this framework, there is no mechanism that is both individually rational (IR) and stable, i.e. has no blocking pairs. Given this impossibility, an alternative approach is to compare mechanisms based on the blocking pairs they generate. A mechanism has minimal envy within a set of mechanisms if there is no other mechanism in the set that always leads to a set of blocking pairs included in the one of the former mechanism. Our main result shows that the modified Deferred Acceptance mechanism (Guillen and Kesten in Int Econ Rev 53(3):1027–1046, 2012), is a minimal envy mechanism in the set of IR and strategy-proof mechanisms. We also show that an extension of the Top Trading Cycle (Karakaya et al. in J Econ Theory 184:104948, 2019) mechanism is a minimal envy mechanism in the set of IR, strategy-proof and Pareto-efficient mechanisms. These two results extend the existing ones in school choice.