Analysis of Batch Entry Lining Model with Mandatory Excursions and Stochastic Repair Delays

Performance under steady state conditions is investigated a model for non-Markovian batch arrival queuing with servers taking extended and brief vacations. In a Poisson stream with batches of varying sizes, clients arrive at the system. A mandatory long vacation or a mandatory short vacation of chance ω<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> may be chosen by the server with probability ω<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</inf> at each administration completion age. The service channel is presumptively susceptible to breakdowns, and when one occurs, it delays for the repairs to begin. This delay period occurs in two phases. The administration time, delay, short get-away, lengthy vacation time and the redesign process forms are distributed in this manner. Utilizing supplementary factors, we employ the additional variable approach. Under constant state conditions, we derive the line estimate appropriation for any age. In addition, we determine several essential system execution metrics. This broadens some models considered by a few writers. Finally, two fascinating individual examples are explored. Numerous numerical demonstrations have also been done to validate the authenticity of the hypothetical consequences.

Authors

Institutions

Publication Details

Published
2025-04-07
DOI
https://doi.org/10.1109/ictmim65579.2025.10988172
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analysis of Batch Entry Lining Model with Mandatory Excursions and Stochastic Repair Delays

G. T. Shakila Devi, S. Rukmani Devi, P. Vignesh, P. Sudhakar et al.
Advanced Manufacturing and Logistics Optimization
article

Analysis of Batch Entry Lining Model with Mandatory Excursions and Stochastic Repair Delays

G. T. Shakila Devi, S. Rukmani Devi, P. Vignesh, P. Sudhakar, S. Arulanand, D. Suganthi
article en

Abstract

Performance under steady state conditions is investigated a model for non-Markovian batch arrival queuing with servers taking extended and brief vacations. In a Poisson stream with batches of varying sizes, clients arrive at the system. A mandatory long vacation or a mandatory short vacation of chance ω<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> may be chosen by the server with probability ω<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</inf> at each administration completion age. The service channel is presumptively susceptible to breakdowns, and when one occurs, it delays for the repairs to begin. This delay period occurs in two phases. The administration time, delay, short get-away, lengthy vacation time and the redesign process forms are distributed in this manner. Utilizing supplementary factors, we employ the additional variable approach. Under constant state conditions, we derive the line estimate appropriation for any age. In addition, we determine several essential system execution metrics. This broadens some models considered by a few writers. Finally, two fascinating individual examples are explored. Numerous numerical demonstrations have also been done to validate the authenticity of the hypothetical consequences.

Chennai Mathematical Institute (IN), Saveetha University (IN)
Openalex Percentile: Top 86%
Advanced Manufacturing and Logistics Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.