Comparing some Monte Carlo methods through a single server queue subject to catastrophes with control and batch service under multiple vacations

Abstract This paper considers a single server queue subject to catastrophes with service lateness which consists on control and service, in batch of fixed-size. Catastrophes can occur when the server is on service, or on vacation. Whenever a catastrophe occurs, all customers present in the system are destroyed immediately and the server goes for multiple vacations until it finds at least a batch of K customers in the queue, at which point the control period of this batch begins in the service lateness. After completion of the control time, this batch enters the service immediately. This proposed model is solved by giving explicit formulas for the steady-state probabilities and some performance measures. Numerical results are sketched out to illustrate the effect of the system parameters on the main performance measures. In addition, a Monte Carlo simulation is performed using three sampling methods to manage the proposed model with large batches. We used the generators “rand”, “goLHS” and “goRDS” to sample the inputs for the simulation. The results have shown that RDS improves significantly the studied performance measures of the queue compared to the Monte Carlo method and LHS by considering the variance reduction and the relative error as comparison criteria.

Authors

Institutions

Publication Details

Journal
Monte Carlo Methods and Applications
Published
2026-04-20
DOI
https://doi.org/10.1515/mcma-2026-3003
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Comparing some Monte Carlo methods through a single server queue subject to catastrophes with control and batch service under multiple vacations

Megdouda Ourbih-Tari, Hafida Saggou, Meriem Boubalou, Anfal Rezgui
Monte Carlo Methods and Applications
Advanced Queuing Theory Analysis
article

Comparing some Monte Carlo methods through a single server queue subject to catastrophes with control and batch service under multiple vacations

Megdouda Ourbih-Tari, Hafida Saggou, Meriem Boubalou, Anfal Rezgui
article en

Abstract

Abstract This paper considers a single server queue subject to catastrophes with service lateness which consists on control and service, in batch of fixed-size. Catastrophes can occur when the server is on service, or on vacation. Whenever a catastrophe occurs, all customers present in the system are destroyed immediately and the server goes for multiple vacations until it finds at least a batch of K customers in the queue, at which point the control period of this batch begins in the service lateness. After completion of the control time, this batch enters the service immediately. This proposed model is solved by giving explicit formulas for the steady-state probabilities and some performance measures. Numerical results are sketched out to illustrate the effect of the system parameters on the main performance measures. In addition, a Monte Carlo simulation is performed using three sampling methods to manage the proposed model with large batches. We used the generators “rand”, “goLHS” and “goRDS” to sample the inputs for the simulation. The results have shown that RDS improves significantly the studied performance measures of the queue compared to the Monte Carlo method and LHS by considering the variance reduction and the relative error as comparison criteria.

Monte Carlo Methods and Applications
University of Béjaïa (DZ), University of Algiers Benyoucef Benkhedda (DZ)
Openalex Percentile: Top 5%
Advanced Queuing Theory Analysis
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.