SpringerLink
Log in

A greedy post-processing strategy for multi-objective performance optimization of general single-server finite queueing networks

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Several real-life problems are comprised of finite single-server acyclic queueing networks. The performance optimization of these queueing networks has been the subject of several studies. The present study extends the minimization of the total buffer area and overall service rates in the network simultaneously with the maximization of throughput. It is well known that these three objectives are conflicting. This fact leads to a multi-objective approach that the literature in the area has already addressed. Nevertheless, this study aims to demonstrate that there are algorithms with low computational costs that can produce solutions more efficiently than those obtained previously. Furthermore, the provided solutions can enhance throughput by solving a stochastic knapsack problem. The greedy procedure utilizes a technique of redistributing buffers between the queues, ensuring that the overall capacity is less than or equal to the previous overall capacity; thus, one objective is improved (the throughput) without compromising the other objective (total buffer allocation). Several computational experiments attest to the quality of this proposition. In addition, we provide a comparison with previously proposed solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Algorithm 1
Algorithm 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Availability of data and materials

Data were not utilized to support the findings of this study.

Code availability

The proposed algorithms can be encoded in the reader’s choice of programming language.

References

  • Abdul-Kader W (2006) Capacity improvement of an unreliable production line—an analytical approach. Comput Oper Res 33(6):1695–1712

    Article  Google Scholar 

  • Chehade H, Yalaoui F, Amodeo L, Guglielmo PD (2009) Optimisation multi-objectif pour le problème de dimensionnement de buffers. J Decis Syst 18(2):257–287

    Article  Google Scholar 

  • Cruz FRB, Duarte AR, van Woensel T (2008) Buffer allocation in general single-server queueing networks. Comput Oper Res 35(11):3581–3598

    Article  Google Scholar 

  • Cruz FRB, van Woensel T, Smith JM (2010) Buffer and throughput trade-offs in \(M/G/1/K\) queueing networks: a bi-criteria approach. Int J Prod Econ 125(2):224–234

  • Cruz FRB, Kendall G, While L, Duarte AR, Brito NCL (2012) Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers. Math Probl Eng 2012:19. Article ID 692593

  • Cruz FRB, Duarte AR, Souza GL (2018) Multi-objective performance improvements of general finite single-server queueing networks. J Heuristics 24(5):757–781

    Article  Google Scholar 

  • Cruz FRB, Quinino RC, Ho LL (2020) Control charts for traffic intensity monitoring of Markovian multiserver queues. Qual Reliab Eng Int 36(1):354–364

    Article  Google Scholar 

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  • Dolgui A, Eremeev A, Kolokolov A, Sigaev V (2002) A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines. J Math Model Algorithms 1(2):89–104

    Article  MathSciNet  Google Scholar 

  • Dolgui AB, Eremeev AV, Sigaev VS (2017) Analysis of a multicriterial buffer capacity optimization problem for a production line. Autom Remote Control 78(7):1276–1289

    Article  MathSciNet  Google Scholar 

  • D’Souza KA, Khator SK (1997) System reconfiguration to avoid deadlocks in automated manufacturing systems. Comput Ind Eng 32(2):455–465

    Article  Google Scholar 

  • Edmonds J (1971) Matroids and the greedy algorithm. Math Program 1:127–136

    Article  MathSciNet  Google Scholar 

  • Hajek B (1988) Cooling schedules for optimal annealing. Math Oper Res 13(2):311–329

    Article  MathSciNet  Google Scholar 

  • Hamada M, Martz HF, Berg EC, Koehler AJ (2006) Optimizing the product-based availability of a buffered industrial process. Reliab Eng Syst Saf 91(9):1039–1048. Special Issue - Genetic Algorithms and Reliability

  • Huffman DA (1952) A method for the construction of minimum-redundancy codes. Proc IRE 40(9):1098–1101

    Article  Google Scholar 

  • Kendall DG (1953) Stochastic processes occurring in the theory of queues and their analysis by the method of embedded Markov chains. Ann Math Stat 24:338–354

    Article  Google Scholar 

  • Kerbache L, MacGregor Smith J (1987) The generalized expansion method for open finite queueing networks. Eur J Oper Res 32:448–461

    Article  MathSciNet  Google Scholar 

  • Kimura T (1996) A transform-free approximation for the finite capacity \(M/G/s\) queue. Oper Res 44(6):984–988

    Article  Google Scholar 

  • Kumar A, Jain M (2023) Cost optimization of an unreliable server queue with two stage service process under hybrid vacation policy. Math Comput Simul 204:259–281

    Article  MathSciNet  Google Scholar 

  • Lin FT (2008) Solving the knapsack problem with imprecise weight coefficients using genetic algorithms. Eur J Oper Res 185(1):133–145

    Article  Google Scholar 

  • MacGregor Smith J (2003) \(M/G/c/k\) blocking probability models and system performance. Perform Eval 52(4):237–267

    Article  Google Scholar 

  • MacGregor Smith J (2004) Optimal design and performance modelling of \(M/G/1/k\) queueing systems. Math Comput Model 39(9–10):1049–1081

    Article  MathSciNet  Google Scholar 

  • MacGregor Smith J, Chikhale N (1995) Buffer allocation for a class of nonlinear stochastic knapsack problems. Ann Oper Res 58(5):323-360

    Article  MathSciNet  Google Scholar 

  • MacGregor Smith J, Cruz FRB (2005) The buffer allocation problem for general finite buffer queueing networks. IIE Trans 37(4):343–365

    Article  Google Scholar 

  • Martins HSR, Cruz FRB, Duarte AR, Oliveira FLP (2019) Modeling and optimization of buffers and servers in finite queueing networks. OPSEARCH 56(1):123–150

    Article  MathSciNet  Google Scholar 

  • Qi D, Li Z, Zi X, Wang Z (2017) Weighted likelihood ratio chart for statistical monitoring of queueing systems. Qual Technol Quant Manag 14(1):19–30

    Article  Google Scholar 

  • Spieckermann S, Gutenschwager K, Heinzel H, Voß S (2000) Simulation-based optimization in the automotive industry—a case study on body shop design. Simulation-California- 75(5/6):276–286

    Google Scholar 

  • van Woensel T, Cruz FRB (2014) Optimal routing in general finite multi-server queueing networks. PLoS ONE 9(7):e102075

    Article  Google Scholar 

  • Wu C-H, Yang D-Y (2021) Bi-objective optimization of a queueing model with two-phase heterogeneous service. Comput Oper Res 130:105230

    Article  MathSciNet  Google Scholar 

  • Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm. Report, ETH Zurich, Zurich

