Operating Vehicle Sharing systems means periodically performing some relocation process, in order to avoid stations becoming either empty or overfilled. We first propose here a static Vehicle Sharing Rebalancing (VSR) framework which unifies preemption and non preemption. Next we present and test a decomposition algorithmic scheme which decomposes our problem into a simple minimum cost assignment master problem and a slave PDP (Pick up and Delivery) problem.