Time Expanded Networks, built by considering the vertices of a base network all over some time space, are powerful tools for the formulation of problems that simultaneously involve resource assignment and scheduling. Still, inmost cases, deriving algorithms from those formulations is difficult.We implement here a generic Project and Lift decomposition scheme while solving the Strong Lift issue, which consists in turning a solution defined on the base network into a solution of the whole problem with identical cost.