Optimizing the allocation of components to kits in small‐lot, multiechelon assembly systems

J. F. Chen and W. E. Wilhelm

Naval Research Logistics (NRL), 1994, vol. 41, issue 2, 229-256

Abstract: The kitting problem in multiechelon assembly systems is to allocate on‐hand stock and anticipated future deliveries to kits so that cost is minimized. This article structures the kitting problem and describes several preprocessing methods that are effective in refining the formulation. The model is resolved using an optimizing approach based on Lagrangian relaxation, which yields a separable problem that decomposes into a subproblem for each job. The resulting subproblems are resolved using a specialized dynamic programming algorithm, and computational efficiency is enhanced by dominance properties devised for that purpose. The Lagrangian problem is resolved effectively using subgradient optimization and a specialized branching method incorporated in the branch‐and‐bound procedure. Computational experience demonstrates that the specialized approach outperforms the general‐purpose optimizer OSL. The new solution approach facilitates time‐managed flow control, prescribing kitting decisions that promote cost‐effective performance to schedule. © 1994 John Wiley & Sons. Inc.

Date: 1994
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199403)41:23.0.CO;2-H

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:41:y:1994:i:2:p:229-256

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().