Correct me but isn't this just a process scheduling problem and your solution is a shortest processing time schedule?
It's a well research problem and there's plenty of papers on this if you google. On 1 April 2011 13:14, snehal jain <[email protected]> wrote: > Suppose you are given a collection of n tasks that need to be > scheduled. With each task, you are given its duration. Specifically, > task i takes ti units of time to execute. Suppose with each task we > also have a release time ri, and that a task may not be started before > its release time. Furthermore, tasks may be preempted, in that a > scheduled task can be interrupted and later resumed, and this can > happen repeatedly. Design an algorithm that finds a schedule that > minimizes the average completion-time in this new situation. > My solution > Store thetasks in increasing order of their release time. And schedule > the tasks according to shortest remaining timefirst. > > any comments? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
