About this Journal Submit a Manuscript Table of Contents
Modelling and Simulation in Engineering
Volumeย 2012ย (2012), Article IDย 620960, 17 pages
http://dx.doi.org/10.1155/2012/620960
Research Article

A Perishable Inventory System with Postponed Demands and Multiple Server Vacations

Department of Applied Mathematics and Statistics, School of Mathematics, Madurai Kamaraj University, Madurai 625 021, India

Received 27 March 2011; Revised 7 December 2011; Accepted 16 December 2011

Academic Editor: Agostinoย Bruzzone

Copyright ยฉ 2012 R. Jayaraman et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

A mathematical modelling of a continuous review stochastic inventory system with a single server is carried out in this work. We assume that demand time points form a Poisson process. The life time of each item is assumed to have exponential distribution. We assume (๐‘ ,๐‘†) ordering policy to replenish stock with random lead time. The server goes for a vacation of an exponentially distributed duration at the time of stock depletion and may take subsequent vacation depending on the stock position. The customer who arrives during the stock-out period or during the server vacation is offered a choice of joining a pool which is of finite capacity or leaving the system. The demands in the pool are selected one by one by the server only when the inventory level is above ๐‘ , with interval time between any two successive selections distributed as exponential with parameter depending on the number of customers in the pool. The joint probability distribution of the inventory level and the number of customers in the pool is obtained in the steady-state case. Various system performance measures in the steady state are derived, and the long-run total expected cost rate is calculated.

1. Introduction

In most of the inventory models considered in the literature, the demanded items are directly delivered from the stock (if available). The demands occurring during the stock-out period are either lost (lost sales case) or satisfied only after the arrival of ordered items (backlogging). In the latter case, it is assumed that either all (full backlogging) or any prefixed number of demands (partial backlogging) that occurred during the stock-out period are satisfied. The often quoted review articles Nahmias [1] and Raafat [2] and the recent review articles N. H. Shah and Y. K. Shah [3] and Goyal and Giri [4] provide excellent summaries of many of these modelling efforts. For some recent references, see Chakravarthy and Daniel [5], Yadavalli et al. [6], and Kalpakam and Shanthi [7, 8].

In the case of continuous review perishable inventory models with random life times for the items, most of the models assume instantaneous supply of order (Lian and Liu [9], Liu and Shi [10], and Kalpakam and Arivarignan [11], and Gรผrler and ร–zkaya [12]). When a server is assumed to process the demands in continuous review inventory systems, the concept of server vacation was also taken up in some works. Daniel and Ramanarayanan [13] introduced the concept of server vacation in an inventory model with two servers. In [14], they studied an (๐‘ ,๐‘†) inventory system in which the server takes a rest when the level of the inventory is zero. The demands that occurred during stock-out period were lost. The interoccurrence times between two successive demands, the lead times, and the rest times are assumed to follow general distributions, which are mutually independent. Using renewal and convolution techniques, they obtained the steady-state transition probabilities. However, server vacations in Queueing systems have been widely studied in different contexts in the literature. We refer the readers to Doshi [15, 16], Takagi [17, 18], and Tian and Zhang [19] for details on various vacations systems and for additional references.

In the context of inventory system, any arriving demands during the server vacation either enter a pool or leave the system. These pooled customers are selected at a later time, preferably after the stock is replenished. This type of inventory problems is called inventory with postponed demands.

The concept of postponed demands in the inventory model has been introduced by Berman et al. [20]. They assumed that both demand and service rates are deterministic. Krishnamoorthy and Islam [21] considered an inventory system with Poisson demand, exponential lead time and the pooled customers are selected according to an exponentially distributed time lag. Sivakumar and Arivarignan [22] considered an inventory model in which the demand occurs according to a Markovian arrival process, lead time has a phase type distribution, life time for the items in the stock has exponential distribution, and the pooled customers are selected exponentially. Manuel et al. [23] dealt with an inventory system in which the positive and negative demands occur according to an independent Markovian arrival processes, the lead time of the reorder, the life time of the items, the interselection time of customers from the pool and the reneging time points of the customers in the pool are independent, and each has the exponential distribution. In all the above models, the authors assumed that the pool size is finite. Sivakumar and Arivarignan [24] considered an inventory system with independent Markovian arrival processes for positive and negative demands, exponential lead time for the reorders, exponential life times for each item in the stock, and the pool size is infinite.

In earlier works listed above, the server is assumed to be available even during the stock-out periods. In this work, we have introduced the concept of server vacation. It may be noted that this model also includes situations in which the server may not be availing vacation, but the server may attend some other work during the stock-out period and may return at random times to the inventory system. If the stock is still not replenished, the server goes for another vacation again or to attend the other work. Employees who are assigned extra work on additional remuneration basis can also be thought of such servers.

In this paper, we consider a continuous review perishable inventory system. The unit demands occur according to a Poisson process. The (๐‘ ,๐‘†) ordering policy is implemented to replenish stock. When the inventory is completely depleted, the server is assumed to go on a vacation of random duration. At the end of vacation, if the stock is not replenished, the server again starts his/her vacation. The demands that occurred during stock-out period are offered postponement of their demand after the stock is replenished. Those demands that accept the postponement joins a pool of finite capacity. We assume that fraction ๐‘ of demands join the pool and the rest leave the system. The pooled demands are selected once the stock is replenished, and the server resumes service. But the selection from the pool will be stopped if the inventory falls below the reorder level, ๐‘ .

The rest of the paper is organized as follows. In Section 2, we describe the mathematical model of the problem under study. The steady-state analysis of the model is presented in Section 3, and some key system performance measures are derived in Section 4. In Section 5, we calculate the total expected cost rate, and, in the final section, we perform sensitivity analyses on the total expected cost rate in terms of numerical illustrations.

2. Problem Formulation

We consider an inventory system with a maximum stock of ๐‘† unit items. The items are assumed to have identical and independent exponential life-time distributions with parameter ๐›พ(>0). When an item perishes, it is removed from the stock. Another process which removes items from the stock is the demand process. The demand is for single item, and the demand occurrences form a Poisson process with rate ๐œ†(>0). A server processes the unit demands. The stock is replenished by the server by implementing (๐‘ ,๐‘†) ordering policy, where the lead time is assumed to have independent exponential distribution with parameter ๐œ‡(>0). If the stock is depleted before the supply of reorder, the server goes on a vacation duration which has exponential distribution with parameter ๐›ฝ(>0). At the end of a vacation period, if the stock is still empty, the server takes another vacation. The demands that occur during stock-out period are offered postponement at a later time. It is assumed that the demands accept this postponement or leave the system according to a Bernoulli distribution with probability ๐‘. The demand which accepts an offer of postponement may join a pool of finite capacity fixed as ๐‘.

The demands from the pool are selected if the server is on service and the inventory level is above ๐‘  such that the interval time between successive selections is exponentially distributed with parameter ๐›ผ๐‘›(>0) where ๐‘› is the number of customers in the pool.

