Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1833
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorHsu, VN-
dc.creatorLi, CL-
dc.creatorXiao, WQ-
dc.date.accessioned2014-12-11T08:25:30Z-
dc.date.available2014-12-11T08:25:30Z-
dc.identifier.issn0740-817X-
dc.identifier.urihttp://hdl.handle.net/10397/1833-
dc.language.isoenen_US
dc.publisherTaylor & Francisen_US
dc.rights© 2005 “IIE”.en_US
dc.rightsThis is an electronic version of an article published in V.N. Hsu, C.-L. Li and W.-Q. Xiao (2005), IIE Transactions, 37(3), 201-215. IIE Transactions is available online at: http://www.informaworld.com, the open URL of the article: http://www.informaworld.com/openurl?genre=article&issn=0740-817X&volume=37&issue=3&spage=201.en_US
dc.subjectIntegrated manufacturing systemsen_US
dc.subjectLogisticsen_US
dc.subjectManufacturing engineeringen_US
dc.subjectManufacturing engineering designen_US
dc.subjectOperations managementen_US
dc.subjectOperations researchen_US
dc.subjectProduction systemsen_US
dc.subjectQuality control & reliabilityen_US
dc.subjectReliability & risk analysisen_US
dc.subjectSupply chain managementen_US
dc.titleDynamic lot size problems with one-way product substitutionen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationDepartment of Logisticsen_US
dc.identifier.spage201-
dc.identifier.epage215-
dc.identifier.volume37-
dc.identifier.issue3-
dc.identifier.doi10.1080/07408170590899607-
dcterms.abstractWe consider two multi-product dynamic lot size models with one-way substitution, where the products can be indexed such that a lower-index product may be used to substitute for the demand of a higher-index product. In the first model, the product used to meet the demand of another product must be physically transformed into the latter and incur a conversion cost. In the second model, a product can be directly used to satisfy the demand for another product without requiring any physical conversion. Both problems are generally computationally intractable. We develop dynamic programming algorithms that solve the problems in polynomial time when the number of products is fixed. A heuristic is also developed, and computational experiments are conducted to test the effectiveness of the heuristic and the efficiency of the optimal algorithm.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIIE transactions, Feb. 2005, v. 37, no. 3, p. 201-215-
dcterms.isPartOfIIE transactions-
dcterms.issued2005-02-
dc.identifier.isiWOS:000227305200002-
dc.identifier.scopus2-s2.0-14044277510-
dc.identifier.eissn1545-8830-
dc.identifier.rosgroupidr21524-
dc.description.ros2004-2005 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
43 Final-Version.pdfPre-published version318.91 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

143
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

328
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

49
Last Week
0
Last month
1
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

41
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.