How to generate an instance for an NP_hard proof, where each element has two inputs?
As you noted yourself, the problem in general is NP-hard.  You can reduce from Partition by letting due date $d = B = (\sum X)/2$, where $X$ is the input to Partition, and let there be two processes.

The proof is quite straight forward and left as an exercise.