7 results on '"Efrosinin, Dmitry"'
Search Results
2. Robustness of the cμ -Rule for an Unreliable Single-Server Two-Class Queueing System with Constant Retrial Rates.
- Author
-
Efrosinin, Dmitry, Stepanova, Natalia, and Sztrik, Janos
- Subjects
- *
NEW trials , *RESOURCE allocation , *UNITS of time , *CONSUMERS , *FIRST in, first out (Queuing theory) - Abstract
We study the robustness of the c μ -rule for the optimal allocation of a resource consisting of one unreliable server to parallel queues with two different classes of customers. The customers in queues can be served with respect to a FIFO retrial discipline, when the customers at the heads of queues repeatedly try to occupy the server at a random time. It is proved that for scheduling problems in the system without arrivals, the c μ -rule minimizes the total average cost. For the system with arrivals, it is difficult directly to prove the optimality of the same policy with explicit relations. We derived for an infinite-buffer model a static control policy that also prescribes the service for certain values of system parameters exclusively for the class-i customers if both of the queues are not empty, with the aim to minimize the average cost per unit of time. It is also shown that in a finite buffer case, the c μ -rule fails. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. Optimal Scheduling in General Multi-Queue System by Combining Simulation and Neural Network Techniques.
- Author
-
Efrosinin, Dmitry, Vishnevsky, Vladimir, and Stepanova, Natalia
- Subjects
- *
SIMULATED annealing , *MARKOV processes , *REINFORCEMENT learning , *COST functions , *QUEUING theory , *SIMULATION methods & models - Abstract
The problem of optimal scheduling in a system with parallel queues and a single server has been extensively studied in queueing theory. However, such systems have mostly been analysed by assuming homogeneous attributes of arrival and service processes, or Markov queueing models were usually assumed in heterogeneous cases. The calculation of the optimal scheduling policy in such a queueing system with switching costs and arbitrary inter-arrival and service time distributions is not a trivial task. In this paper, we propose to combine simulation and neural network techniques to solve this problem. The scheduling in this system is performed by means of a neural network informing the controller at a service completion epoch on a queue index which has to be serviced next. We adapt the simulated annealing algorithm to optimize the weights and the biases of the multi-layer neural network initially trained on some arbitrary heuristic control policy with the aim to minimize the average cost function which in turn can be calculated only via simulation. To verify the quality of the obtained optimal solutions, the optimal scheduling policy was calculated by solving a Markov decision problem formulated for the corresponding Markovian counterpart. The results of numerical analysis show the effectiveness of this approach to find the optimal deterministic control policy for the routing, scheduling or resource allocation in general queueing systems. Moreover, a comparison of the results obtained for different distributions illustrates statistical insensitivity of the optimal scheduling policy to the shape of inter-arrival and service time distributions for the same first moments. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
4. Optimal Control of Degrading Units through Threshold-Based Control Policies.
- Author
-
Efrosinin, Dmitry and Stepanova, Natalia
- Subjects
- *
RANDOM dynamical systems , *STOCHASTIC processes , *COST structure , *MARKOV processes , *NUMERICAL calculations - Abstract
Optimal control problems are applied to a variety of dynamical systems with a random law of motion. In this paper we show that the random degradation processes defined on a discrete set of intermediate degradation states are also suitable for formulating and solving optimization problems and finding an appropriate optimal control policy. Two degradation models are considered in this paper: with random time to an instantaneous failure and with random time to a preventive maintenance. In both cases, a threshold-based control policy with two thresholds levels defining the signal state, after which an instantaneous failure or preventive maintenance can occur after a random time, and a maximum number of intermediate degradation states is applied. The optimal control problem is mainly solved in a steady-state regime. The main loss functional is formulated as the average cost per unit of time for a given cost structure. The Markov degradation models are used for numerical calculations of the optimal threshold policy and reliability function of the studied degrading units. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
5. On the Problem of State Recognition in Injection Molding Based on Accelerometer Data Sets.
- Author
-
Brunthaler, Julian, Grabski, Patryk, Sturm, Valentin, Lubowski, Wolfgang, and Efrosinin, Dmitry
- Subjects
SUPERVISED learning ,ACCELEROMETERS ,MACHINE learning ,INJECTION molding ,CONVOLUTIONAL neural networks ,MANUFACTURING processes ,DATABASES - Abstract
The last few decades have been characterised by a very active application of smart technologies in various fields of industry. This paper deals with industrial activities, such as injection molding, where it is required to monitor continuously the manufacturing process to identify both the effective running time and down-time periods. Supervised machine learning algorithms are developed to recognize automatically the periods of the injection molding machines. The former algorithm uses directly the features of the descriptive statistics, while the latter one utilizes a convolutional neural network. The automatic state recognition system is equipped with an 3D-accelerometer sensor whose datasets are used to train and verify the proposed algorithms. The novelty of our contribution is that accelerometer data-based machine learning models are used to distinguish producing and non-producing periods by means of recognition of key steps in an injection molding cycle. The first testing results show the approximate overall balanced accuracy of 72–92% that illustrates the large potential of the monitoring system with the accelerometer. According to the ANOVA test, there are no sufficient statistical differences between the comparative algorithms, but the results of the neural network exhibit higher variances of the defined accuracy metrics. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
6. Optimal Open-Loop Routing and Threshold-Based Allocation in TWO Parallel QUEUEING Systems with Heterogeneous Servers.
- Author
-
Efrosinin, Dmitry and Stepanova, Natalia
- Subjects
- *
POISSON processes , *QUEUING theory , *ALGORITHMS , *RESOURCE allocation , *PROBABILITY theory , *DIFFERENCE equations - Abstract
In this paper, we study the problem of optimal routing for the pair of two-server heterogeneous queues operating in parallel and subsequent optimal allocation of customers between the servers in each queue. Heterogeneity implies different servers in terms of speed of service. An open-loop control assumes the static resource allocation when a router has no information about the state of the system. We discuss here the algorithm to calculate the optimal routing policy based on specially constructed Markov-modulated Poisson processes. As an alternative static policy, we consider an optimal Bernoulli splitting which prescribes the optimal allocation probabilities. Then, we show that the optimal allocation policy between the servers within each queue is of threshold type with threshold levels depending on the queue length and phase of an arrival process. This dependence can be neglected by using a heuristic threshold policy. A number of illustrative examples show interesting properties of the systems operating under the introduced policies and their performance characteristics. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
7. Algorithmic Analysis of Finite-Source Multi-Server Heterogeneous Queueing Systems.
- Author
-
Efrosinin, Dmitry, Stepanova, Natalia, and Sztrik, Janos
- Subjects
- *
QUEUING theory , *NUMBER systems , *ALGORITHMS - Abstract
The paper deals with a finite-source queueing system serving one class of customers and consisting of heterogeneous servers with unequal service intensities and of one common queue. The main model has a non-preemptive service when the customer can not change the server during its service time. The optimal allocation problem is formulated as a Markov-decision one. We show numerically that the optimal policy which minimizes the long-run average number of customers in the system has a threshold structure. We derive the matrix expressions for performance measures of the system and compare the main model with alternative simplified queuing systems which are analysed for the arbitrary number of servers. We observe that the preemptive heterogeneous model operating under a threshold policy is a good approximation for the main model by calculating the mean number of customers in the system. Moreover, using the preemptive and non-preemptive queueing models with the faster server first policy the lower and upper bounds are calculated for this mean value. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.