Notation.๐ž: a column vector of appropriate dimension containing all ones.๐ŸŽ: a zero matrix of appropriate dimension.๐ŸŽ(๐‘–ร—๐‘—): a zero matrix with ๐‘– rows and ๐‘— columns.

3. Analysis

Let ๐‘‹(๐‘ก)and๐ฟ(๐‘ก), respectively, denote the number of demands in the pool and the on-hand inventory level at time ๐‘ก. We define a binary variable ๐‘Œ(๐‘ก) (which takes 0and1) to denote the status of the server, respectively, โ€œon vacationโ€™โ€™ and โ€œon service.โ€™โ€™ Similarly, the binary variable ๐‘(๐‘ก) will indicate the status of the reorder to replenish the stock: ๐‘(๐‘ก)=0or1, respectively, ifโ€‰โ€‰ โ€œno order is pendingโ€™โ€™ or โ€œan order is pending.โ€™โ€™

The values taken by these random variables are listed in the following.620960.equation.001(1)

We consider the stochastic process {๐‘‹(๐‘ก),๐‘Œ(๐‘ก),๐‘(๐‘ก),๐ฟ(๐‘ก),๐‘กโ‰ฅ0}. Since the components carry sufficient information on the sample path of the process and from the assumptions made on the input and output processes, this process can easily be seen to be a Markov process.

The state space of the stochastic process {๐‘‹(๐‘ก),๐‘Œ(๐‘ก),๐‘(๐‘ก),๐ฟ(๐‘ก),๐‘กโ‰ฅ0} is the collection of all quadruples โŸจ๐‘–1โŸฉ=(๐‘–1,๐‘–2,๐‘–3,๐‘–4) where each entry is selected from each column as we move from left to right; we may cross vertical lines but not horizontal ones. These quadruples can be ordered in the lexicographic order in each box separated by the horizontal lines.

We shall write the transition rate matrix in a block-partitioned form where ๐‘–1th row (block) corresponds to the collection of quadruples โŸจ๐‘–1โŸฉ (those with leftmost entry ๐‘–1), ๐‘–1=0,1,2,โ€ฆ,๐‘. It may be recalled that the pool size (๐‘–1) may increase or decrease by one unit (except the end states) when a demand joins or leaves the pool. Hence, the transition rate matrix is a tridiagonal one.

We also note that when the number of demands in the pool is ๐‘–(๐‘–=0,1,2,โ€ฆ,๐‘โˆ’1), a new demand joining the pool will shift the current set of quadruple โŸจ๐‘–โŸฉ to โŸจ๐‘–+1โŸฉ and the transition rate does not depend upon ๐‘–. Therefore, all the entries in the upper diagonal of the rate matrix are equal to a constant block matrix, which we shall denote by ๐ต0. The lower diagonal entries correspond to the transition from states of โŸจ๐‘–โŸฉ,๐‘–=1,2,โ€ฆ,๐‘, to states โŸจ๐‘–โˆ’1โŸฉ. This is due to the selection of a demand from the pool, and the rate of selection of any one of the demands is ๐›ผ๐‘–. Hence, these transition rates depend on row indices. Therefore, the entries of the lower diagonal depend on the row index. We shall denote them by ๐ถ๐‘–. In the case of diagonal entries, again, the transition rate may depend upon the pool size (row index), if it involves selection of a demand from the pool. Hence, the entries here also depend upon the respective row index. We shall denote them by ๐ด๐‘–.

Hence, the infinitesimal generator matrix can be written as012โ‹ฎ๐‘โŽ›โŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽ๐ด0123โ‹ฏ๐‘โˆ’2๐‘โˆ’1๐‘๐‘โˆ’2๐‘โˆ’10๐ต0๐ถ00โ‹ฏโ‹ฏ001๐ด1๐ต00โ‹ฏโ‹ฏ000๐ถ2๐ด2๐ต0โ‹ฏโ‹ฏ00โ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฏโ‹ฏโ‹ฏโ‹ฏโ‹ฏ๐ด๐‘โˆ’2๐ต0โ‹ฏโ‹ฏโ‹ฏโ‹ฏโ‹ฏโ‹ฏ๐ถ๐‘โˆ’1๐ด๐‘โˆ’1๐ต0โ‹ฏโ‹ฏโ‹ฏโ‹ฏโ‹ฏ0๐ถ๐‘๐ด๐‘โŽžโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽ .(2) We shall determine the submatrix ๐ต0, the elements of which correspond to the transitions from โŸจ๐‘–โŸฉtoโŸจ๐‘–+1โŸฉ,๐‘–=0,1,2,โ€ฆ,๐‘โˆ’1. This corresponds to the case that one demand has joined the pool. In a Markov process, at most one event can occur in a small interval. Hence, for the transitions from (๐‘–1,๐‘–2,๐‘–3,๐‘–4)to(๐‘–1+1,๐‘–๎…ž2,๐‘–๎…ž3,๐‘–๎…ž4), we have 0 when ๐‘–๎…ž2โ‰ ๐‘–2,๐‘–๎…ž3โ‰ ๐‘–3,๐‘–๎…ž4โ‰ ๐‘–4 and ๐‘๐œ† when they are equal and ๐‘–2=0. The matrix ๐ต0 is given by620960.equation.002(3)

Next, we consider the submatrix ๐ถ๐‘–, the elements of which give the transitions from โŸจ๐‘–โŸฉ to โŸจ๐‘–โˆ’1โŸฉ. This corresponds to the event that a demand from the pool is selected, and this indicates that the server is โ€œon serviceโ€™โ€™ and that โ€œ no order is pending.โ€™โ€™ Therefore, possible value is ๐‘–๎…ž2=๐‘–2=1. As a result of a selection from the pool, an item from the inventory is used to meet this demand. Hence, ๐ฟ(๐‘ก) moves from ๐‘–4 to ๐‘–4โˆ’1,if๐‘–4=๐‘ +2,๐‘ +3,โ€ฆ,๐‘† (with ๐‘–๎…ž3=0) and from ๐‘ +1 to ๐‘  (with ๐‘–๎…ž3=1). Hence, the submatrix ๐ถ๐‘–,๐‘–=1,2,โ€ฆ,๐‘, is given by620960.equation.003(4)

where ๐ถ0(๐‘–)=โŽ›โŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽ๐›ผ00โ‹ฏ00๐‘–0โ‹ฏ000๐›ผ๐‘–โ‹ฏ00โ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎ00โ‹ฏ๐›ผ๐‘–0โŽžโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽ ,๐ถ1(๐‘–)=โŽ›โŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽ00โ‹ฏ0๐›ผ๐‘–โŽžโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽ .00โ‹ฏ0000โ‹ฏ00โ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎ00โ‹ฏ00(5)

