Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9663779 | European Journal of Operational Research | 2005 | 20 Pages |
Abstract
For each possible configuration of intermediate inventories a production policy must specify at which stage to produce next and the number of units to be processed. We prove that any arbitrarily “fixed” production policy gives rise to a finite set of linear equations, and develop algorithms to solve the two-stage problem. We also show how the general 2-BNS can be reduced to a three-stage problem, where the middle stage is a non-BN, and that the algorithms developed can be modified to solve this problem.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Abraham Grosfeld-Nir,