This question is based on the slides from this pdf:
Slide 54, they define the Subset Sum Problem.
Slide 65, they define the Partition problem.
Slide 74, they talk about the Job Scheduling problem.
My question is, is it possible to cut the middle man of the partition problem and reduce Subset Sum to Job Scheduling directly?
To prove scheduling is NP, we can use what is already stated since it's not related to partition.
I'm not sure how to combine the reduction from both onto one though.