Certainty Equivalent Planning for Multi-Product Batch Differentiation: Analysis and Bounds
dc.contributor.author | Ahn, Hyun-Soon | |
dc.contributor.author | Jasin, Stefanus | |
dc.contributor | Kaminsky, Philip | |
dc.contributor | Wang, Yang | |
dc.date.accessioned | 2016-01-06T15:27:37Z | |
dc.date.available | 2016-01-06T15:27:37Z | |
dc.date.issued | 2015-12 | |
dc.identifier | 1296 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/116386 | |
dc.description.abstract | We consider a multi-period planning problem faced by a firm that must coordinate the production and allocations of batches to end products for multiple markets. Motivated by a problem faced by a biopharmaceutical firm, we model this as a discrete-time inventory planning problem where in each period the firm must decide how many batches to produce and how to differentiate batches to meet demands for different end products. This is a challenging problem to solve optimally, so we derive a theoretical bound on the performance of a Certainty Equivalent (CE) control for this model, in which all random variables are replaced by their expected values and the corresponding deterministic optimization problem is solved. This is a variant of an approach that is widely used in practice. We show that while a CE control can perform very poorly in certain instances, a simple re-optimization of the CE control in each period can substantially improve both the theoretical and computational performance of the heuristic, and we bound the performance of this re-optimization. To address the limitations of CE control and provide guidance for heuristic design, we also derive performance bounds for two additional heuristic controls -- (1) Re-optimized Stochastic Programming (RSP), which utilizes full demand distribution but limits the adaptive nature of decision dynamics, and (2) Multi-Point Approximation (MPA), which uses limited demand information to model uncertainty but fully capture the adaptive nature of decision dynamics. We show that although RSP in general outperforms the re-optimized CE control, the improvement is limited. On the other hand, with a carefully chosen demand approximation in each period, MPA can significantly outperform RSP. This suggests that, in our setting, explicitly capturing decision dynamics adds more value than simply capturing full demand information. | en_US |
dc.subject | certainty equivalant | en_US |
dc.subject | heuristics | en_US |
dc.subject.classification | Operations and Management Science | en_US |
dc.title | Certainty Equivalent Planning for Multi-Product Batch Differentiation: Analysis and Bounds | en_US |
dc.type | Working Paper | en_US |
dc.subject.hlbsecondlevel | Business (General) | en_US |
dc.subject.hlbsecondlevel | Management | en_US |
dc.subject.hlbtoplevel | Business | |
dc.contributor.affiliationum | Ross School of Business | en_US |
dc.contributor.affiliationother | University of California, Berkeley - Department of Industrial Engineering & Operations Research (IEOR) | en_US |
dc.contributor.affiliationother | University of California, Berkeley - Department of Industrial Engineering and Operations Research | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/116386/1/1296_Ahn.pdf | |
dc.owningcollname | Business, Stephen M. Ross School of - Working Papers Series |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.