 | | From: | Brad | | Subject: | Help with well algorithm | | Date: | 17 Jan 2005 18:23:13 -0800 |
|
|
 | Anyone remember their discrete mathematics?
I need an algorithm for the following problem:
100 people who can make 10 different products
each person only works on 1 product
there is a matrix for how many of each product a person can make
Each persons capabilities are different.
ie
Product1 Product2 Product3 ......
person1 10 5 12
person2 14 19 6
......
If i need to make so many of each product, is it possible? who should
make what? to give the most products made in the mix I want?
Can anyone help or point me in the right direction?
All help greatly appreciated, I am doing this in my head at the moment.
Thanks.
Oh - any questions please mail.
|
|
| | From: | Ian Woods | | Subject: | Re: Help with well algorithm | | Date: | 19 Jan 2005 05:45:35 -0800 |
|
|
| Sounds like bipartite matching to me. A search engine, or looking in a
decent book covering graph theory, should provide a suitable algorithm.
Ian Woods
|
|
