where it talks about the interval scheduling problem but with
n processors for
I was wondering if there's a proof if the same algorithm would work if it was only two processors for
k jobs? If there isn't can you explain why it would work?
Something similar to this question: Interval Scheduling Problem with Three Resources
but instead of 3 resources, 2 resources but I'm trying to get
O(n^2) instead of