Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Suppose we have a set of jobs. Some jobs are related to others for example Job (a) has to finish for Job(b) to begin. Some other jobs are not related, that means can run in parallel. We have a limited number of machines much less than the number of jobs. Is there an algorithm that can assign these jobs to machines so that we minimize the maximum load on any single machine (makespan)

share|improve this question
    
maybe try cs.stackexchange.com –  john mangual Jan 17 '13 at 16:07
    
You may want to look at the assignment problem. –  lewellen Jan 17 '13 at 16:09

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.