We first present in this paper the multicriteria case of the selective maintenance problem. This problem consists in finding the best choice of maintenance actions to realize on a multicomponent system, so as to maximize the system reliability and minimize the maintenance cost, but with a limitation in the maintenance time. Since exact methods are inefficient when a lot of components compose the system, we applied a new general method, based on tabu search, for the resolution of multicriteria combinatorial optimization problems. The aim is to quickly generate a good approximation of the whole set of efficient solutions.