Let us consider the submatrix ๐ด๐‘–,๐‘–=1,2,โ€ฆ,๐‘. In this case, there is no addition to nor selection from the pool. Firstly, we note the transitions(i)from (๐‘–1,0,1,๐‘–4) to (๐‘–1,1,0,๐‘–4)or(๐‘–1,1,1,๐‘–4),(ii)from (๐‘–1,1,0,๐‘–4) to (๐‘–1,0,0,๐‘–4)or(๐‘–1,0,1,๐‘–4),(iii)from (๐‘–1,1,1,๐‘–4) to (๐‘–1,0,0,๐‘–4),

as these involve more than one occurrence.

Secondly, we observe that, only in the case of diagonal entries ๐‘Ž((๐‘–1,1,0,๐‘–4),(๐‘–1,1,0,๐‘–4)) (i.e., the intensity of passage), the rate ๐›ผ๐‘– (the rate of selection from the pool) will appear.

Hence, the block-partitioned submatrix ๐ด๐‘– will have the following structure:620960.equation.004(6)

The following cases are pertaining to the event that the server is on vacation before and after the transition.(i)In the case of column vector ๐‘Ž01, the reorder status changes from โ€œno order is pendingโ€™โ€™ to โ€œan order is pending.โ€™โ€™ Thus, ๐‘–4=0 and, after transition, ๐‘–๎…ž4=0. No transition is possible from other states ๐‘–4=1,2,โ€ฆ,๐‘„. Thus, we obtain ๐‘Ž01=(๐›ฝ,0,โ€ฆ,0)๎…ž.(7)(ii)The row vector ๐‘Ž10 considers the change of reorder status (from โ€œorder is pendingโ€™โ€™ to โ€œno order is pendingโ€™โ€™). Thus, a supply of ๐‘„ items is received. This changes ๐‘–2=0,๐‘–3=0,๐‘–4=0 to ๐‘–๎…ž2=0,๐‘–๎…ž3=1,๐‘–๎…ž4=๐‘„. Hence, ๐‘Ž10=(0,0,โ€ฆ,0,๐œ‡).(8)(iii)The constant ๐‘Ž11 is a diagonal entry, and, considering all transitions from (๐‘–1,0,1,0) to other states, we get ๐‘Ž11=๎‚ปโˆ’(๐‘๐œ†+๐œ‡)if๐‘–1=1,2,โ€ฆ,๐‘โˆ’1,โˆ’๐œ‡if๐‘–1=๐‘,(9) or simply ๐‘Ž11=โˆ’(๐‘๐œ†๐›ฟ๐‘–1๐‘+๐œ‡), where ๐›ฟ๐‘–1๐‘=1โˆ’๐›ฟ๐‘–1๐‘.(iv)The nondiagonal entry of ๐ด00, namely,๐‘Ž((๐‘–1,0,0,๐‘–4),(๐‘–1,0,0,๐‘–๎…ž4)) is equal to ๐‘–4๐›พ for ๐‘–๎…ž4=๐‘–4โˆ’1 and zero for other nondiagonal elements. For the diagonal entry (considering the transitions to other states), we get ๎€บ๐ด00๎€ป๐‘–4,๐‘–4=๎‚ปโˆ’๎€ท๐‘๐œ†+๐›ฝ+๐‘–4๐›พ๎€ธif๐‘–4=1,2,โ€ฆ,๐‘„,๐‘–1โˆ’๎€ทโ‰ ๐‘,๐›ฝ+๐‘–4๐›พ๎€ธif๐‘–4=1,2,โ€ฆ,๐‘„,๐‘–1=๐‘,(10) or, simply, โˆ’(๐‘๐œ†๐›ฟ๐‘–1๐‘+๐›ฝ+๐‘–4๐›พ)if๐‘–4=1,2,โ€ฆ,๐‘„, for all๐‘–1.

Using arguments similar to the above, we can express the matrix ๐ด๐‘–,๐‘–=1,2,โ€ฆ,๐‘ as follows:620960.equation.005(11)

where(i)๐‘ข๎…ž๐‘˜=(0,0,โ€ฆ,1,โ€ฆ,0,0) a vector having 1 at ๐‘˜th place and 0 at other places,(ii)๐ท(๐‘–)00=012โ‹ฎ๐‘„โŽ›โŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽโŽžโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽ 01โ‹ฏ๐‘„โˆ’1๐‘„๐‘„โˆ’1โˆ’(๐‘๐œ†+๐›ฝ)0โ‹ฏ00๐›พโˆ’(๐‘๐œ†+๐›พ+๐›ฝ)โ‹ฏ0002๐›พโ‹ฏ00โ‹ฎโ‹ฎโ‹ฑโ‹ฎโ‹ฎ00โ‹ฏโˆ’(๐‘๐œ†+(๐‘„โˆ’1)๐›พ+๐›ฝ)000โ‹ฏ๐‘„๐›พโˆ’(๐‘๐œ†+๐‘„๐›พ+๐›ฝ),(12)(iii)๐น00=01โ‹ฎโ‹ฎ๐‘„โŽ›โŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽโŽžโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽ ๐‘ +1๐‘ +2โ‹ฏ๐‘„๐‘„+1โ‹ฏ๐‘†๐‘ +1๐‘ +200โ‹ฏ00โ‹ฏ000โ‹ฏ00โ‹ฏ0โ‹ฎโ‹ฎโ‹ฑโ‹ฎโ‹ฎโ‹ฑโ‹ฎ๐›ฝ0โ‹ฏ00โ‹ฏ00๐›ฝโ‹ฏ00โ‹ฏ0โ‹ฎโ‹ฎโ‹ฑโ‹ฎโ‹ฎโ‹ฑโ‹ฎ00โ‹ฏ๐›ฝ0โ‹ฏ0,(13)(iv)๐น01=01โ‹ฎ๐‘ โ‹ฎ๐‘„โŽ›โŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽโŽžโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽ 12โ‹ฏ๐‘ โˆ’1๐‘ ๐‘ โˆ’100โ‹ฏ00๐›ฝ0โ‹ฏ00โ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎ00โ‹ฏ๐›ฝ000โ‹ฏ0๐›ฝโ‹ฎโ‹ฎโ‹ฑโ‹ฎโ‹ฎ00โ‹ฏ00,(14)(v)๐ป(๐‘–)00=โ‹ฎโ‹ฎ๐‘†โŽ›โŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽœโŽโˆ’๎€ท๐‘ +1๐‘ +2โ‹ฏ๐‘†โˆ’1๐‘†๐‘ +1๐‘ +2๐œ†+(๐‘ +1)๐›พ+๐›ผ๐‘–๎€ธ๎€ท0โ‹ฏ00๐œ†+(๐‘ +2)๐›พโˆ’๐œ†+(๐‘ +2)๐›พ+๐›ผ๐‘–๎€ธ๎€ทโ‹ฏ00โ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎ00โ‹ฏ๐œ†+๐‘†๐›พโˆ’๐œ†+๐‘†๐›พ+๐›ผ๐‘–๎€ธโŽžโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽ ,(15)(vi)๐ป01=โ‹ฎ๐‘†โŽ›โŽœโŽœโŽœโŽœโŽœโŽœโŽโŽžโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽ 12โ‹ฏ๐‘ โˆ’1๐‘ ๐‘ +1๐‘ +200โ‹ฏ0๐œ†+(๐‘ +1)๐›พ00โ‹ฏ00โ‹ฎโ‹ฎโ‹ฏโ‹ฎโ‹ฎ00โ‹ฏ00,(16)(vii)๐ป10=1โ‹ฎ๐‘ โŽ›โŽœโŽœโŽœโŽœโŽโŽžโŽŸโŽŸโŽŸโŽŸโŽ ๐‘ +1โ‹ฏ๐‘„๐‘„+1โ‹ฏ๐‘†0โ‹ฏ0๐œ‡โ‹ฏ0โ‹ฎโ‹ฑโ‹ฏโ‹ฎโ‹ฑโ‹ฎ0โ‹ฏ00โ‹ฏ๐œ‡,(17)(viii)๐ป11=12โ‹ฎ๐‘ โŽ›โŽœโŽœโŽœโŽœโŽœโŽœโŽโŽžโŽŸโŽŸโŽŸโŽŸโŽŸโŽŸโŽ 12โ‹ฏ๐‘ โˆ’1๐‘ โˆ’(๐œ†+๐›พ+๐œ‡)0โ‹ฏ00๐œ†+2๐›พโˆ’(๐œ†+2๐›พ+๐œ‡)โ‹ฏ00โ‹ฎโ‹ฎโ‹ฎโ‹ฎโ‹ฎ00โ‹ฏ๐œ†+๐‘ ๐›พโˆ’(๐œ†+๐‘ ๐›พ+๐œ‡).(18)

