| Article ID: | iaor19982129 |
| Country: | Netherlands |
| Volume: | 76 |
| Issue: | 1 |
| Start Page Number: | 95 |
| End Page Number: | 107 |
| Publication Date: | Feb 1998 |
| Journal: | Annals of Operations Research |
| Authors: | Jones Philip C., Gamble A.B., Coullard C.R. |
| Keywords: | matching |
We consider several different matching problems that are motivated by applications to selective assembly operations. In the case of maximum cardinality problems, we provide linear time greedy algorithms which we prove optimal via a min-max theorem. We also consider a weighted version and provide a polynomial time algorithm to find the optimal solution.