Please use this identifier to cite or link to this item:
|Title:||A dynamic lot-sizing model with multi-mode replenishments: Polynomial algorithms for special cases with dual and multiple modes||Authors:||Jaruphongsa, W.
|Issue Date:||May-2005||Citation:||Jaruphongsa, W., Çetinkaya, S., Lee, C.-Y. (2005-05). A dynamic lot-sizing model with multi-mode replenishments: Polynomial algorithms for special cases with dual and multiple modes. IIE Transactions (Institute of Industrial Engineers) 37 (5) : 453-467. ScholarBank@NUS Repository. https://doi.org/10.1080/07408170590918218||Abstract:||This paper generalizes the classical dynamic lot-sizing model to consider the case where replenishment orders may be delivered by multiple shipment modes. Each mode may have a different lead time and is characterized by a different cost function. The model represents those applications in which products can be purchased through various suppliers or delivered from a single source using various transportation modes with different lead times and costs. The problem is challenging due to the consideration of cargo capacity constraints, i.e., the multiple set-ups cost structure, associated with a replenishment mode. The paper presents several structural optimality properties of the problem and develops efficient algorithms, based on the dynamic programming approach, to find the optimal solution. The special, yet practical, cases of the two-mode replenishment problem analyzed in this paper are analytically tractable, and hence, the respective problems can be solved in polynomial time. © 2005 "IIE".||Source Title:||IIE Transactions (Institute of Industrial Engineers)||URI:||http://scholarbank.nus.edu.sg/handle/10635/54102||ISSN:||0740817X||DOI:||10.1080/07408170590918218|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 7, 2020
WEB OF SCIENCETM
checked on Jul 31, 2020
checked on Aug 3, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.