This paper explores the effective combination of Dynamic Programming (DP) and Constraint Programming (CP) to tackle the Partial Shop Scheduling Problem (PSSP), enhancing flexibility and efficiency in scheduling tasks with complex precedence constraints. While the hybrid approach may not outperform top CP solvers, it demonstrates a promising integration of both methodologies for optimization challenges.