4. Steady-State Analysis

It can be seen from the structure of the infinitesimal generator ๐ด that the time-homogeneous Markov process {(๐‘‹(๐‘ก),๐‘Œ(๐‘ก),๐‘(๐‘ก),๐ฟ(๐‘ก));๐‘กโ‰ฅ0} on the finite state space ๐ธ is irreducible. Hence, the limiting distribution๐œ™(๐‘—1,๐‘—2,๐‘—3,๐‘—4)=lim๐‘กโ†’โˆž๎€บ๐‘‹Pr(๐‘ก)=๐‘—1,๐‘Œ(๐‘ก)=๐‘—2,๐‘(๐‘ก)=๐‘—3,๐ฟ(๐‘ก)=๐‘—4]โˆฃ๐‘‹(0),๐‘Œ(0),๐‘(0),๐ฟ(0)(19) exists. Let๐œ™(๐‘–1)=๎€ท๐œ™(๐‘–1,0,0,0),๐œ™(๐‘–1,0,0,1),โ€ฆ,๐œ™(๐‘–1,0,0,๐‘„),๐œ™(๐‘–1,0,1,0),๐œ™(๐‘–1,1,0,๐‘ +1),๐œ™(๐‘–1,1,0,๐‘ +2),โ€ฆ,๐œ™(๐‘–1,1,0,๐‘†),๐œ™(๐‘–1,1,0,๐‘ +1),๐œ™(๐‘–1,1,0,๐‘ +2),โ€ฆ,๐œ™(๐‘–1,1,0,๐‘†)๎€ธ,๐œ™(๐‘–1,1,1,1),๐œ™(๐‘–1,1,1,2),โ€ฆ,๐œ™(๐‘–1,1,1,๐‘ ),๎€ท๐œ™ฮฆ=(0),๐œ™(1),โ€ฆ,๐œ™(๐‘)๎€ธ.(20) Then, the vector of limiting probabilities ฮฆ satisfiesฮฆ๐ด=๐ŸŽ,ฮฆ๐ž=1.(21)

From the structure of ๐ด, it is seen that the Markov process under study falls into the class of birth and death process in a Markovian environment as discussed by Gaver et al. [25]. Hence, using the same arguments, we can calculate the limiting probability vectors. For the sake of completeness, we provide the algorithm here.

Algorithm. (1) Determine recursively the matrices ๐น0=๐ด0,๐น๐‘–1=๐ด๐‘–1+๐ถ๐‘–1๎‚€โˆ’๐น๐‘–โˆ’11โˆ’1๎‚๐ต0,๐‘–1=1,2,โ€ฆ,๐‘.(22)

(2) Compute recursively the vectors ๐œ™(๐‘–1) using ๐œ™(๐‘–1)=๐œ™(๐‘–1+1)๐ถ๐‘–1+1๎‚€โˆ’๐น๐‘–โˆ’11๎‚,๐‘–1=๐‘โˆ’1,๐‘โˆ’2,โ€ฆ,0.(23)
(3) Solve the system of equations ๐œ™(๐‘)๐น๐‘=๐ŸŽ,(24)๐‘๎“๐‘–1=0๐œ™(๐‘–1)๐ž=1.(25) From the system of (24), vector ๐œ™(๐‘) could be determined uniquely, up to a multiplicative constant. This constant is obtained by using (23) and (25).

5. System Performance Measures

In this section, we give some system performance measures, which are useful in the qualitative interpretation of the model under study.

5.1. Expected Inventory Level

Let ๐œ‚๐ผ denote the mean inventory level in the steady-state. Since ๐œ™(๐‘–,๐‘˜,๐‘,๐‘š) denotes the steady state probability when the number of demands in the pool is ๐‘–, the server status is ๐‘˜, the status of reorder is ๐‘, and the inventory level is ๐‘š, the mean inventory level is given by๐œ‚๐ผ=๐‘๎“๐‘–=0๎ƒฉ๐‘„๎“๐‘š=1๐‘š๐œ™(๐‘–,0,0,๐‘š)+๐‘†๎“๐‘š=๐‘ +1๐‘š๐œ™(๐‘–,1,0,๐‘š)+๐‘ ๎“๐‘š=1๐‘š๐œ™(๐‘–,1,1,๐‘š)๎ƒช.(26)

5.2. Expected Reorder Rate

Let ๐œ‚๐‘… denote the expected reorder rate in the steady state. We note that a reorder is triggered(i)when the inventory level drops from ๐‘ +1 to ๐‘  if the server is in service or(ii)when the server returns from the vacation, he/she finds the inventory level less than or equal to ๐‘  and there is no order pending.

This leads to๐œ‚๐‘…=๐‘๎“๐‘–=0๐œ™(๐‘–,1,0,๐‘ +1)๎‚€๐œ†+(๐‘ +1)๐›พ+๐›ฟ๐‘–0๐›ผ๐‘–๎‚+๐‘๎“๐‘ ๐‘–=0๎“๐‘š=0๐›ฝ๐œ™(๐‘–,0,0,๐‘š),(27) where ๐›ฟ๐‘–๐‘— is the Kronecker delta function.

