Efficient algorithms for finding optimal power-of-two policies for production/distribution systems with general joint setup costs
We consider a production/distribution system represented by a general directed acyclic network. Each node is associated with a specific "product" at a given location and/or production stage. An arc (i, j) indicates that item i is used to "produce" item j. External demands may occur at any of the network's nodes. These demands occur continuously at item-specific constant rates. Components may be assembled in any given proportions. The cost structure consists of inventory carrying, viable, and fixed production/distribution costs.