TAILIEUCHUNG - Markovian inventory model with two parallel queues, jockeying and impatient customers

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. | Yugoslav Journal of Operations Research 26 (2016), Number 4, 467–506 DOI: MARKOVIAN INVENTORY MODEL WITH TWO PARALLEL QUEUES, JOCKEYING AND IMPATIENT CUSTOMERS K. JEGANATHAN Ramanujan Institute for Advanced Study in Mathematics, University of Madras, Chennai, India. J. SUMATHI Ramanujan Institute for Advanced Study in Mathematics, University of Madras, Chennai, India. G. MAHALAKSHMI Ramanujan Institute for Advanced Study in Mathematics, University of Madras, Chennai, India. Received: March 2015 / Accepted: July 2015 Abstract: 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 from being idle while the customers are waiting in the other queue. The waiting customer independently reneges the system after an exponentially distributed amount of time. The joint probability distribution of the inventory level, the number of customers in both queues, and the status of the server are obtained in the steady state. Some important system .

• Kinh tế học
• Markov process
• Continuous review
• Inventory with service time
• Perishable commodity
• Shortest queue
• Jockeying and impatient
• Reinforcement learning
• Q Learning
• Multi agent system
• Distributed system
• Markov decision process
• Factored Markov decision process
• Hierarchical Non Emitting
• Markov Models
• Eric Sven Ristad
• scientific reports
• model language
• process natural language
• Finite State
• Transducers Approximating
• Hidden Markov Models
• Cascaded Markov Models
• Thorsten Brants
• Long Papers
• Lecture Introduction to Stochastic Processes
• Introduction to Stochastic Processes
• Markov chain
• Discrete parameter stochastic process
• Time homogeneous Markov chain
• Markov processes
• employing isomorphism theorems
• well established techniques
• Gaussian process theory
• remarkable isomorphism theorems
• Dynkin and Eisenbaum
• báo cáo khoa học
• báo cáo hóa học
• công trình nghiên cứu về hóa học
• tài liệu về hóa học
• cách trình bày báo cáo
• BMC Bioinformatics
• Viral coinfection
• Respiratory virus
• Within host model
• Continuous time Markov chain
• Multi type branching process
• Extinction probability
• Homogeneous Poisson process
• Discrete Markov chains
• Positive real numbers
• Khoa học máy tính
• Tạp chí khoa học
• Probabilistic Duration Calculus
• Probabilistic Timed Automata
• Model checking