IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i10p1509-d1392984.html
   My bibliography  Save this article

On the Number of Customer Classes in a Single-Period Inventory System

Author

Listed:
  • Mónica López-Campos

    (Department of Industrial Engineering, Universidad Técnica Federico Santa María, Avenida España 1680, Valparaíso 2390123, Chile)

  • Pablo Escalona

    (Department of Industrial Engineering, Universidad Técnica Federico Santa María, Avenida España 1680, Valparaíso 2390123, Chile)

  • Alejandro Angulo

    (Department of Electrical Engineering, Universidad Técnica Federico Santa María, Avenida España 1680, Valparaíso 2390123, Chile)

  • Francisca Recabarren

    (Department of Industrial Engineering, Universidad Técnica Federico Santa María, Avenida España 1680, Valparaíso 2390123, Chile)

  • Raúl Stegmaier

    (Department of Industrial Engineering, Universidad Técnica Federico Santa María, Avenida España 1680, Valparaíso 2390123, Chile)

Abstract

A common practice in inventory systems with several customers requiring differentiated service levels is to group them into two or three classes, where a customer class is a group of customers with the same preset service level in terms of product availability. However, there is no evidence that grouping customers into two or three classes is optimal in terms of the ordering policy parameters. This paper studies the effect of the number of customer classes on the inventory level of a single-period inventory system with stochastic demand and individual service-level requirements from multiple customer classes. Using a Sample Average Approximation approach, we formulate computationally tractable multi-class service level models, under responsive and anticipative priority policies in cases of shortage, as mixed integer linear problems (MIPs). The effect of the number of classes on the inventory level is determined using a round-up aggregation scheme; i.e., given a sufficiently large initial number of classes, it is reduced by adding the lower service level classes to the next higher class. We analytically characterize the optimal inventory level under responsive and anticipative priority policies as a function of the initial number of classes and the number of classes grouped based on the round-up aggregation scheme. Under a responsive priority policy, we show that there is an optimal number of classes, while under an anticipative priority policy, the optimal number of classes is equal to the initial number of classes. The effect of free-riders resulting from the round-up aggregation scheme on the optimal inventory level is studied through numerical experiments.

Suggested Citation

  • Mónica López-Campos & Pablo Escalona & Alejandro Angulo & Francisca Recabarren & Raúl Stegmaier, 2024. "On the Number of Customer Classes in a Single-Period Inventory System," Mathematics, MDPI, vol. 12(10), pages 1-22, May.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:10:p:1509-:d:1392984
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/10/1509/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/10/1509/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Teunter, Ruud H. & Klein Haneveld, Willem K., 2008. "Dynamic inventory rationing strategies for inventory systems with two demand classes, Poisson demand and backordering," European Journal of Operational Research, Elsevier, vol. 190(1), pages 156-178, October.
    2. B. K. Pagnoncelli & S. Ahmed & A. Shapiro, 2009. "Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 399-416, August.
    3. Chun†Miin (Jimmy) Chen & Douglas J. Thomas, 2018. "Inventory Allocation in the Presence of Service†Level Agreements," Production and Operations Management, Production and Operations Management Society, vol. 27(3), pages 553-577, March.
    4. Benedikt Schulte & Richard Pibernik, 2016. "Service differentiation in a single-period inventory model with numerous customer classes," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 921-948, October.
    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. 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.
    2. Fadaki, Masih & Asadikia, Atie, 2024. "Augmenting Monte Carlo Tree Search for managing service level agreements," International Journal of Production Economics, Elsevier, vol. 271(C).
    3. Hayya, Jack C. & Harrison, Terry P. & He, X. James, 2011. "The impact of stochastic lead time reduction on inventory cost under order crossover," European Journal of Operational Research, Elsevier, vol. 211(2), pages 274-281, June.
    4. Erfan Mohagheghi & Mansour Alramlawi & Aouss Gabash & Pu Li, 2018. "A Survey of Real-Time Optimal Power Flow," Energies, MDPI, vol. 11(11), pages 1-20, November.
    5. Mayorga, Maria E. & Ahn, Hyun-Soo, 2011. "Joint management of capacity and inventory in make-to-stock production systems with multi-class demand," European Journal of Operational Research, Elsevier, vol. 212(2), pages 312-324, July.
    6. van Jaarsveld, W.L. & Dekker, R., 2009. "Finding optimal policies in the (S - 1, S ) lost sales inventory model with multiple demand classes," Econometric Institute Research Papers EI 2009-14, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. P. Escalona & F. Ordóñez & I. Kauak, 2017. "Critical level rationing in inventory systems with continuously distributed demand," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 273-301, January.
    8. Zhuqi Miao & Balabhaskar Balasundaram & Eduardo L. Pasiliao, 2014. "An exact algorithm for the maximum probabilistic clique problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 105-120, July.
    9. Bing Lin & Shaoxiang Chen & Yi Feng & Jianjun Xu, 2018. "The Joint Stock and Capacity Rationings of a Make-To-Stock System with Flexible Demand," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(01), pages 1-27, February.
    10. Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo & Newman, Alexandra, 2024. "A target-time-windows technique for project scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 314(2), pages 792-806.
    11. Alvarez, E.M. & van der Heijden, M.C. & Vliegen, I.M.H. & Zijm, W.H.M., 2014. "Service differentiation through selective lateral transshipments," European Journal of Operational Research, Elsevier, vol. 237(3), pages 824-835.
    12. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    13. G. Pantuso & L. M. Hvattum, 2021. "Maximizing performance with an eye on the finances: a chance-constrained model for football transfer market decisions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 583-611, July.
    14. Pourakbar, Morteza & Dekker, Rommert, 2012. "Customer differentiated end-of-life inventory problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 44-53.
    15. Jianqiang Cheng & Richard Li-Yang Chen & Habib N. Najm & Ali Pinar & Cosmin Safta & Jean-Paul Watson, 2018. "Chance-constrained economic dispatch with renewable energy and storage," Computational Optimization and Applications, Springer, vol. 70(2), pages 479-502, June.
    16. Zhang, Lele & Ding, Pengyuan & Thompson, Russell G., 2023. "A stochastic formulation of the two-echelon vehicle routing and loading bay reservation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    17. Hadi Karimi & Sandra D. Ekşioğlu & Michael Carbajales-Dale, 2021. "A biobjective chance constrained optimization model to evaluate the economic and environmental impacts of biopower supply chains," Annals of Operations Research, Springer, vol. 296(1), pages 95-130, January.
    18. Lu Wang & Vidyadhar Kulkarni & Hanqin Zhang, 2023. "Inventory dispensation and restocking in multiclass inventory systems: A decoupling approach," Production and Operations Management, Production and Operations Management Society, vol. 32(2), pages 469-484, February.
    19. Jiang, Jie & Peng, Shen, 2024. "Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation," European Journal of Operational Research, Elsevier, vol. 313(2), pages 616-627.
    20. Chen, Zhen & Archibald, Thomas W., 2024. "Maximizing the survival probability in a cash flow inventory problem with a joint service level constraint," International Journal of Production Economics, Elsevier, vol. 270(C).

    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:gam:jmathe:v:12:y:2024:i:10:p:1509-:d:1392984. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.