# The Combinatorial Planning Problem (CPP) The **Planning Problem** is a core discipline in Production Planning and Control (PPC). The objective is to find the best configuration of assignments (resources, jobs, workforces, tasks) in a massive solution space. A defining feature of a planning problem is its inherent computational difficult, characterized by being **NP-complete or NP-hard**. This complexity makes search methods like **Brute force** unusable for real-world scenarios due to limitations of time and scalability problems. It's important to consider the [[core-characteristics-of-planning-problem]] and the [[domain-modeling-for-the-solution]] to understand the complexity and the modeling key object classes --- ## References