We construct a class of maximal partial line spreads in , that we call -added maximal partial line spreads. We obtain them by depriving a line spread of a hyperplane of some lines and adding pairwise skew lines not in the hyperplane for each removed line. We do it in a theoretical way for every value of , and by a computer search for . More precisely, we prove that for every there are -added MPS of size , for every integer , while by a computer search we get larger cardinalities.