LAPSE:2023.4209
Published Article

LAPSE:2023.4209
Steady State Analysis of Impulse Customers and Cancellation Policy in Queueing-Inventory System
February 22, 2023
Abstract
This article discusses the queueing-inventory model with a cancellation policy and two classes of customers. The two classes of customers are named ordinary and impulse customers. A customer who does not plan to buy the product when entering the system is called an impulse customer. Suppose the customer enters into the system to buy the product with a plan is called ordinary customer. The system consists of a pool of finite waiting areas of size N and maximum S items in the inventory. The ordinary customer can move to the pooled place if they find that the inventory is empty under the Bernoulli schedule. In such a situation, impulse customers are not allowed to enter into the pooled place. Additionally, the pooled customers buy the product whenever they find positive inventory. If the inventory level falls to s, the replenishment of Q items is to be replaced immediately under the (s, Q) ordering principle. Both arrival streams occur according to the independent Markovian arrival process (MAP), and lead time follows an exponential distribution. In addition, the system allows the cancellation of the purchased item only when there exist fewer than S items in the inventory. Here, the time between two successive cancellations of the purchased item is assumed to be exponentially distributed. The Gaver algorithm is used to obtain the stationary probability vector of the system in the steady-state. Further, the necessary numerical interpretations are investigated to enhance the proposed model.
This article discusses the queueing-inventory model with a cancellation policy and two classes of customers. The two classes of customers are named ordinary and impulse customers. A customer who does not plan to buy the product when entering the system is called an impulse customer. Suppose the customer enters into the system to buy the product with a plan is called ordinary customer. The system consists of a pool of finite waiting areas of size N and maximum S items in the inventory. The ordinary customer can move to the pooled place if they find that the inventory is empty under the Bernoulli schedule. In such a situation, impulse customers are not allowed to enter into the pooled place. Additionally, the pooled customers buy the product whenever they find positive inventory. If the inventory level falls to s, the replenishment of Q items is to be replaced immediately under the (s, Q) ordering principle. Both arrival streams occur according to the independent Markovian arrival process (MAP), and lead time follows an exponential distribution. In addition, the system allows the cancellation of the purchased item only when there exist fewer than S items in the inventory. Here, the time between two successive cancellations of the purchased item is assumed to be exponentially distributed. The Gaver algorithm is used to obtain the stationary probability vector of the system in the steady-state. Further, the necessary numerical interpretations are investigated to enhance the proposed model.
Record ID
Keywords
cancellation policy, IMPULSE customer, Markovian arrival process, queueing-inventory model
Subject
Suggested Citation
Vinitha V, Anbazhagan N, Amutha S, Jeganathan K, Joshi GP, Cho W, Seo S. Steady State Analysis of Impulse Customers and Cancellation Policy in Queueing-Inventory System. (2023). LAPSE:2023.4209
Author Affiliations
Vinitha V: Department of Mathematics, Alagappa University, Karaikudi 630003, India
Anbazhagan N: Department of Mathematics, Alagappa University, Karaikudi 630003, India [ORCID]
Amutha S: Ramanujan Centre for Higher Mathematics, Alagappa University, Karaikudi 630003, India [ORCID]
Jeganathan K: Ramanujan Institute for Advanced Study in Mathematics, University of Madras, Chennai 600005, India [ORCID]
Joshi GP: Department of Computer Science and Engineering, Sejong University, Seoul 05006, Korea [ORCID]
Cho W: Department of Software Convergence, Daegu Catholic University, Gyeongsan 38430, Korea [ORCID]
Seo S: Department of e-Business, Yuhan University, Bucheon-si 14780, Korea
Anbazhagan N: Department of Mathematics, Alagappa University, Karaikudi 630003, India [ORCID]
Amutha S: Ramanujan Centre for Higher Mathematics, Alagappa University, Karaikudi 630003, India [ORCID]
Jeganathan K: Ramanujan Institute for Advanced Study in Mathematics, University of Madras, Chennai 600005, India [ORCID]
Joshi GP: Department of Computer Science and Engineering, Sejong University, Seoul 05006, Korea [ORCID]
Cho W: Department of Software Convergence, Daegu Catholic University, Gyeongsan 38430, Korea [ORCID]
Seo S: Department of e-Business, Yuhan University, Bucheon-si 14780, Korea
Journal Name
Processes
Volume
9
Issue
12
First Page
2146
Year
2021
Publication Date
2021-11-28
ISSN
2227-9717
Version Comments
Original Submission
Other Meta
PII: pr9122146, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2023.4209
This Record
External Link

https://doi.org/10.3390/pr9122146
Publisher Version
Download
Meta
Record Statistics
Record Views
254
Version History
[v1] (Original Submission)
Feb 22, 2023
Verified by curator on
Feb 22, 2023
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2023.4209
Record Owner
Auto Uploader for LAPSE
Links to Related Works