5.3. Expected Perishable Rate

Let ๐œ‚PR denote the expected reorder Perishable in the steady state. This is given by๐œ‚PR=๐‘๎“๐‘–=0๎ƒฉ๐‘„๎“๐‘š=1๐‘š๐›พ๐œ™(๐‘–,0,0,๐‘š)+๐‘†๎“๐‘š=๐‘ +1๐‘š๐›พ๐œ™(๐‘–,1,0,๐‘š)+๐‘ ๎“๐‘š=1๐‘š๐›พ๐œ™(๐‘–,1,1,๐‘š)๎ƒช.(28)

5.4. Mean Shortage Rate

Let ๐œ‚SR denote the mean shortage rate in the steady state. It may be noted that a shortage occurs only during the server vacation. The customers who arrive during server vacation prefer to leave the system either by their own choice or the pool has reached its maximum capacity:๐œ‚SR=๐‘โˆ’1๎“๐‘–=0๎ƒฌ๐‘ž๐œ†๐‘„๎“๐‘š=0๐œ™(๐‘–,0,0,๐‘š)+๐œ™(๐‘–,0,1,0)๎ƒญ๎ƒฌ+๐œ†๐‘„๎“๐‘š=0๐œ™(๐‘,0,0,๐‘š)+๐œ™(๐‘,0,1,0)๎ƒญ.(29)

5.5. Expected Number of Customers in the Pool

Let ๐œ‚๐‘ƒ denote the expected number of customers in the pool in the steady state. Since ๐œ™(๐‘–) is the steady state probability vector for ๐‘– customers in the pool with each component specifying the probability for the particular combination of the status of the server, status of the reorder, and the inventory level, the expected number of customers in the pool is given by๐œ‚๐‘ƒ=๐‘๎“๐‘–=1๐‘–๐œ™(๐‘–)๐ž.(30)

5.6. Fraction of Time When the Server is on Vacation

Let ๐œ‚๐น denote the fraction of time when the server is on vacation. This is given by๐œ‚๐น=๐‘๎“๐‘„๐‘–=0๎“๐‘š=0๐œ™(๐‘–,0,0,๐‘š)+๐‘๎“๐‘–=0๐œ™(๐‘–,0,1,0).(31)

6. Cost Analysis

The expected total cost per unit time (expected total cost rate) in the steady state for this model is defined to beTC(๐‘ ,๐‘†,๐‘)=๐‘โ„Ž๐œ‚๐ผ+๐‘๐‘๐œ‚๐‘ƒ+๐‘pr๐œ‚PR+๐‘๐‘ ๐œ‚๐‘…+๐‘sh๐œ‚SR,(32) where๐‘๐‘ : setup cost per order,๐‘โ„Ž: the inventory carrying cost per unit item per unit time,๐‘๐‘: cost of a waiting customer in the pool per unit time, ๐‘pr: perishable cost per unit item per unit time,๐‘sh: cost per customer lost per unit time.

Hence, we get TC(๐‘ ,๐‘†,๐‘)=๐‘โ„Ž๎ƒฏ๐‘๎“๐‘–=0๎ƒฉ๐‘„๎“๐‘š=1๐‘š๐œ™(๐‘–,0,0,๐‘š)+๐‘†๎“๐‘š=๐‘ +1๐‘š๐œ™(๐‘–,1,0,๐‘š)+๐‘ ๎“๐‘š=1๐‘š๐œ™(๐‘–,1,1,๐‘š)๎ƒช๎ƒฐ+๐‘๐‘๎ƒฏ๐‘๎“๐‘–=1๐‘–๐œ™(๐‘–)๐ž๎ƒฐ+๐‘๐‘ ๎ƒฏ๐‘๎“๐‘–=0๐œ™(๐‘–,1,0,๐‘ +1)๎‚€๐œ†+(๐‘ +1)๐›พ+๐›ฟ๐‘–0๐›ผ๐‘–๎‚+๐‘๎“๐‘ ๐‘–=0๎“๐‘š=0๐›ฝ๐œ™(๐‘–,0,0,๐‘š)๎ƒฐ+๐‘pr๎ƒฏ๐‘๎“๐‘–=0๎ƒฉ๐‘„๎“๐‘š=0๐‘š๐›พ๐œ™(๐‘–,0,0,๐‘š)+๐‘†๎“๐‘š=๐‘ +1๐‘š๐›พ๐œ™(๐‘–,1,0,๐‘š)+๐‘ ๎“๐‘š=1๐‘š๐›พ๐œ™(๐‘–,1,1,๐‘š)๎ƒช๎ƒฐ+๐‘sh๎ƒฏ๐‘โˆ’1๎“๐‘–=0๎ƒฌ๐‘ž๐œ†๐‘„๎“๐‘š=0๐œ™(๐‘–,0,0,๐‘š)+๐œ™(๐‘–,0,1,0)๎ƒญ๎ƒฌ+๐œ†๐‘„๎“๐‘š=0๐œ™(๐‘,0,0,๐‘š)+๐œ™(๐‘,0,1,0).๎ƒญ๎ƒฐ(33) Due to the complex form of the limiting distribution, it is difficult to discuss the properties of the cost function TC(๐‘ ,๐‘†,๐‘) analytically. Hence, a detailed computational study of the expected cost function is carried out in the next section.

7. Numerical Illustrations

To study the behaviour of the model developed in this work, several examples were performed and a set of representative results is shown here. Although we have not shown the convexity of TC(๐‘ ,๐‘†,๐‘) analytically, our experience with considerable numerical examples indicates the function TC(๐‘ ,๐‘†,๐‘) to be convex. In some cases, it turned out to be an increasing function of ๐‘ , and we use simple numerical search procedure to get the optimal values of TC,๐‘ ,๐‘† and ๐‘ (say TCโˆ—,๐‘ โˆ—,๐‘†โˆ—, and ๐‘โˆ—). A typical three-dimensional plot of the expected cost function is given in Figure 1. The optimal cost value TCโˆ—=37.352776 is obtained at (๐‘ โˆ—,๐‘†โˆ—,๐‘โˆ—)=(11,63,11).

620960.fig.001
Figure 1: A three-dimensional plot of the cost function.๐œ†=14, โ€‰โ€‰๐œ‡=4, โ€‰โ€‰๐›พ=1.2, โ€‰โ€‰๐›ฝ=1.3, โ€‰โ€‰๐›ผ๐‘–=๐‘–โˆ—๐›ผ, โ€‰โ€‰๐‘–=1,2,โ€ฆ,๐‘, โ€‰โ€‰๐›ผ=4, โ€‰โ€‰๐‘=0.85, โ€‰โ€‰๐‘โ„Ž=0.3, โ€‰โ€‰๐‘๐‘ =15, โ€‰โ€‰๐‘pr=0.3, โ€‰โ€‰๐‘sh=5,๐‘๐‘=3.

