Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.ejor.2006.02.016
Title: | Designing two-echelon supply networks | Authors: | Romeijn, H.E. Shu, J. Teo, C.-P. |
Keywords: | Branch-and-price algorithm Facility location Integrated transportation and inventory optimization Network design |
Issue Date: | 2007 | Citation: | Romeijn, H.E., Shu, J., Teo, C.-P. (2007). Designing two-echelon supply networks. European Journal of Operational Research 178 (2) : 449-462. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2006.02.016 | Abstract: | A modern distribution network design model needs to deal with the trade-offs between a variety of factors, including (1) location and associated (fixed) operating cost of distribution centers (DCs), (2) total transportation costs, and (3) storage holding and replenishment costs at DCs and retail outlets. In addition, network design models should account for factors such as (4) stockouts, by setting appropriate levels of safety stocks, or (5) capacity concerns, which may affect operating costs in the form of congestion costs. The difficulty of making such trade-offs is compounded by the fact that even finding the optimal two-echelon inventory policy in a fixed and uncapacitated distribution network is already a hard problem. In this paper, we propose a generic modeling framework to address these issues that continues and extends a recent stream of research aimed at integrating insights from modern inventory theory into the supply chain network design domain. Our approach is flexible and general enough to incorporate a variety of important side constraints into the problem. © 2006 Elsevier B.V. All rights reserved. | Source Title: | European Journal of Operational Research | URI: | http://scholarbank.nus.edu.sg/handle/10635/44102 | ISSN: | 03772217 | DOI: | 10.1016/j.ejor.2006.02.016 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.