You are given a list of jobs, and each job has a duration. Each job can be assigned to one of two processors which work in parallel. The problem is to choose an assignment of jobs to processors so as to minimize the total time required to complete all jobs.
See the files for further information.
14 freelancers estão ofertando em média $39 para esse trabalho
Hello, I know how to find the minimum time of work for O(n^2) operations. ( Now I need to write something, because that field required at least one hundred symbols ).
I write on algorithms and data structure at [login to view URL] I also implement, analyze this algorithms. I would implement it using C++ and give you detailed writeup