Please use this identifier to cite or link to this item: https://doi.org/10.1080/0740817X.2011.587865
DC FieldValue
dc.titleRobust demand service achievement for the co-production newsvendor
dc.contributor.authorNg, T.S.
dc.contributor.authorFowler, J.
dc.contributor.authorMok, I.
dc.date.accessioned2014-06-17T07:02:26Z
dc.date.available2014-06-17T07:02:26Z
dc.date.issued2012-05-01
dc.identifier.citationNg, T.S., Fowler, J., Mok, I. (2012-05-01). Robust demand service achievement for the co-production newsvendor. IIE Transactions (Institute of Industrial Engineers) 44 (5) : 327-341. ScholarBank@NUS Repository. https://doi.org/10.1080/0740817X.2011.587865
dc.identifier.issn0740817X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/63295
dc.description.abstractThe co-production newsvendor problem is motivated by two-stage production processes that simultaneously yield a set of output products of different grades from the same input stocks. Co-production is a characteristic feature of processes such as semiconductor manufacturing and crude oil distillation. In the first stage, the newsvendor executes the order quantities for the input stocks prior to learning the actual demands and grading fractions of the products. In the second stage, the available production is allocated to satisfy the realized demands. Downward substitution is allowed in the allocation; i.e., demands for lower grades can always be filled by higher grades but not vice versa. The co-production newsvendor seeks to achieve maximum demand service level, subject to resource or budget constraints. This article proposes the use of the aspiration level approach to model the decision problem. Furthermore, it is assumed that only the means and supports of the uncertain demands and grading fractions are available, and the model is extended using robust optimization techniques. The resulting model is a linear program and can be solved very efficiently. Computational tests show that the proposed model performs favorably compared to other stochastic optimization approaches for the same problem. © 2012 "IIE".
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1080/0740817X.2011.587865
dc.sourceScopus
dc.subjectCo-production planning
dc.subjectlinear programming
dc.subjectrobust optimization
dc.typeArticle
dc.contributor.departmentINDUSTRIAL & SYSTEMS ENGINEERING
dc.description.doi10.1080/0740817X.2011.587865
dc.description.sourcetitleIIE Transactions (Institute of Industrial Engineers)
dc.description.volume44
dc.description.issue5
dc.description.page327-341
dc.description.codenIIETD
dc.identifier.isiut000302014800001
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


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