It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, Journal of Pure and Applied Algebra, (117& 118)(1997), 105 -117; M. Kreuzer and L. Robbiano, Computational Commutative Algebra 2, Springer, 2005.) for computing minimal homogeneous generating sets of graded submodules and graded quotient modules of free modules over a commutative polynomial algebra, can be adapted for computing minimal homogeneous generating sets of graded submodules and graded quotient modules of free modules over a weighted N-graded solvable polynomial algebra, where solvable polynomial algebras are in the sense of (A. Kandri-Rody and V. Weispfenning, Non-commutative Gröbner bases in algebras of solvable type. J. Symbolic Comput., 9(1990), 1-26).Consequently, algorithmic procedures for computing minimal finite graded free resolutions over weighted N-graded solvable polynomial algebras are achieved.