Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/529
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, Zhi-Long-
dc.contributor.authorLi, Shanling-
dc.contributor.authorTirupati, Devanath-
dc.date.accessioned2009-12-12T07:17:06Z-
dc.date.available2009-12-12T07:17:06Z-
dc.date.copyright1999-04-
dc.date.issued2009-12-12T07:17:06Z-
dc.identifier.urihttp://hdl.handle.net/11718/529-
dc.description.abstractIn response to market pressures resulting in increased competition, product proliferation and greater customization, firms in many industries have adopted modern technologies to provide operational flexibility on several dimensions. In this paper, we consider the role of product mix flexibility, defined as the ability to produce a variety of products, in an environment characterized by multiple products, uncertainty in product life cycles and dynamic demands. Using a scenario based approach for capturing the evolution of demand, we develop a stochastic programming model for determining technology choices and capacity plans. Since the resulting model is likely to be large and may not be easy to solve with standard software packages, we develop a solution procedure based on augmented Lagrangian method and restricted simplicial decomposition. The scope of our approach for deriving context specific managerial insights is illustrated by the results of limited computations. Finally, we demonstrate the versatility of our approach by deriving a special case of the general model to address some issues related to new product introduction.en
dc.language.isoenen
dc.relation.ispartofseriesWP;99-04-04/1514-
dc.subjectInformation and communication technologyen
dc.titleScenario based stochastic programming approach for technology and capacity planningen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 1999_1514.pdf2.02 MBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.