排序方式: 共有2条查询结果,搜索用时 15 毫秒
1
1.
We consider a single-product, discrete-time production/inventory-control problem with nonstationary concave nondecreasing costs. Given a forecast horizon K, the problem is to find a decision horizon. We specialize to piecewise linear costs a general approach whereby a problem with horizon K + 1 and arbitrary final demand is parametrically solved. The resulting algorithm is polynomial in the input size. 相似文献
2.
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. 相似文献
1