Download references

Funding

ARD acknowledges UFOP (Universidade Federal de Ouro Preto) for partial financial support. FRBC acknowledges CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico), grant 305442/2022-8) and FAPEMIG (Fundação de Amparo à Pesquisa do Estado de Minas Gerais, grant CEX-PPM-00564-17) for partial financial support.

Author information

Authors and Affiliations

  1. Departamento de Estatística, Universidade Federal de Ouro Preto, Ouro Preto, MG, 35400-000, Brazil

    Anderson R. Duarte

  2. Departamento de Estatística, Universidade Federal de Minas Gerais, Belo Horizonte, MG, 31270-901, Brazil

    Frederico R. B. Cruz

  3. Departamento de Computação, Universidade Federal de Ouro Preto, Ouro Preto, MG, 35400-000, Brazil

    Gabriel L. Souza

Authors
  1. Anderson R. Duarte
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frederico R. B. Cruz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gabriel L. Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

ARD, FRBC, and GLS contributed equally to the design and implementation of the research, analysis of the results, and final writing of the manuscript.

Corresponding author

Correspondence to Anderson R. Duarte.

Ethics declarations

Conflict of interest

The funder had no role in the study design, data collection and analysis, publication decision, or manuscript preparation. The authors declare no conflicts of interest regarding the publication of this article.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Duarte, A.R., Cruz, F.R.B. & Souza, G.L. A greedy post-processing strategy for multi-objective performance optimization of general single-server finite queueing networks. Soft Comput (2024). https://doi.org/10.1007/s00500-024-09717-9

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00500-024-09717-9

Keywords

Search

Navigation