IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v66y2018i1p58-76.html
   My bibliography  Save this article

Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation

Author

Listed:
  • Hyun-Soo Ahn

    (Stephen M. Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109)

  • Stefanus Jasin

    (Stephen M. Ross School of Business, University of Michigan, Ann Arbor, Michigan 48109)

  • Philip Kaminsky

    (Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720)

  • Yang Wang

    (Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720)

Abstract

We consider a multiperiod planning problem faced by a biopharmaceutical firm that must coordinate the production and allocation of batches of intermediate products to end products for multiple markets. This is a challenging problem to solve optimally, so we derive a theoretical bound on the performance of a deterministic control (DC) 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 DC can perform poorly in some instances, simple reoptimizations of DC (i.e., certainty equivalent control (CEC)) improve the performance of DC. That said, the benefit of reoptimization decreases as the magnitude of demand variation increases. To address this, and also to provide guidance for heuristic design, we derive performance bounds for two additional heuristic controls—(1) open-loop feedback control (OLFC), which reoptimizes a sequence of stochastic programs with a complete demand distribution information, and (2) multipoint approximation control (MPAC), which solves a dynamic program using an approximate demand distribution that incorporates slightly more distributional information beyond simple expected values. We show that although OLFC outperforms CEC, its improvement can be limited. On the other hand, with carefully chosen approximate demand distributions, MPAC can significantly outperform OLFC. This suggests that, in our setting, fully capturing decision dynamics coupled with a small amount of additional distributional information beyond expected values is more useful than fully capturing the demand distribution but coupling that with insufficient modeling of decision dynamics.