We have studied the effect of varying the system parameters and costs on the optimal values, and the results agreed with what one would expect. Some of our results are presented in Tables 1 through 20 where the upper entries in each cell give the ๐‘ โˆ—,๐‘†โˆ—, and ๐‘โˆ—, respectively, and the lower entry gives the corresponding TCโˆ—.

tab1
Table 1: Optimal values corresponding to various demand rates and the replenishment rates(๐›พ=1.4,๐›ฝ=1.3,๐›ผ=4,๐‘=0.85).
tab2
Table 2: Optimal values corresponding to various demand rates and perishable rate (๐›ฝ=1.3,๐›ผ=4,๐œ‡=4,๐‘=0.85).
tab3
Table 3: Optimal values corresponding to various demand rates and the vacation time rates(๐›พ=1.4,๐›ผ=4,๐œ‡=4,๐‘=0.85).
tab4
Table 4: Effect of primary and postponed demand rates on the optimal values(๐›พ=1.4,๐›ฝ=1.3,๐œ‡=4,๐‘=0.85).
tab5
Table 5: Optimal values corresponding to various perishable rates and the replenishment rates (๐œ†=14,๐›ฝ=1.3,๐›ผ=4,๐‘=0.85).
tab6
Table 6: Influence of the postponed demand rate and replenishment rate on the optimal values(๐œ†=14,๐›พ=1.4,๐›ฝ=1.3,๐‘=0.85).
tab7
Table 7: Influence of the vacation time rate and the replenishment rate on the optimal values(๐œ†=14,๐›พ=1.4,๐›ผ=4,๐‘=0.85).
tab8
Table 8: Optimal values corresponding to various perishable rates and vacation time rates (๐œ†=14,๐›ผ=4,๐œ‡=4,๐‘=0.85).
tab9
Table 9: Influence of the postponed demand rate and vacation time rate on the optimal values(๐œ†=14,๐›พ=1.4,๐œ‡=4,๐‘=0.85).

Example 1. In the first example, we study the impact of the demand rate ๐œ†, the lead time rate ๐œ‡, the perishable rate ๐›พ, the selection rate ๐›ผ๐‘–, and the vacation time parameter ๐›ฝ on the optimal values ๐‘ โˆ—,๐‘†โˆ—,๐‘โˆ—, and TCโˆ—. Towards this end, we first fix ๐›ผ๐‘–=๐‘–๐›ผ,๐‘–=1,2,โ€ฆ,๐‘, and the cost values as ๐‘โ„Ž=0.3,๐‘๐‘ =15,๐‘pr=0.3,๐‘sh=5, and ๐‘๐‘=3. We observe the following from Table 1 to 10.(1)The optimal values ๐‘ โˆ—,๐‘†โˆ—, and TCโˆ— increase monotonically with increase in ๐œ†. This is to be expected since, when the arrivals occurs closer and closer, the optimal reorder level and the maximum inventory level increase to prevent more waiting time of the demands in the pool. We also note that, as ๐œ† increases, ๐‘โˆ— increases except for the case in which ๐›พ increases.(2)As is to be expected, the optimal cost rate TCโˆ— decreases monotonically, when ๐œ‡,๐›ผ, and ๐›ฝ increase and monotonically increases when ๐›พ increases.(3)When ๐œ‡ increases, ๐‘ โˆ— and ๐‘†โˆ— decrease and ๐‘โˆ— increases. This can be explained intuitively as follows. If the replenishments occur further and further apart, the inventory level becomes zero frequently. During the stock-out period, a part of arriving demands enter into the pool. To prevent the loss of demand, we have necessity to increase the pool size. For the same reason as ๐›ฝ increases, ๐‘ โˆ— and ๐‘†โˆ— decrease and ๐‘โˆ— increases.(4)We note that, as ๐›พ increases, ๐‘ โˆ— and ๐‘โˆ— decrease monotonically. We also note that except for the combination of increasing ๐›พ, ๐‘†โˆ— decreases when ๐›ผ increases.(5)As ๐›ผ increases, ๐‘โˆ— increases and ๐‘ โˆ— decreases. We also note that, except for the combination of increasing ๐œ‡, ๐‘†โˆ— increases when ๐›ผ increases.

tab10
Table 10: Optimal values corresponding to various perishable rates and postponed demand rates (๐œ†=14,๐›ฝ=1.3,๐œ‡=4,๐‘=0.85).

Example 2. In this example, we study the impact of the setup cost ๐‘๐‘ , holding cost ๐‘โ„Ž, perishable cost ๐‘pr, shortage cost ๐‘sh, and the waiting cost ๐‘๐‘ on the optimal values ๐‘ โˆ—,๐‘†โˆ—,๐‘โˆ—, and TCโˆ—. Towards this end, we first fix the parameter values as ๐œ†=14,๐›พ=1.4,๐›ฝ=1.3,๐›ผ๐‘–=๐‘–๐›ผ,๐‘–=1,2,โ€ฆ,๐‘,๐›ผ=4,๐œ‡=4, and ๐‘=0.85. We observe the following from Table 11 to 20:(1)The optimal cost increases, when ๐‘โ„Ž,๐‘๐‘ ,๐‘pr,๐‘sh, and ๐‘๐‘ increase. The optimal cost is more sensitive to ๐‘โ„Ž than to ๐‘๐‘ ,๐‘pr,๐‘sh, and ๐‘๐‘.(2)As ๐‘โ„Ž increases, as is to be expected, the optimal values ๐‘ โˆ—,๐‘†โˆ—, and ๐‘โˆ— decrease monotonically. This is to be expected since the holding cost increases, we resort to maintain low stock in the inventory.(3)When ๐‘sh increases, as is to be expected, the optimal values ๐‘ โˆ—,๐‘†โˆ—, and ๐‘โˆ— increase monotonically. This is to be expected since for the high shortage cost to reduce the number of customer to be lost, we have to increase the pool size, maintain high inventory, and place order in the higher level.(4)If the waiting cost ๐‘๐‘ increases, the optimal values of ๐‘ โˆ— increase and ๐‘โˆ— decreases monotonically. We also note that, except for the combination of increasing the holding cost ๐‘โ„Ž, ๐‘†โˆ— decreases when ๐‘๐‘ increases.(5)If the setup cost ๐‘๐‘  increases, it is a common decision that we have to maintain more stock to avoid frequent ordering. This fact is also observed in our model.(6)We note that, when the perishable cost ๐‘pr increases ๐‘ โˆ—,๐‘†โˆ—, and ๐‘โˆ— decrease monotonically.

