IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v286y2020i1p250-266.html
   My bibliography  Save this article

Single-period stochastic demand fulfillment in customer hierarchies

Author

Listed:
  • Fleischmann, Moritz
  • Kloos, Konstantin
  • Nouri, Maryam
  • Pibernik, Richard

Abstract

To maximize profits, given limited resources, companies commonly divide their overall customer base into different segments and use allocation policies to prioritize the most important segments. Determining the optimal allocations is challenging due to supply lead times and uncertain demand. Another challenge is the multilevel hierarchical structure of the customer segments. In general, available quotas are not determined by a central planner with full visibility of all individual customer segments but rather result from a sequence of allocation steps with an increasing level of granularity. In this paper, we investigate this sequential allocation process. Specifically, we identify crucial information for making allocation decisions in customer hierarchies and propose decentralized methods that lead to near-optimal allocations while respecting the requirements for information aggregation. We evaluate the methods by comparing their information requirements and reflect on the role of information sharing in hierarchical allocation decisions.

Suggested Citation

  • Fleischmann, Moritz & Kloos, Konstantin & Nouri, Maryam & Pibernik, Richard, 2020. "Single-period stochastic demand fulfillment in customer hierarchies," European Journal of Operational Research, Elsevier, vol. 286(1), pages 250-266.
    • Handle: RePEc:eee:ejores:v:286:y:2020:i:1:p:250-266
    DOI: 10.1016/j.ejor.2020.03.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720302447
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dilip Mookherjee, 2006. "Decentralization, Hierarchies, and Incentives: A Mechanism Design Perspective," Journal of Economic Literature, American Economic Association, vol. 44(2), pages 367-390, June.
    2. Chiang, David Ming-Huang & Wu, Andy Wei-Di, 2011. "Discrete-order admission ATP model with joint effect of margin and order size in a MTO environment," International Journal of Production Economics, Elsevier, vol. 133(2), pages 761-775, October.
    3. Van Zandt, Timothy, 2003. "Real-Time Hierarchical Resource Allocation with Quadratic Costs," CEPR Discussion Papers 4022, C.E.P.R. Discussion Papers.
    4. Paul H. Zipkin, 1980. "Simple Ranking Methods for Allocation of One Resource," Management Science, INFORMS, vol. 26(1), pages 34-43, January.
    5. Konstantin Kloos & Richard Pibernik & Benedikt Schulte, 2019. "Allocation planning in sales hierarchies with stochastic demand and service-level targets," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 981-1024, December.
    6. Meyr, Herbert, 2007. "Clustering methods for rationing limited resources," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 49194, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    7. Van Zandt, Timothy, 1995. "Hierarchical computation of the resource allocation problem," European Economic Review, Elsevier, vol. 39(3-4), pages 700-708, April.
    8. Quante, R. & Fleischmann, M. & Meyr, H., 2009. "A Stochastic Dynamic Programming Approach to Revenue Management in a Make-to-Stock Production System," ERIM Report Series Research in Management ERS-2009-015-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    9. Paul H. Zipkin, 1980. "Bounds on the Effect of Aggregating Variables in Linear Programs," Operations Research, INFORMS, vol. 28(2), pages 403-418, April.
    10. Quante, R. & Meyr, H. & Fleischmann, M., 2007. "Revenue Management and Demand Fulfillment: Matching Applications, Models, and Software," ERIM Report Series Research in Management ERS-2007-050-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    11. René Caldentey & Lawrence M. Wein, 2006. "Revenue Management of a Make-to-Stock Queue," Operations Research, INFORMS, vol. 54(5), pages 859-875, October.
    12. Tiemessen, H.G.H. & Fleischmann, M. & van Houtum, G.J. & van Nunen, J.A.E.E. & Pratsini, E., 2013. "Dynamic demand fulfillment in spare parts networks with multiple customer classes," European Journal of Operational Research, Elsevier, vol. 228(2), pages 367-380.
    13. Gössinger, Ralf & Kalkowski, Sonja, 2015. "Robust order promising with anticipated customer response," International Journal of Production Economics, Elsevier, vol. 170(PB), pages 529-542.
    14. Francis de Véricourt & Fikri Karaesmen & Yves Dallery, 2002. "Optimal Stock Allocation for a Capacitated Supply System," Management Science, INFORMS, vol. 48(11), pages 1486-1501, November.
    15. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    16. Vogel, Sebastian & Meyr, Herbert, 2015. "Decentral allocation planning in multi-stage customer hierarchies," European Journal of Operational Research, Elsevier, vol. 246(2), pages 462-470.
    17. Samii, Amir-Behzad & Pibernik, Richard & Yadav, Prashant & Vereecke, Ann, 2012. "Reservation and allocation policies for influenza vaccines," European Journal of Operational Research, Elsevier, vol. 222(3), pages 495-507.
    18. Chotikapanich, Duangkamon, 1993. "A comparison of alternative functional forms for the Lorenz curve," Economics Letters, Elsevier, vol. 41(2), pages 129-138.
    19. Meyr, H., 2009. "Customer Segmentation, Allocation Planning and Order Promising in Make-to-Stock Production," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36061, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    Full references (including those not matched with items on IDEAS)

    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. Konstantin Kloos & Richard Pibernik & Benedikt Schulte, 2019. "Allocation planning in sales hierarchies with stochastic demand and service-level targets," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 981-1024, December.
    2. Ben Ali, M. & D’Amours, S. & Gaudreault, J. & Carle, M-A., 2018. "Configuration and evaluation of an integrated demand management process using a space-filling design and Kriging metamodeling," Operations Research Perspectives, Elsevier, vol. 5(C), pages 45-58.
    3. Vogel, Sebastian & Meyr, Herbert, 2015. "Decentral allocation planning in multi-stage customer hierarchies," European Journal of Operational Research, Elsevier, vol. 246(2), pages 462-470.
    4. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.
    5. Mohammadivojdan, Roshanak & Geunes, Joseph, 2018. "The newsvendor problem with capacitated suppliers and quantity discounts," European Journal of Operational Research, Elsevier, vol. 271(1), pages 109-119.
    6. Seitz, Alexander & Grunow, Martin & Akkerman, Renzo, 2020. "Data driven supply allocation to individual customers considering forecast bias," International Journal of Production Economics, Elsevier, vol. 227(C).
    7. Huang, Boray & Wu, Andy, 2017. "Reduce shortage with self-reservation policy for a manufacturer paying both fixed and variable stockout expenditure," European Journal of Operational Research, Elsevier, vol. 262(3), pages 944-953.
    8. AgralI, Semra & Geunes, Joseph, 2009. "Solving knapsack problems with S-curve return functions," European Journal of Operational Research, Elsevier, vol. 193(2), pages 605-615, March.
    9. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    10. DePaolo, Concetta A. & Rader, David Jr., 2007. "A heuristic algorithm for a chance constrained stochastic program," European Journal of Operational Research, Elsevier, vol. 176(1), pages 27-45, January.
    11. Patriksson, Michael & Strömberg, Christoffer, 2015. "Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies," European Journal of Operational Research, Elsevier, vol. 243(3), pages 703-722.
    12. Kameshwaran, S. & Narahari, Y., 2009. "Nonconvex piecewise linear knapsack problems," European Journal of Operational Research, Elsevier, vol. 192(1), pages 56-68, January.
    13. Zhang, Bin & Hua, Zhongsheng, 2008. "A unified method for a class of convex separable nonlinear knapsack problems," European Journal of Operational Research, Elsevier, vol. 191(1), pages 1-6, November.
    14. Samii, Amir-Behzad, 2016. "Impact of nested inventory allocation policies in a newsvendor setting," International Journal of Production Economics, Elsevier, vol. 181(PA), pages 247-256.
    15. Secil Savasaneril & Ece Sayin, 2017. "Dynamic lead time quotation under responsive inventory and multiple customer classes," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 95-135, January.
    16. Klein, Robert & Koch, Sebastian & Steinhardt, Claudius & Strauss, Arne K., 2020. "A review of revenue management: Recent generalizations and advances in industry applications," European Journal of Operational Research, Elsevier, vol. 284(2), pages 397-412.
    17. Amy R. Ward & Mor Armony, 2013. "Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers," Operations Research, INFORMS, vol. 61(1), pages 228-243, February.
    18. Schulte, Benedikt & Sachs, Anna-Lena, 2020. "The price-setting newsvendor with Poisson demand," European Journal of Operational Research, Elsevier, vol. 283(1), pages 125-137.
    19. Wang, ZuXiang & Smyth, Russell, 2015. "A piecewise method for estimating the Lorenz curve," Economics Letters, Elsevier, vol. 129(C), pages 45-48.
    20. Chotikapanich, Duangkamon & Griffiths, William E, 2002. "Estimating Lorenz Curves Using a Dirichlet Distribution," Journal of Business & Economic Statistics, American Statistical Association, vol. 20(2), pages 290-295, April.

    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:eee:ejores:v:286:y:2020:i:1:p:250-266. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Haili He). General contact details of provider: http://www.elsevier.com/locate/eor .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.