Best-matching protocols for assembly in e-work networks
Assembly networks pose many challenges to the comprising businesses due to their ever-growing distributed nature. This article explores the benefits of incorporating best-matching protocols (BMP) into the principles of design for assembly (DFA) to make better use of already existing information on equipment, parts and suppliers. Best-matching protocols for cooperation requirement planning (BMP-CRP), for part matching (BMP-part) and supplier selection were developed. A case study for the matching of parts and suppliers is provided. The results of the case study corroborate the benefits in quality and costs that the best-matching protocols can yield for businesses in an assembly e-work network.
Year of publication: |
2009
|
---|---|
Authors: | Velásquez, J.D. ; Nof, S.Y. |
Published in: |
International Journal of Production Economics. - Elsevier, ISSN 0925-5273. - Vol. 122.2009, 1, p. 508-516
|
Publisher: |
Elsevier |
Keywords: | Selective assembly Cooperation requirement planning Design for assembly Supply networks Collaborative e-work |
Saved in:
Saved in favorites
Similar items by person
-
Best-matching protocols for assembly in e-work networks
Velásquez, J.D., (2009)
-
Best-matching protocols for assembly in e-work networks
Velásquez, J.D., (2009)
-
Witzerman, J.P., (1995)
- More ...