Suggested Citation

  • Hyun-Soo Ahn & Stefanus Jasin & Philip Kaminsky & Yang Wang, 2018. "Analysis of Deterministic Control and Its Improvements for an Inventory Problem with Multiproduct Batch Differentiation," Operations Research, INFORMS, vol. 66(1), pages 58-78, 1-2.
  • Handle: RePEc:inm:oropre:v:66:y:2018:i:1:p:58-76
    DOI: 10.1287/opre.2017.1647
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/opre.2017.1647
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2017.1647?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Guillermo Gallego & Garrett van Ryzin, 1997. "A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management," Operations Research, INFORMS, vol. 45(1), pages 24-41, February.
    2. Arthur F. Veinott, 1965. "The Optimal Inventory Policy for Batch Ordering," Operations Research, INFORMS, vol. 13(3), pages 424-432, June.
    3. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    4. Martin I. Reiman & Qiong Wang, 2008. "An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 257-282, May.
    5. Nicola Secomandi, 2008. "An Analysis of the Control-Algorithm Re-solving Issue in Inventory and Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 468-483, December.
    6. Goodson, Justin C. & Thomas, Barrett W. & Ohlmann, Jeffrey W., 2017. "A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs," European Journal of Operational Research, Elsevier, vol. 258(1), pages 216-229.
    7. Fangruo Chen, 2000. "Optimal Policies for Multi-Echelon Inventory Problems with Batch Ordering," Operations Research, INFORMS, vol. 48(3), pages 376-389, June.
    8. Stefanus Jasin & Sunil Kumar, 2013. "Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management," Operations Research, INFORMS, vol. 61(6), pages 1312-1320, December.
    9. Xiuli Chao & Sean X. Zhou, 2009. "Optimal Policy for a Multiechelon Inventory System with Batch Ordering and Fixed Replenishment Intervals," Operations Research, INFORMS, vol. 57(2), pages 377-390, April.
    10. Forsberg, Rolf, 1997. "Exact evaluation of (R, Q)-policies for two-level inventory systems with Poisson demand," European Journal of Operational Research, Elsevier, vol. 96(1), pages 130-138, January.
    11. Mustafa K. Doğru & Martin I. Reiman & Qiong Wang, 2010. "A Stochastic Programming Based Inventory Policy for Assemble-to-Order Systems with Application to the W Model," Operations Research, INFORMS, vol. 58(4-part-1), pages 849-864, August.
    12. Gregory A. DeCroix & Antonio Arreola-Risa, 1998. "Optimal Production and Inventory Policy for Multiple Products Under Resource Constraints," Management Science, INFORMS, vol. 44(7), pages 950-961, July.
    13. James T. Treharne & Charles R. Sox, 2002. "Adaptive Inventory Control for Nonstationary Demand and Partial Information," Management Science, INFORMS, vol. 48(5), pages 607-624, May.
    14. Gérard P. Cachon, 2001. "Exact Evaluation of Batch-Ordering Inventory Policies in Two-Echelon Supply Chains with Periodic Review," Operations Research, INFORMS, vol. 49(1), pages 79-98, February.
    15. Chen Shaoxiang, 2004. "The Optimality of Hedging Point Policies for Stochastic Two-Product Flexible Manufacturing Systems," Operations Research, INFORMS, vol. 52(2), pages 312-322, April.
    16. Stefanus Jasin & Sunil Kumar, 2012. "A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 313-345, May.
    17. Erica L. Plambeck & Amy R. Ward, 2006. "Optimal Control of a High-Volume Assemble-to-Order System," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 453-477, August.
    18. Dragos Florin Ciocan & Vivek Farias, 2012. "Model Predictive Control for Dynamic Resource Allocation," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 501-525, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yanzhe (Murray) Lei & Stefanus Jasin & Amitabh Sinha, 2018. "Joint Dynamic Pricing and Order Fulfillment for E-commerce Retailers," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 269-284, May.
    2. Suresh P. Sethi & Sushil Gupta & Vipin K. Agrawal & Vijay K. Agrawal, 2022. "Nobel laureates’ contributions to and impacts on operations management," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4283-4303, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yanzhe (Murray) Lei & Stefanus Jasin & Amitabh Sinha, 2018. "Joint Dynamic Pricing and Order Fulfillment for E-commerce Retailers," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 269-284, May.
    2. Stefanus Jasin & Amitabh Sinha, 2015. "An LP-Based Correlated Rounding Scheme for Multi-Item Ecommerce Order Fulfillment," Operations Research, INFORMS, vol. 63(6), pages 1336-1351, December.
    3. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2016. "Real-Time Dynamic Pricing with Minimal and Flexible Price Adjustment," Management Science, INFORMS, vol. 62(8), pages 2437-2455, August.
    4. de Kok, Ton & Grob, Christopher & Laumanns, Marco & Minner, Stefan & Rambau, Jörg & Schade, Konrad, 2018. "A typology and literature review on stochastic multi-echelon inventory models," European Journal of Operational Research, Elsevier, vol. 269(3), pages 955-983.
    5. Pornpawee Bumpensanti & He Wang, 2020. "A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management," Management Science, INFORMS, vol. 66(7), pages 2993-3009, July.
    6. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    7. Stefanus Jasin, 2015. "Performance of an LP-Based Control for Revenue Management with Unknown Demand Parameters," Operations Research, INFORMS, vol. 63(4), pages 909-915, August.
    8. Yanzhe (Murray) Lei & Stefanus Jasin, 2020. "Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements," Operations Research, INFORMS, vol. 68(3), pages 676-685, May.
    9. Yongbo Xiao, 2018. "Dynamic pricing and replenishment: Optimality, bounds, and asymptotics," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(1), pages 3-25, February.
    10. Agrawal, Narendra & Smith, Stephen A., 2019. "Optimal inventory management using retail prepacks," European Journal of Operational Research, Elsevier, vol. 274(2), pages 531-544.
    11. Andre P. Calmon & Florin D. Ciocan & Gonzalo Romero, 2021. "Revenue Management with Repeated Customer Interactions," Management Science, INFORMS, vol. 67(5), pages 2944-2963, May.
    12. Alberto Vera & Siddhartha Banerjee, 2021. "The Bayesian Prophet: A Low-Regret Framework for Online Decision Making," Management Science, INFORMS, vol. 67(3), pages 1368-1391, March.
    13. Alberto Vera & Siddhartha Banerjee & Itai Gurvich, 2021. "Online Allocation and Pricing: Constant Regret via Bellman Inequalities," Operations Research, INFORMS, vol. 69(3), pages 821-840, May.
    14. Yi Yang & Youhua (Frank) Chen & Yun Zhou, 2014. "Coordinating Inventory Control and Pricing Strategies Under Batch Ordering," Operations Research, INFORMS, vol. 62(1), pages 25-37, February.
    15. Dragos Florin Ciocan & Vivek Farias, 2012. "Model Predictive Control for Dynamic Resource Allocation," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 501-525, August.
    16. David A. Goldberg & Martin I. Reiman & Qiong Wang, 2021. "A Survey of Recent Progress in the Asymptotic Analysis of Inventory Systems," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1718-1750, June.
    17. Woonghee Tim Huh & Ganesh Janakiraman, 2012. "Technical Note---On Optimal Policies for Inventory Systems with Batch Ordering," Operations Research, INFORMS, vol. 60(4), pages 797-802, August.
    18. Dragos Florin Ciocan & Krishnamurthy Iyer, 2021. "Tractable Equilibria in Sponsored Search with Endogenous Budgets," Operations Research, INFORMS, vol. 69(1), pages 227-244, January.
    19. Osman Alp & Woonghee Tim Huh & Tarkan Tan, 2014. "Inventory Control with Multiple Setup Costs," Manufacturing & Service Operations Management, INFORMS, vol. 16(1), pages 89-103, February.
    20. Stefanus Jasin & Sunil Kumar, 2013. "Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management," Operations Research, INFORMS, vol. 61(6), pages 1312-1320, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:66:y:2018:i:1:p:58-76. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.