tab11
Table 11: Variation in optimal values for different values of ๐‘โ„Ž and ๐‘๐‘(๐‘๐‘ =15,๐‘sh=5,๐‘pr=0.3).
tab12
Table 12: Optimal values corresponding to various holding and perishable costs (๐‘๐‘ =15,๐‘sh=5,๐‘๐‘=3).
tab13
Table 13: Optimal values corresponding to various setup and holding costs (๐‘sh=5,๐‘๐‘=3,๐‘pr=0.3).
tab14
Table 14: Variation in optimal values for different values of ๐‘โ„Ž and ๐‘sh(๐‘๐‘ =15,๐‘๐‘=3,๐‘pr=0.3).
tab15
Table 15: Effect of ๐‘๐‘  and ๐‘๐‘ on the optimal cost rate (๐‘โ„Ž=0.3,๐‘sh=5,๐‘pr=0.3).
tab16
Table 16: Effect of ๐‘๐‘  and ๐‘pr on the optimal cost rate(๐‘โ„Ž=0.3,๐‘sh=5,๐‘๐‘=3).
tab17
Table 17: Sensitivity of optimal values to variation in ๐‘๐‘  and ๐‘sh(๐‘โ„Ž=0.3,๐‘๐‘=3,๐‘pr=0.3).
tab18
Table 18: Variation in optimal values for different values of ๐‘๐‘ and ๐‘sh(๐‘๐‘ =15,๐‘โ„Ž=0.3,๐‘pr=0.3).
tab19
Table 19: Effect of ๐‘sh and ๐‘pr on the optimal cost rate (๐‘๐‘ =15,๐‘โ„Ž=0.3,๐‘๐‘=3).
tab20
Table 20: Variation in Optimal values for different values of ๐‘๐‘ and ๐‘pr(๐‘๐‘ =15,๐‘โ„Ž=0.3,๐‘sh=5).

Example 3. In this example, we look to the impact of the demand rate ๐œ†, the reorder rate ๐œ‡, the selection rate ๐›ผ, and the mean vacation time 1/๐›ฝ on the fraction, ๐œ‚๐น, of time the server is on vacation for the combination of various values of postponed demand rate ๐›ผ(๐‘›)(๐‘›=1,2,3), ๐›ผ(๐‘›) is the increasing, constant, and decreasing functions, where ๐›ผ(1)=5+๐‘–โˆ—0.1, ๐›ผ(2)=5, and ๐›ผ(3)=5+๐‘–โˆ—(โˆ’0.1), ๐‘–=1,โ€ฆ,๐‘. From Figures 2 to 5, we observe the following.(i)As is to be expected as ๐œ† increases, ๐œ‚๐น increases. This is because, if the demands rate increases, the stockout occurs frequently, and hence the server takes vacation frequently. Hence, ๐œ‚๐น increases. Similarly the same thing is observed in the case ๐›พ.(ii)As ๐œ‡ increases, ๐œ‚๐น decreases. This happens because, if ๐œ‡ increases, the ordered items are received at higher rate. Hence, fewer stock-out periods occur. Hence the server returns to the system more often. Hence, the intervacation time increases. Therefore ๐œ‚๐น decreases. Similarly, the same thing is observed in the case ๐›ฝ.(iii)In these cases, we observe ๐›ผ(1)>๐›ผ(2)>๐›ผ(3).

620960.fig.002
Figure 2: Fraction of time server is on vacationโ€”๐œ† versus ๐›ผ(๐‘›)(๐‘†=90, โ€‰โ€‰๐‘ =15, โ€‰โ€‰๐‘=25, โ€‰โ€‰๐›ฝ=1.4, โ€‰โ€‰๐›พ=4, โ€‰โ€‰๐œ‡=0.8, โ€‰โ€‰๐‘=0.75.)
620960.fig.003
Figure 3: Fraction of time server is on vacationโ€”๐›ฝ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐œ†=8,๐›พ=4,๐œ‡=0.8,๐‘=0.75.)
620960.fig.004
Figure 4: Fraction of time server is on vacationโ€”๐œ‡ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐›ฝ=1.4,๐›พ=4,๐œ†=8,๐‘=0.75.)
620960.fig.005
Figure 5: Fraction of time server is on vacationโ€”๐›พ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐›ฝ=1.4,๐œ†=8,๐œ‡=0.8,๐‘=0.75.)

Example 4. In this example, we now study the impact of ๐‘ on the performance measures, expected Inventory level ๐œ‚๐ผ, expected reorder rate ๐œ‚๐‘…, expected perishable rate ๐œ‚PR, mean shortage rate ๐œ‚SR, expected number of customers in the pool ๐œ‚๐‘ƒ, fraction of time the server is on vacation ๐œ‚๐น and the total expected cost TC(๐‘ ,๐‘†,๐‘), for the combination of various values of postponed demand rate ๐›ผ(๐‘›)(๐‘›=1,2,3), ๐›ผ(๐‘›) is the increasing, constant, and decreasing functions, where ๐›ผ(1)=5+๐‘–โˆ—0.1, ๐›ผ(2)=5 and ๐›ผ(3)=5+๐‘–โˆ—(โˆ’0.1), ๐‘–=1,โ€ฆ,๐‘. From Figure 6 to 12, we observe the following.(i)As TC(๐‘ ,๐‘†,๐‘), ๐œ‚SR and ๐œ‚๐‘ƒ are monotonically increasing, when ๐‘ increases. In these cases, we observe ๐›ผ(1)<๐›ผ(2)<๐›ผ(3).(ii)As ๐œ‚๐‘… and ๐œ‚๐น are monotonically increasing, when ๐‘ increases. In these cases, we observe ๐›ผ(1)>๐›ผ(2)>๐›ผ(3).(iii)As ๐œ‚๐ผ and ๐œ‚PR are monotonically decreasing, when ๐‘ increases. In these cases, we observe ๐›ผ(1)<๐›ผ(2)<๐›ผ(3).

620960.fig.006
Figure 6: The total expected cost rateโ€”๐‘ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐œ†=8,๐›ฝ=1.4,๐›พ=0.7,๐œ†=8.)
620960.fig.007
Figure 7: Expected Inventory Levelโ€”๐‘ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐œ†=8,๐›ฝ=1.4,๐›พ=0.7,๐œ‡=0.8.)
620960.fig.008
Figure 8: Expected reorder rateโ€”๐‘ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐œ†=8,๐›ฝ=1.4,๐›พ=0.7,๐œ‡=0.8.)
620960.fig.009
Figure 9: Expected number of customers in the poolโ€”๐‘ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐œ†=8,๐›ฝ=1.4,๐›พ=0.7,๐œ‡=0.8.)
620960.fig.0010
Figure 10: Expected perishable rateโ€”๐‘ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐œ†=8,๐›ฝ=1.4,๐›พ=0.7,๐œ‡=0.8.)
620960.fig.0011
Figure 11: Mean loss of demand rateโ€”๐‘ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐œ†=8,๐›ฝ=1.4,๐›พ=0.7,๐œ‡=0.8.)
620960.fig.0012
Figure 12: Fraction of time server is on vacationโ€”๐‘ versus ๐›ผ(๐‘›)(๐‘†=90,๐‘ =15,๐‘=25,๐œ†=8,๐›ฝ=1.4,๐›พ=0.7,๐œ‡=0.8.)

