Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.orl.2007.02.009
DC Field | Value | |
---|---|---|
dc.title | Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions | |
dc.contributor.author | Jaruphongsa, W. | |
dc.contributor.author | Çetinkaya, S. | |
dc.contributor.author | Lee, C.-Y. | |
dc.date.accessioned | 2014-06-17T07:01:53Z | |
dc.date.available | 2014-06-17T07:01:53Z | |
dc.date.issued | 2007-11 | |
dc.identifier.citation | Jaruphongsa, W., Çetinkaya, S., Lee, C.-Y. (2007-11). Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions. Operations Research Letters 35 (6) : 813-822. ScholarBank@NUS Repository. https://doi.org/10.1016/j.orl.2007.02.009 | |
dc.identifier.issn | 01676377 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/63249 | |
dc.description.abstract | We present a two-echelon dynamic lot-sizing model with two outbound delivery modes where one mode has a fixed set-up cost structure while the other has a container-based cost structure. Studying the optimality properties of the problem, we provide a polynomial solution algorithm based on a dynamic programming approach. © 2007 Elsevier B.V. All rights reserved. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.orl.2007.02.009 | |
dc.source | Scopus | |
dc.subject | Dynamic programming | |
dc.subject | Inventory | |
dc.subject | Lot-sizing | |
dc.type | Article | |
dc.contributor.department | INDUSTRIAL & SYSTEMS ENGINEERING | |
dc.description.doi | 10.1016/j.orl.2007.02.009 | |
dc.description.sourcetitle | Operations Research Letters | |
dc.description.volume | 35 | |
dc.description.issue | 6 | |
dc.description.page | 813-822 | |
dc.description.coden | ORLED | |
dc.identifier.isiut | 000250629700018 | |
Appears in Collections: | Staff Publications |
Show simple 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.