This paper proposes a new mixed‐integer linear programming (MILP) model to consider a multiproduct, multiperiod capacitated disassembly scheduling model with parts commonality and partial disassembly. The major contribution of this research is to probe the possibility of partial disassembly and separation of parts until the desired part is obtained. When disassembly is partial, parts that are not in demand will not disassemble, saving time and costs. In addition, another contribution introduced in this paper is the consideration of relationships between parts. By incorporating these relationships into the disassembly scheduling problem, our proposed model offers a more comprehensive and efficient solution. The objective is to provide the best plan for selecting partial disassembly modes and scheduling disassembly due to capacity constraints to meet the demand for leaf parts over the planning time horizon and minimize setup, holding, operating, and supply costs. The proposed model is solved using the CPLEX solver, and numerical experiments using selected literature data for problem sizes and sensitivity analyses of key model parameters are carried out to demonstrate the proposed model’s consistency and robustness. In addition, significant managerial insights have been proposed based on sensitivity analysis to determine the applicability of the proposed model. Key insights reveal that increasing period capacity reduces total costs but requires careful balancing with capacity‐building expenses. Additionally, aligning part demand with the return product structure can significantly cut costs, and managing inventory through the procurement or disposal of less demanded parts can optimize operations.