Results 41 to 50 of about 1,352 (222)
On a non-Markovian queueing problem under a control operating policy and start-up times [PDF]
summary:A non-Markovian queueing system with Poisson input is studied under a modified operating rule called "control operating policy" in which the server begins "start-up" only when the queue length reaches a fixed number $n(\geq 1)$.
Gohain, Ruby, Borthakur, Arun
core +1 more source
Abstract With the deepening of research on smart grids, the distribution system has gradually evolved into a cyber‐physical distribution system (CPDS). The refined reliability modelling and assessment methods for CPDS are of great significance. This paper proposes an integrated reliability assessment framework combining distribution information system (
Wei Wu +9 more
wiley +1 more source
On identifiability of MAP processes [PDF]
Two types of transitions can be found in the Markovian Arrival process or MAP: with and without arrivals. In transient transitions the chain jumps from one state to another with no arrival; in effective transitions, a single arrival occurs.
Lillo Rodríguez, Rosa Elvira +2 more
core
ABSTRACT Deployment of autonomous driving trucks (ADTs) in open‐pit mining enables more flexible transport operations than human‐driven trucks; but this flexibility significantly expands the scheduling search space and makes it more difficult to find near‐optimal solutions on large scales.
Rentao Sun +3 more
wiley +1 more source
Time-dependent analysis of virtual waiting time behaviour in discrete time queues [PDF]
Discrete time queueing models have been shown previously to be of practical use for modelling the approximate time-dependent behaviour of queue length in systems of the form M(t)/G/c.
Wall, A, Worthington, D J
core
On the Queue Length Distribution in BMAP Systems
Batch Markovian Arrival Process – BMAP – is a teletraffic model which combines high ability to imitate complexstatistical behaviour of network traces with relative simplicity in analysis and simulation.
Andrzej Chydzinski
doaj
Stochastic Monotonicity of Markovian Multiclass Queueing Networks [PDF]
Multiclass queueing networks (McQNs) extend the classical concept of the Jackson network by allowing jobs of different classes to visit the same server. Although such a generalization seems rather natural, from a structural perspective, there is a significant gap between the two concepts. Nice analytical features of Jackson networks, such as stability
Leahu Haralambie, Michel Mandjes
openaire +3 more sources
Fuzzy States to Enhance Train Delay Prediction of Markov Chains
This study introduces Markov chains with fuzzy delay states with triangular membership functions for the first time to model train delay predictions. It is shown that the prediction errors can be reduced by the fuzzification adoption. ABSTRACT Markov chains provide distinctive advantages and practical applicability in modeling of train delays.
Mehmet Şirin Artan, İsmail Şahin
wiley +1 more source
This paper analyses the intention‐aware fixed‐route electric vehicle charging problem and shows that selfish, individually optimized charging decisions can degrade overall system performance. To address this, the authors introduce a Markov‐model‐based intention‐aware queuing system that uses planned charging intentions to provide predictive wait times ...
Julian Widmann, Oliver Sawodny
wiley +1 more source
Stability criteria for controlled queueing networks [PDF]
We give criteria for the stability of a very general queueing model under different levels of control. A complete classification of stability (or positive recurrence), transience and null-recurrence is presented for the two queue model. The stability and
Müller, Lisa Johanna
core

