This paper presents a new approach to solve rostering, planning and resource management problems. This is achieved by transforming several kinds of finite domain constraints of a given constraint satisfaction problem (CSP) into a set of regular membership constraints; and then these regular membership constraints are combined together to a more specific regular membership constraint. The purpose of this approach is to improve the speed of CSPs resolution and to remove undesirable redundant constraints (constraints which slow down the resolution speed) by replacing part of or all constraints of a CSP with a set of regular membership constraints followed by the combination of multiple regular membership constraints into a new, more precise regular membership constraint. A concise rostering example has demonstrated that our approach enables a significant improvement of the performance of the CSP resolution due to the pruning of the search tree.