Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming