haku: @indexterm Demand / yhteensä: 650
viite: 346 / 650
| Tekijä: | Gao, L. Robinson, E. Jr |
| Otsikko: | An arborescent network formulation and dual ascent based procedure for the two-stage multi-item dynamic demand lotsize problem |
| Lehti: | Decision Sciences
1994 : JAN-FEB, VOL. 25:1, p. 103-121 |
| Asiasana: | INVENTORY CONTROL MATHEMATICAL PROGRAMMING DEMAND |
| Kieli: | eng |
| Tiivistelmä: | Traditional approaches for modeling and solving dynamic demand lotsize problems are based on Zangwill's single-source network and dynamic programming algorithms. In this paper, the authors propose an arborescent fixed-charge network (ARBNET) programming model and dual ascent based branch-and-bound procedure for the two-stage multi-item dynamic demand lotsize problem. Computational results show that the new approach is significantly more efficient than earlier solution strategies. |
SCIMA