@Nikhil Gupta I tried on this strategy but I still could find better solutions. Another approach that I tried was : summing all the jobs. Then finding the total time per processor required(Sum of all jobs/no of processors).Round this to next higher multiple of the number of processors.Call this number *T* Now assign each processor jobs as knapsack where limit would be *T(By assigning jobs starting from longest job picking the best candidates such that the knapsack does not overflows)*..Give all remaining jobs to the last processor. If the problem is NP complete I am sure this logic will fail for many cases.But I am unable to find a contradiction.
On Wed, Aug 24, 2011 at 12:32 AM, DK <divyekap...@gmail.com> wrote: > It's NP Complete in the general case: > http://en.wikipedia.org/wiki/Multiprocessor_scheduling > > -- > DK > > http://twitter.com/divyekapoor > http://gplus.to/divyekapoor > http://www.divye.in > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/T_4ygbPRqYIJ. > > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Saurabh Singh B.Tech (Computer Science) MNNIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
