Two-commodity inventory system with retrial demand

被引:19
|
作者
Sivakurnar, B. [1 ]
机构
[1] Madurai Kamaraj Univ, Sch Math, Dept Appl Math & Stat, Madurai 625021, Tamil Nadu, India
关键词
continuous review; two-commodity inventory; retrial demand;
D O I
10.1016/j.ejor.2007.02.036
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper analyzes a two-commodity inventory system under continuous review. The maximum storage capacity for the ith commodity is S-i (i = 1, 2). It is assumed that primary demand for the ith commodity is of unit size and primary demand time points form a Poisson process. The reorder level is fixed as si for the ith commodity and the ordering policy is to place order for Q(i) (= S-i - s(i)) items (i = 1, 2) when both the inventory positions are less than or equal to their respective reorder levels. The lead time is assumed to be exponential. Both the commodities are assumed to be substitutable in the sense that at the time of zero stock of any one commodity, the other one is used to meet the demand. When the inventory position of both commodities are zero, any arriving primary demand enters into an orbit of infinite size. The orbiting demands in the orbit send out signal to compete for their demand which is distributed as exponential. The joint probability distribution for both commodities and the number of demands in the orbit is obtained in the steady state case. Various system performance measures in the steady state are derived. The results are illustrated numerically. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:70 / 83
页数:14
相关论文
共 50 条
  • [41] Two-commodity facility location problem: Exact and approximate solution methods
    Hormozi, AM
    DECISION SCIENCES INSTITUTE, 1997 ANNUAL MEETING, PROCEEDINGS, VOLS 1-3, 1997, : 911 - 913
  • [42] Method of Maximum Two-Commodity Flow Search in a Fuzzy Temporal Graph
    Bozhenyuk, Alexander
    Gerasimenko, Evgeniya
    Rozenberg, Igor
    ADVANCES IN FUZZY LOGIC AND TECHNOLOGY 2017, VOL 1, 2018, 641 : 249 - 260
  • [43] A polynomial time approximation algorithm for the two-commodity splittable flow problem
    Elke Eisenschmidt
    Utz-Uwe Haus
    Mathematical Methods of Operations Research, 2013, 77 : 381 - 391
  • [44] System performance of a two-commodity stochastic-flow network with cost attributes in terms of minimal cuts
    Lin, Yi-Kuei
    APPLIED MATHEMATICS AND COMPUTATION, 2007, 187 (02) : 968 - 976
  • [45] Two-commodity opposite direction network flow formulations for the travelling salesman problem
    Pavlikov, Konstantin
    Petersen, Niels Christian
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2025,
  • [46] Modeling and simulation of an agent-based decentralized two-commodity power market
    Arnheiter, T
    FOURTH INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS, PROCEEDINGS, 2000, : 361 - 362
  • [47] Two-commodity reliability evaluation for a stochastic-flow network with node failure
    Lin, YK
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (13) : 1927 - 1939
  • [48] APPROXIMATE ALGORITHMS FOR TWO-COMMODITY AND TWO-CYCLE COVERING PROBLEMS ON MAXIMUM WITH TWO WEIGHT FUNCTIONS
    Nikolaevich, Glebov Aleksey
    Sergeevna, Lylova Sophya
    Garmazhapovna, Toktokhoeva Surena
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2023, 20 (02): : 923 - 941
  • [49] A two-commodity flow formulation for the capacitated truck-and-trailer routing problem
    Bartolini, E.
    Schneider, M.
    DISCRETE APPLIED MATHEMATICS, 2020, 275 : 3 - 18
  • [50] A perishable inventory system with service facilities and retrial customers
    Manuel, Paul
    Sivakumar, B.
    Arivarignan, G.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (03) : 484 - 501