Auctions have been used to deal with resource allocation in multi-agent systems. In some environments like service-oriented electronic markets, it is advisable to use recurrent auctions since resources are perishable and auctions are repeated over time with the same or a very similar set of agents. Recurrent auctions are a sequence of one-shot auctions of any kind. As a drawback some problems do appear that could cause the market to collapse at mid-long term. Previous works have dealt with these problems by adding fairness to the auction outcomes but they dealt with multi-unit auctions, in which several units of an item are sold. In this paper, we present a new fair mechanism for multi-unit combinatorial auctions, in which different items, and several units per item are sold in each auction.