scholarly journals A Fluid EOQ Model with Markovian Environment

2015 ◽  
Vol 52 (2) ◽  
pp. 473-489 ◽  
Author(s):  
Yonit Barron
Keyword(s):  
Continuous Time ◽  
Inventory Level ◽  
Continuous Time Markov Chain ◽  
Holding Costs ◽  
Eoq Model ◽  
Long Run ◽  
Average Criterion ◽  
Production Inventory ◽  
Finite State ◽  
Cost Functionals

We consider a production-inventory model operating in a stochastic environment that is modulated by a finite state continuous-time Markov chain. When the inventory level reaches zero, an order is placed from an external supplier. The costs (purchasing and holding costs) are modulated by the state at the order epoch time. Applying a matrix analytic approach, fluid flow techniques, and martingales, we develop methods to obtain explicit equations for these cost functionals in the discounted case and under the long-run average criterion. Finally, we extend the model to allow backlogging.

A Fluid EOQ Model with Markovian Environment

2015 ◽  
Vol 52 (02) ◽  
pp. 473-489
Author(s):  
Yonit Barron
Keyword(s):  
Continuous Time ◽  
Inventory Level ◽  
Continuous Time Markov Chain ◽  
Holding Costs ◽  
Eoq Model ◽  
Long Run ◽  
Average Criterion ◽  
Production Inventory ◽  
Finite State ◽  
Cost Functionals

We consider a production-inventory model operating in a stochastic environment that is modulated by a finite state continuous-time Markov chain. When the inventory level reaches zero, an order is placed from an external supplier. The costs (purchasing and holding costs) are modulated by the state at the order epoch time. Applying a matrix analytic approach, fluid flow techniques, and martingales, we develop methods to obtain explicit equations for these cost functionals in the discounted case and under the long-run average criterion. Finally, we extend the model to allow backlogging.

A Fluid EOQ Model with Markovian Environment

2015 ◽  
Vol 52 (02) ◽  
pp. 473-489 ◽  
Author(s):  
Yonit Barron
Keyword(s):  
Continuous Time ◽  
Inventory Level ◽  
Continuous Time Markov Chain ◽  
Holding Costs ◽  
Eoq Model ◽  
Long Run ◽  
Average Criterion ◽  
Production Inventory ◽  
Finite State ◽  
Cost Functionals

We consider a production-inventory model operating in a stochastic environment that is modulated by a finite state continuous-time Markov chain. When the inventory level reaches zero, an order is placed from an external supplier. The costs (purchasing and holding costs) are modulated by the state at the order epoch time. Applying a matrix analytic approach, fluid flow techniques, and martingales, we develop methods to obtain explicit equations for these cost functionals in the discounted case and under the long-run average criterion. Finally, we extend the model to allow backlogging.

scholarly journals A JUMP-FLUID PRODUCTION–INVENTORY MODEL WITH A DOUBLE BAND CONTROL

2014 ◽  
Vol 28 (3) ◽  
pp. 313-333 ◽  
Author(s):  
Yonit Barron ◽  
David Perry ◽  
Wolfgang Stadje
Keyword(s):  
Phase Type Distribution ◽  
Time Intervals ◽  
Flow Models ◽  
Long Run ◽  
Average Criterion ◽  
Production Inventory ◽  
Fluid Production ◽  
Reflecting Boundaries ◽  
Inventory Control Model ◽  
Cost Functionals

We consider a production–inventory control model with two reflecting boundaries, representing the finite storage capacity and the finite maximum backlog. Demands arrive at the inventory according to a Poisson process, their i.i.d. sizes having a common phase-type distribution. The inventory is filled by a production process, which alternates between two prespecified production rates ρ1 and ρ2: as long as the content level is positive, ρ1 is applied while the production follows ρ2 during time intervals of backlog (i.e., negative content). We derive in closed form the various cost functionals of this model for the discounted case as well as under the long-run-average criterion. The analysis is based on a martingale of the Kella–Whitt type and results for fluid flow models due to Ahn and Ramaswami.

Comparison of sequential and continuous inspection strategies for deteriorating systems

1994 ◽  
Vol 26 (2) ◽  
pp. 423-435 ◽  
Author(s):  
C. Teresa Lam ◽  
R. H. Yeh
Keyword(s):  
Continuous Time ◽  
Iterative Algorithms ◽  
Optimal Cost ◽  
Cost Rate ◽  
State Dependent ◽  
Long Run ◽  
Inspection Strategy ◽  
Optimal Policies ◽  
Finite State ◽  
Deteriorating Systems

This paper investigates inspection strategies for a finite-state continuous-time Markovian deteriorating system. Two inspection strategies are considered: sequential inspection and continuous inspection. Unlike many previous efforts, the inspection times for the sequential inspection strategy are assumed to be non-negligible. The replacement times and costs for both strategies are non-negligible and state dependent. Our objective here is to minimize the expected long-run cost rate. Iterative algorithms are provided to derive the optimal policies for both strategies. The structures of these optimal policies and their corresponding optimal cost rates are discussed and compared.

scholarly journals Similar States in Continuous-Time Markov Chains

2009 ◽  
Vol 46 (02) ◽  
pp. 497-506 ◽  
Author(s):  
V. B. Yap
Keyword(s):  
Markov Chains ◽  
Continuous Time ◽  
Transition Matrix ◽  
Base Substitution ◽  
Continuous Time Markov Chain ◽  
Rate Matrix ◽  
Dna Base ◽  
Substitution Models ◽  
Finite State ◽  
Finite State Space

