| Article ID: | iaor20106124 |
| Volume: | 57 |
| Issue: | 6 |
| Start Page Number: | 605 |
| End Page Number: | 613 |
| Publication Date: | Sep 2010 |
| Journal: | Naval Research Logistics |
| Authors: | Zhao Yao, Shi Junmin |
We consider acyclic supply chains under the full backorder assumption and reveal several simple yet unique properties. Most interestingly, we identify conditions for the best dedicated stocking policy to outperform the best shared stocking policy, and for an acyclic supply chain to be decomposable into a simpler network (e.g., tree). We specify ways to decompose them.