Nonlinear Programming Models for Robust Queuing Systems under Fuzzy Sets

Hasanain Hamed Ahmed

doi:10.47134/ppm.v2i4.1991

Authors

Hasanain Hamed Ahmed Imam Al-Kadhim (PBUH) University College

DOI:

https://doi.org/10.47134/ppm.v2i4.1991

Keywords:

Nonlinear Programming, Robust Queue, Fuzzy Sets, Theory of Robustness, Modelling of Nonlinear

Abstract

This paper proposes a procedure for constructing the membership functions of performance measures in finite-capacity queuing systems where both arrival and service rates are represented as fuzzy numbers. By applying the (\alpha)-cut method, a fuzzy queue with finite capacity is transformed into a family of conventional crisp queues, allowing for more precise modeling of system characteristics. The study focuses on a queuing model with an unreliable server, where key parameters such as service and breakdown rates are fuzzy values. The developed parametric nonlinear programming approach facilitates the derivation of new constraints, providing a robust framework for analyzing queuing behaviors under uncertainty. The findings demonstrate that the proposed fuzzy mathematical model yields more realistic outcomes than traditional crisp models, thereby enhancing the applicability of queuing theory in practical scenarios.

References

Aggarwal, S. & Sharma, U. (2013). A Computational Procedure for Solving a Non-Convex Multi-Objective Quadratic Programming under a Fuzzy Environment. https://arxiv.org/pdf/1308.0122 DOI: https://doi.org/10.12732/ijpam.v89i4.6

Ameur, L. & Bachioua, L. (2021). Sensitivity analysis of queueing models based on the polynomial chaos approach. https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8475466/ DOI: https://doi.org/10.1007/s40065-021-00344-y

Bogachev, T. (2022). Optimization of the fluid model of scheduling: local predictions. https://arxiv.org/pdf/2209.04745

Bunched, M., Tadj, L., & Hedjar, R. (2019). Steady-State Analysis of a Flexible Markovian Queue with Server Breakdowns. https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7514740/

E. Stecke, K. (1986). On the nonconcavity of throughput in specific closed queueing networks. http://deepblue.lib.umich.edu/bitstream/2027.42/25952/1/0000018.pdf

George Remias, M. (2012). Computational studies of some fuzzy mathematical problems. https://core.ac.uk/download/195631821.pdf

Guillaume, R., Kobylanski, P., & Zielinski, P. (2012). A Robust Lot Sizing Problem with Ill-known Demands. https://arxiv.org/pdf/1210.5386 DOI: https://doi.org/10.1016/j.fss.2012.01.015

J. Bertsimas, D., Gamarnik, D., & Anatolyevich Rikun, A. (2009). Performance analysis of queueing networks via robust optimization. https://core.ac.uk/download/4427655.pdf

Leonardi, E. (2013). Throughput Optimal Scheduling Policies in Networks of Interacting Queues. https://arxiv.org/pdf/1304.2554

S. H. van Leeuwaarden, J., W. J. Mathijsen, B., & Zwart, B. (2017). Economies-of-scale in resource sharing systems: tutorial and partial review of the QED heavy-traffic regime. https://arxiv.org/pdf/1706.05397

Teja Thimphu, S. & Rajawat, K. (2019). Optimal Design of Queuing Systems via Compositional Stochastic Programming. https://arxiv.org/pdf/1907.08774