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)
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.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top