Product customization and frequent market changes force manufacturing companies to employ mixed-model instead of simple assembly lines. To well adjust the line’s capacity production requirements, line can benefit from concept reconfigurability. Our study deals with a reconfigurable where tasks be dynamically assigned stations at each takt, workers move among end order entering product models is...

We investigate propagation of chaos for mean field Markov Decision Process with common noise (CMKV-MDP), and when the optimization is performed over randomized open-loop controls on infinite horizon. first state a rate convergence order MNγ, where MN in Wasserstein distance empirical measure, γ ∈ (0,1] an explicit constant, limit value functions N-agent control problem asymmetric controls, towa...

The value 1 problem is a natural decision problem in algorithmic game theory. For partially observable Markov decision processes with reachability objective, this problem is defined as follows: are there strategies that achieve the reachability objective with probability arbitrarily close to 1? This problem was shown undecidable recently. Our contribution is to introduce a class of partially ob...

This paper proposes a new heuristic algorithm suitable for real-time applications using partially observable Markov decision processes (POMDP). The algorithm is based in a reward shaping strategy which includes entropy information in the reward structure of a fully observable Markov decision process (MDP). This strategy, as illustrated by the presented results, exhibits near-optimal performance...

We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...

This paper consideres an optimal ordering and replacement problem of a continuous time Markovian degradation system. An optimal policy minimizes the expected cost per unit time in an infinite time horizon. The problem is formulated by semi-Markov decision process and the optimality of an (n,N)-policy is shown. Further, the expected cost rate of the system operated under an (n,N)-policy is obtai...