Even when all tasks in a project are independent, there are still no known optimal and efficient algorithms for scheduling.  But, from a purely practical perspective, it is easier to schedule independent events for a couple of reasons:

• When all tasks are independent (there are no precedence relations), tasks can always be assigned to the processors as they become free in exactly the order given by the Priority List.  So, there is no need to analyze a project digraph before assigning tasks to processors for a scheduling problem consisting of independent tasks.
• When all tasks are independent (there are no precedence relations), the decreasing-time list and the critical-path list are exactly the same.  This means, of course, that the Decreasing-Time Algorithm (DTA) is the same as the Critical-Path Algorithm (CPA).  So, there is no need to go to the extra trouble of calculating critical times in order to apply the CPA to a scheduling problem consisting of independent tasks.

Back