Convexity Conditions for Optimizing a Single Server Discrete-time Queueing System under a Randomized Cutoff Policy

Shweta Upadhyaya, Divya Agarwal () and Shree Vaishnawi
Additional contact information
Shweta Upadhyaya: Department of Mathematics, School of Computer Science Engineering and Technology, Bennett University
Divya Agarwal: Amity Institute of Applied Sciences, Amity University
Shree Vaishnawi: Amity Institute of Applied Sciences, Amity University

Methodology and Computing in Applied Probability, 2025, vol. 27, issue 3, 1-26

Abstract: Abstract This research aims to investigate convexity conditions for a single server discrete-time queueing system with setback (disaster). The system operates under a randomized threshold policy $$\left(p,\;N\right)$$ p , N , where the server activates with probability $$p$$ p when queue length reaches threshold $$N$$ N , or remains idle with probability $$1-p$$ 1 - p , providing flexible control over system congestion and resource utilization. This policy is particularly important in systems prone to sudden disruptions, as it helps optimize service efficiency while managing system recovery after setbacks. First, we perform the convexity analysis analytically for the discrete parameter $$N$$ N . Then the optimal queue length for the best value of $$N$$ N is determined. Also, as the optimization problem for finding the optimal value of continuous parameter $$p$$ p is a linear fractional programming problem thus Charnes and Cooper method is used to get the best value of $$p$$ p . Furthermore, by constructing a cost function and using the direct search method and firefly algorithm, the minimum cost is estimated. The goal of this work is to show how convexity in a discrete-time work frame can provide fresh perspectives on existing problems and lead to significantly simpler analyses and algorithm modifications. Also we compare analytical results with that of ANFIS (Adaptive Neuro-Fuzzy Inference System) results which validate our findings.

Keywords: Geo/G/1 queueing model; Setback; Cutoff policy; Convexity analysis; Cost optimization via Firefly algorithm; ANFIS (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11009-025-10183-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:27:y:2025:i:3:d:10.1007_s11009-025-10183-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-025-10183-5

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().