In this paper, we consider some relaxed synchronous and asynchronous multisplitting iteration schemes for solving the mixed linear complementarity problems, with the matrix A being H-matrix. We establish some convergence theorems for the methods. Numerical results show that the new methods are efficient and suitable to parallel computing.