haku: @indexterm Operations management / yhteensä: 280
viite: 104 / 280
| Tekijä: | Gao, L. -L. Robinson, E. P. |
| Otsikko: | An arborescent network formulation and dual ascent based procedure for the two-stage multi-item dynamic demand lotsize problem |
| Lehti: | Decision Sciences
1994 : VOL. 25;1, p. 103-122 |
| Asiasana: | INVENTORY CONTROL MATHEMATICAL PROGRAMMING INVENTORIES OPERATIONS MANAGEMENT |
| Kieli: | eng |
| Tiivistelmä: | Traditional approaches for modeling and solving dynamic lotsize problems are based on Zangwill's single-source network and dynamic programming algorithms. In this paper, we propose an absorescent fixed-charge network (ARBNET) programming model and dual ascent based branche-and-bound procedure for the two-stage multi-item dynamic demand lotsize problem. Computional results show that the new approach is significantly more efficient than earlier solution strategies. An additional advantage of the algorithm is the availability of a feasible solution, with a known worst-case optimality gap, throughout the problem soving process. |
SCIMA