Acknowledgments

The authors wish to thank the anonymous referee for the comments, which significantly improved the presentation of this paper. G. Arivarignan would like to thank the University Grants Commission (UGC), India, for their financial support (F. no. 32-170/2006(SR)). B. Sivakumar would like to thank the Council of Scientific and Industrial Research (CSIR)โ€”India for their financial support (no. 25(0813)/10/EMR-II).

References

  1. S. Nahmias, โ€œPerishable inventory theory: a review,โ€ Operations Research, vol. 30, no. 4, pp. 680โ€“708, 1982. View at Scopus
  2. F. Raafat, โ€œSurvey of literature on continuously deteriorating inventory models,โ€ Journal of the Operational Research Society, vol. 42, no. 1, pp. 27โ€“37, 1991. View at Scopus
  3. N. H. Shah and Y. K. Shah, โ€œLiterature survey on inventory models for deteriorating items,โ€ Ekonomski Anali, vol. 44, pp. 221โ€“237, 2000.
  4. S. K. Goyal and B. C. Giri, โ€œRecent trends in modeling of deteriorating inventory,โ€ European Journal of Operational Research, vol. 134, no. 1, pp. 1โ€“16, 2001. View at Publisher ยท View at Google Scholar ยท View at Scopus
  5. S. R. Chakravarthy and J. K. Daniel, โ€œA Markovian inventory system with random shelf time and back orders,โ€ Computers and Industrial Engineering, vol. 47, no. 4, pp. 315โ€“337, 2004. View at Publisher ยท View at Google Scholar ยท View at Scopus
  6. V. S. S. Yadavalli, W. Van Schoor Cde, J. J. Strashein, and S. Udayabakaran, โ€œA single product perishing inventory model with demand interaction,โ€ ORiON, vol. 20, pp. 109โ€“124, 2004.
  7. S. Kalpakam and S. Shanthi, โ€œPerishable inventory system with modified (S-1,S) policy and arbitrary processing times,โ€ Computers and Operations Research, vol. 28, no. 5, pp. 453โ€“471, 2001. View at Publisher ยท View at Google Scholar ยท View at Scopus
  8. S. Kalpakam and S. Shanthi, โ€œA continuous review perishable system with renewal demands,โ€ Annals of Operations Research, vol. 143, no. 1, pp. 211โ€“225, 2006. View at Publisher ยท View at Google Scholar ยท View at Scopus
  9. Z. Lian and L. Liu, โ€œContinuous review perishable inventory systems: models and heuristics,โ€ IIE Transactions, vol. 33, no. 9, pp. 809โ€“822, 2001. View at Publisher ยท View at Google Scholar ยท View at Scopus
  10. L. Liu and D. H. Shi, โ€œ(s, S) model for inventory with exponential lifetimes and renewal demands,โ€ Naval Research Logistics, vol. 46, no. 1, pp. 39โ€“56, 1999. View at Publisher ยท View at Google Scholar ยท View at Scopus
  11. S. Kalpakam and G. Arivarignan, โ€œA continuous review perishable inventory model,โ€ Statistics, vol. 19, no. 3, pp. 389โ€“398, 1988.
  12. รœ. Gรผrler and B. Y. ร–zkaya, โ€œA note on โ€˜continuous review perishable inventory systems: models and heuristicsโ€™,โ€ IIE Transactions, vol. 35, no. 3, pp. 321โ€“323, 2003. View at Publisher ยท View at Google Scholar ยท View at Scopus
  13. J. K. Daniel and R. Ramanarayanan, โ€œAn inventory system with two servers and rest periods,โ€ in Cahiers du Centre d'รฉtudes de recherche opรฉrationnelle, vol. 29, pp. 95โ€“100, Universite Libre De Bruxelles, 1987.
  14. J. K. Daniel and R. Ramanarayanan, โ€œAn (s, S) inventory system with rest periods to the server,โ€ Naval Research Logistics, vol. 35, no. 1, pp. 119โ€“123, 1988.
  15. B. T. Doshi, โ€œQueueing systems with vacationsโ€”a survey,โ€ Queueing Systems, vol. 1, no. 1, pp. 29โ€“66, 1986. View at Publisher ยท View at Google Scholar ยท View at Scopus
  16. B. T. Doshi, โ€œSingle server queues with vacations,โ€ in Stochastic Analysis of Computer and Communication Systems, H. Takagi, Ed., pp. 217โ€“265, Elsevier, Amsterdam, The Netherlands, 1990.
  17. H. Takagi, Queueing Analysisโ€”A Foundation of Performance Evaluation, vol. 1, Elsevier, Amsterdam, The Netherlands, 1991.
  18. H. Takagi, Queueing Analysisโ€”A Foundation of Performance Evaluation, vol. 3, Elsevier, Amsterdam, The Netherlands, 1993.
  19. N. Tian and Z. G. Zhang, Vacation Queueing Modelsโ€”Theory and Applications, Springer, 2006.
  20. O. Berman, E. H. Kaplan, and D. G. Shimshak, โ€œDeterministic approximations for inventory management at service facilities,โ€ IIE Transactions, vol. 25, no. 5, pp. 98โ€“104, 1993. View at Scopus
  21. A. Krishnamoorthy and M. E. Islam, โ€œ(s, S) inventory system with postponed demands,โ€ Stochastic Analysis and Applications, vol. 22, no. 3, pp. 827โ€“842, 2004. View at Publisher ยท View at Google Scholar ยท View at Scopus
  22. B. Sivakumar and G. Arivarignan, โ€œAn inventory system with postponed demands,โ€ Stochastic Analysis and Applications, vol. 26, no. 1, pp. 84โ€“97, 2008. View at Publisher ยท View at Google Scholar ยท View at Scopus
  23. P. Manuel, B. Sivakumar, and G. Arivarignan, โ€œPerishable inventory system with postponed demands and negative customers,โ€ Journal of Applied Mathematics and Decision Sciences, vol. 2007, Article ID 94850, 12 pages, 2007. View at Publisher ยท View at Google Scholar ยท View at Scopus
  24. B. Sivakumar and G. Arivarignan, โ€œA stochastic inventory system with postponed demands,โ€ Performance Evaluation, vol. 66, no. 1, pp. 47โ€“58, 2009. View at Publisher ยท View at Google Scholar ยท View at Scopus
  25. D. P. Gaver, P. A. Jacobs, and G. Latouche, โ€œFinite birth-anddeath models in randomly changing environments,โ€ Advances in Applied Probability, vol. 16, pp. 715โ€“731, 1984.