We study the computational complexity of the non-preemptive scheduling problem of a listof independent jobs on a set of identical parallel processors with a makespan minimizationobjective. We make a maiden attempt to explore the combinatorial structure showing theexhaustive solution space of the problem by defining the Scheduling Solution Space Tree(SSST) data structure. The properties of the SSST are formally defined and characterizedthrough our analytical results. We develop a unique technique to show the problemNP using the SSST and the Weighted Scheduling Solution Space Tree (WSSST) datastructures. We design the first non-deterministic polynomial-time algorithm named MagicScheduling (MS) for the problem based on the reduction framework. We also define anew variant of multiprocessor scheduling by including the user as an additional inputparameter. We formally establish the complexity class of the variant by the reductionprinciple. Finally, we conclude the article by exploring several interesting open problemsfor future research investigation.