Markovian Demands on Two Commodity Inventory System with Queue-Dependent Services and an Optional Retrial Facility (original) (raw)
Related papers
Markovian inventory model with two parallel queues, jockeying and impatient customers
Yugoslav Journal of Operations Research, 2016
This article presents a perishable stochastic inventory system under continuous review at a service facility consisting of two parallel queues with jockeying. Each server has its own queue, and jockeying among the queues is permitted. The capacity of each queue is of finite size L. The inventory is replenished according to an (s; S) inventory policy and the replenishing times are assumed to be exponentially distributed. The individual customer is issued a demanded item after a random service time, which is distributed as negative exponential. The life time of each item is assumed to be exponential. Customers arrive according to a Poisson process and on arrival; they join the shortest feasible queue. Moreover, if the inventory level is more than one and one queue is empty while in the other queue, more than one customer are waiting, then the customer who has to be received after the customer being served in that queue is transferred to the empty queue. This will prevent one server fr...
Sustainability
In this paper, we analyze a queueing–inventory system with two classes of customers, high priority (HP) and low priority (LP), under the discretionary priority discipline. The LP customers are served in two stages: preliminary service in stage-I and main service in stage-II. In contrast, HP customers require only the main service. Whenever the inventory level is less than the threshold level during the stage-I service of an LP customer, an arriving HP customer is allowed to interrupt the service of an LP customer by adopting the mixed-priority discipline. Otherwise, non-preemptive priority discipline is used in both stages. The interrupted LP customer moves to orbit and retries for the service whenever the server is free. The waiting hall of finite capacity is afforded for the HP customer only. The orbital search is provided for LP customers in orbit. The inventory is replenished following the (s,Q) ordering policy, with the lifetimes of the items being exponentially distributed. An...
DOI 10.1007/s11134-006-8710-5 M/M/1 Queueing systems with inventory
2004
We derive stationary distributions of joint queue length and inventory processes in explicit product form for various M/M/1-systems with inventory under continuous re-view and different inventory management policies, and with lost sales. Demand is Poisson, service times and lead times are exponentially distributed. These distributions are used to calculate performance measures of the respective systems. In case of infinite waiting room the key result is that the limiting distributions of the queue length processes are the same as in the classical M/M/1/∞-system.
Markov Models of Queueing–Inventory Systems with Variable Order Size
Cybernetics and Systems Analysis, 2017
Markov models of queueing-inventory systems with variable order size are investigated. Two classes of models are considered: with instant service and with nonzero service time. The model with nonzero service time assumes that impatient customers can form a queue of either finite or infinite length. The exact and approximate methods are developed to calculate the characteristics of the systems under proposed restocking policy.
A queueing-inventory system with two classes of customers
International Journal of Production Economics, 2011
We consider a queueing-inventory system with two classes of customers. Customers arrive at a service facility according to Poisson processes. Service times follow exponential distributions. Each service uses one item in the attached inventory supplied by an outside supplier with exponentially distributed lead time. We find a priority service rule to minimize the long-run expected waiting cost by dynamic programming method and obtain the necessary and sufficient condition for the priority queueinginventory system being stable. Formulating the model as a level-dependent quasi-birth-and-death (QBD) process, we can compute the steady state probability distribution by Bright-Taylor algorithm. Useful analytical properties for the cost function are identified and extensive computations are conducted to examine the impact of different parameters to the system performance measures.
Queueing-Inventory Systems with Catastrophes under Various Replenishment Policies
We discuss two queueing-inventory systems with catastrophes in the warehouse. Catastrophes occur according to Poisson process and upon arrival of a catastrophe all inventory in the system is instantly destroyed. But consumer customers in the system (in the server or in the buffer) continue still waiting for the replenishment of the stock. The arrivals of the consumer customers follow a Markovian Arrival Process (MAP) and they can be queued in an infinite buffer. Service time of a consumer customer follows a phase-type distribution. The system receives negative customers whose have Poisson flows to service facility and upon arrival of a negative customer one consumer customer is pushed out from the system, if any. One of two replenishment policies can be used in the system: either (s,S) or (s,Q). If upon arrival of the consumer customer, the inventory level is zero, then according to the Bernoulli scheme, this customer is either lost (lost sale scheme) or join the queue (backorder sa...
M/M/1 Queueing systems with inventory
Queueing Systems, 2006
We derive stationary distributions of joint queue length and inventory processes in explicit product form for various M/M/1-systems with inventory under continuous review and different inventory management policies, and with lost sales. Demand is Poisson, service times and lead times are exponentially distributed. These distributions are used to calculate performance measures of the respective systems. In case of infinite waiting room the key result is that the limiting distributions of the queue length processes are the same as in the classical M/M/1/∞-system.
Mathematics
The purpose of this article is to examine the server activation policy (SAP) in a multi-server queuing-inventory system (MQIS). The queue has a total of c number of multi-threshold stages as well as c-homogeneous servers. The activation of each server begins one by one if there is an adequate queue length and inventory in the system; otherwise, they remain idle. The server deactivation process continues until the queue length exceeds the manageable level (predetermined stages) or there is insufficient stock. In addition, when we assume the length of the two successive threshold levels is one, the server activation policy model becomes a regular multi-server model. The Neuts matrix geometric approach is used to discuss the stability condition, stationary probability vector. The Laplace–Stieltjes transform (LST) is used to analyse the waiting time distributions of the queue and orbital customers. Additionally, significant system performance metrics and sensitivity analysis are used to...
A Relook at Queueing-Inventory System with Reservation, Cancellation and Common Life Time
2016
ABSTRACT: In this paper, we study an M/M/1 queue with a storage system having capacity S which have a common life time (CLT ), exponentially distributed. On realization of common life time or the first time inventory level drops to zero in a cycle whichever occurs first, a replenishment order is placed so as to bring the inventory level back to S (zero lead time). Customers arrive to the system according to a Poisson process and their service time is exponentially distributed. Reservation of items and cancellation of sold items is permitted before the realization of common life time. Cancellation takes place according to an exponential distribution. In this paper we assume that the time required to cancel the reservation is negligible. When the inventory level becomes zero through service completion or CLT realization, a replenishment order is placed which is realized instantly. We first derive the stationary joint distribution of the queue length and the on-hand inventory in produc...
Analysis of a Multiserver Queueing-Inventory System
Advances in Operations Research, 2015
We attempt to derive the steady-state distribution of theM/M/cqueueing-inventory system with positive service time. First we analyze the case ofc=2servers which are assumed to be homogeneous and that the service time follows exponential distribution. The inventory replenishment follows the(s,Q)policy. We obtain a product form solution of the steady-state distribution under the assumption that customers do not join the system when the inventory level is zero. An average system cost function is constructed and the optimal pair(s,Q)and the corresponding expected minimum cost are computed. As in the case ofM/M/cretrial queue withc≥3, we conjecture thatM/M/cforc≥3, queueing-inventory problems, do not have analytical solution. So we proceed to analyze such cases using algorithmic approach. We derive an explicit expression for the stability condition of the system. Conditional distribution of the inventory level, conditioned on the number of customers in the system, and conditional distrib...