Order Projects By Deadlines
What is the problem we solve ?
Suppose n projects E(1),....E(n) are given.For each and everyone of those projects there is a deadline d(i)>0 which is an integer number of time units and a profit p(i)>0 which is gained only if the project is fulfilled before the exceeded of the deadline.The execution of a project(any of them)requires a time unit.Which projects and in what order should be constructed in order to maximize the total profit?
More info about this applet you can find in :
Algorithms Tutoring Web Page
Or you can go to :