In most cases (polynomials in finitely many variables with complex coefficients or, more generally, coefficients over any field, for example), Gröbner bases exist for any monomial ordering.
The concept and algorithms of Gröbner bases have been generalized to submodules of free modules over a polynomial ring.