In a homogeneous continuous-time Markov chain on a finite state space, two states that jump to every other state with the same rate are called similar. By partitioning states into similarity classes, the algebraic derivation of the transition matrix can be simplified, using hidden holding times and lumped Markov chains. When the rate matrix is reversible, the transition matrix is explicitly related in an intuitive way to that of the lumped chain. The theory provides a unified derivation for a whole range of useful DNA base substitution models, and a number of amino acid substitution models.

Redundancy allocation of mixed warm and cold standby components in repairable K-out-of-N systems

2020 ◽  
Vol 234 (5) ◽  
pp. 696-707
Author(s):  
Min Gong ◽  
Hanlin Liu ◽  
Rui Peng
Keyword(s):  
Continuous Time ◽  
System Reliability ◽  
Continuous Time Markov Chain ◽  
System Availability ◽  
Long Run ◽  
Proposed Model ◽  
Cold Standby ◽  
Running Cost ◽  
Warm Standby ◽  
Reliability And Availability

In system design process, standby redundancy is a widely used technique to improve system reliability and availability. Typical standby techniques involve cold standby, hot standby, and warm standby. In this article, we investigate the repairable K-out-of- N system with mixed standby strategy containing both warm and cold standby. In the proposed system, each component can be in failure, cold, warm, and active states and the components are assumed to be repairable. The systems are modeled by continuous time Markov chain and the system long-run availability is derived. Furthermore, the optimal configuration of standby components in the system is studied considering both system availability and system running cost. Illustrative examples are presented to show the applications of the proposed model.

Aggregated Markov processes with negative exponential time interval omission

1990 ◽  
Vol 22 (04) ◽  
pp. 802-830 ◽  
Author(s):  
Frank Ball
Keyword(s):  
State Space ◽  
Continuous Time ◽  
Single Channel ◽  
The State ◽  
Time Interval ◽  
Continuous Time Markov Chain ◽  
Negative Exponential Distribution ◽  
Finite State ◽  
Negative Exponential ◽  
Finite State Space

We consider a time reversible, continuous time Markov chain on a finite state space. The state space is partitioned into two sets, termed open and closed, and it is only possible to observe whether the process is in an open or a closed state. Further, short sojourns in either the open or closed states fail to be detected. We consider the situation when the length of minimal detectable sojourns follows a negative exponential distribution with mean μ–1. We show that the probability density function of observed open sojourns takes the form , where n is the size of the state space. We present a thorough asymptotic analysis of f O(t) as μ tends to infinity. We discuss the relevance of our results to the modelling of single channel records. We illustrate the theory with a numerical example.

A storage model in which the net growth-rate is a Markov chain

1972 ◽  
Vol 9 (01) ◽  
pp. 129-139 ◽  
Author(s):  
P. J. Brockwell
Keyword(s):  
Markov Chain ◽  
Continuous Time ◽  
Rate Of Change ◽  
Continuous Time Markov Chain ◽  
Finite Capacity ◽  
Storage Model ◽  
Finite State ◽  
Net Growth Rate ◽  
The Times ◽  
Finite State Space

The distribution of the times to first emptiness and first overflow, together with the limiting distribution of content are determined for a dam of finite capacity. It is assumed that the rate of change of the level of the dam is a continuous-time Markov chain with finite state-space (suitably modified when the dam is full or empty).

A storage model in which the net growth-rate is a Markov chain

1972 ◽  
Vol 9 (1) ◽  
pp. 129-139 ◽  
Author(s):  
P. J. Brockwell
Keyword(s):  
Markov Chain ◽  
Continuous Time ◽  
Rate Of Change ◽  
Continuous Time Markov Chain ◽  
Finite Capacity ◽  
Storage Model ◽  
Finite State ◽  
Net Growth Rate ◽  
The Times ◽  
Finite State Space

The distribution of the times to first emptiness and first overflow, together with the limiting distribution of content are determined for a dam of finite capacity. It is assumed that the rate of change of the level of the dam is a continuous-time Markov chain with finite state-space (suitably modified when the dam is full or empty).

Comparison of sequential and continuous inspection strategies for deteriorating systems

1994 ◽  
Vol 26 (02) ◽  
pp. 423-435 ◽  
Author(s):  
C. Teresa Lam ◽  
R. H. Yeh
Keyword(s):  
Continuous Time ◽  
Iterative Algorithms ◽  
Optimal Cost ◽  
Cost Rate ◽  
State Dependent ◽  
Long Run ◽  
Inspection Strategy ◽  
Optimal Policies ◽  
Finite State ◽  
Deteriorating Systems

This paper investigates inspection strategies for a finite-state continuous-time Markovian deteriorating system. Two inspection strategies are considered: sequential inspection and continuous inspection. Unlike many previous efforts, the inspection times for the sequential inspection strategy are assumed to be non-negligible. The replacement times and costs for both strategies are non-negligible and state dependent. Our objective here is to minimize the expected long-run cost rate. Iterative algorithms are provided to derive the optimal policies for both strategies. The structures of these optimal policies and their corresponding optimal cost rates are discussed and compared.

Sign in / Sign up

Export Citation Format

Share Document