Supply management in assembly systems
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This work proposes an iterative algorithm which leads to the optimal order instants of the components in the case when n components are needed to assemble a given product.
Abstract
We consider the case when n components are needed to assemble a given product. Components are provided by suppliers, and the period between the order time and the time a component is available (i.e., the lead time) is a random variable with a known distribution. The due date for the assembled product is also known. The costs to be taken into account are the inventory costs of the components and the backlogging cost of the assembled product. We propose an iterative algorithm which leads to the optimal order instants of the components. © 1993 John Wiley & Sons, Inc.