I am currently working on a project scheduling problem that gives me an interesting situation of two ending activities. The objective is to determine the critical path of this project. Although there are two ending activities separate from each other, I got the result that there is exactly one cr...

So I have a single machine job scheduling problem as detailed below. I've been using multiple greedy algorithm approaches and computing the maximum profit among them to come up with the best schedule, but I don't think that solution gives good enough of an answer since it is only an approximation...