Show simple item record

dc.contributor.authorZhang, M.en_US
dc.contributor.authorKüçükyavuz, S.en_US
dc.contributor.authorYaman, H.en_US
dc.date.accessioned2016-02-08T09:46:03Z
dc.date.available2016-02-08T09:46:03Z
dc.date.issued2012en_US
dc.identifier.issn0030-364X
dc.identifier.urihttp://hdl.handle.net/11693/21419
dc.description.abstractIn this paper, we study a multiechelon uncapacitated lot-sizing problem in series (m-ULS), where the output of the intermediate echelons has its own external demand and is also an input to the next echelon. We propose a polynomial-time dynamic programming algorithm, which gives a tight, compact extended formulation for the two-echelon case (2-ULS). Next, we present a family of valid inequalities for m-ULS, show its strength, and give a polynomial-time separation algorithm. We establish a hierarchy between the alternative formulations for 2-ULS. In particular, we show that our valid inequalities can be obtained from the projection of the multicommodity formulation. Our computational results show that this extended formulation is very effective in solving our uncapacitated multi-item two-echelon test problems. In addition, for capacitated multi-item, multiechelon problems, we demonstrate the effectiveness of a branch-and-cut algorithm using the proposed inequalities.en_US
dc.language.isoEnglishen_US
dc.source.titleOperations Researchen_US
dc.relation.isversionofhttp://dx.doi.org/10.1287/opre.1120.1058en_US
dc.subjectBranch-and-cut algorithmsen_US
dc.subjectComputational resultsen_US
dc.subjectExtended formulationsen_US
dc.subjectLot sizingen_US
dc.subjectLot sizing problemsen_US
dc.subjectMulti-commodityen_US
dc.subjectMulti-itemen_US
dc.subjectMultiechelonen_US
dc.subjectPolyhedral studiesen_US
dc.subjectPolynomial-time dynamic programmingen_US
dc.subjectPolynomial-time separation algorithmsen_US
dc.subjectTest problemen_US
dc.subjectValid inequalityen_US
dc.subjectComputer applicationsen_US
dc.subjectOperations researchen_US
dc.subjectAlgorithmsen_US
dc.titleA polyhedral study of multiechelon lot sizing with intermediate demandsen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage918en_US
dc.citation.epage935en_US
dc.citation.volumeNumber60en_US
dc.citation.issueNumber4en_US
dc.identifier.doi10.1287/opre.1120.1058en_US
dc.publisherInstitute for Operations Research and the Management Sciences (I N F O R M S)en_US
dc.identifier.eissn1526-5463


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record