Journal article
Matching problems in selective assembly operations
Annals of operations research, Vol.76, pp.95-107
1998
DOI: 10.1023/a:1018960924601
Abstract
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.
Details
- Title: Subtitle
- Matching problems in selective assembly operations
- Creators
- C. R. Coullard - Northwestern UniversityA. B. Gamble - Department of Engineering, Schneider Logistics, United StatesP. C. Jones - College of Business Administration, University of Iowa, United States
- Resource Type
- Journal article
- Publication Details
- Annals of operations research, Vol.76, pp.95-107
- DOI
- 10.1023/a:1018960924601
- ISSN
- 0254-5330
- eISSN
- 1572-9338
- Number of pages
- 13
- Language
- English
- Date published
- 1998
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963207502771
Metrics
1 Record Views