Modeling and optimization of buffers and servers in finite queueing networks

Martins, Helgem de Souza Ribeiro; Cruz, Frederico R. B.; Duarte, Anderson Ribeiro; Oliveira, Fernando Luiz Pereira de

doi:10.1007/s12597-019-00362-7

Cited by 8 publications

(7 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Substituting equations (22) and (33) into 28, we get Finally, in order to obtain P 0,0 , we use the normalization condition given as Substituting equations (32) and (34) into (35), we get…”

Section: This Impliesmentioning

confidence: 99%

“…The optimization of manufacturing/production, telecommunication and computer systems using queueing theory has been the subject of many studies in recent decades. Interesting papers in this area include the research works of Whitt [31] in open and closed queueing networks, Dallery and Gershwin [32], which describe the main queueing models and the results of the literature on the production lines, Cruz et al [33], which present the optimization of the performance of general finite single-server acyclic queueing networks, and Martins et al [34], which present performance analysis and optimization of buffers and servers in finite queueing networks.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Single Server Batch Arrival Bernoulli Feedback Queueing System with Waiting Server, K-Variant Vacations and Impatient Customers

Bouchentouf

Guendouzi

2021

SN Oper. Res. Forum

View full text Add to dashboard Cite

We consider an infinite capacity batch arrival single server Markovian Bernoulli feedback queueing system with waiting server, K-variant vacations, impatient customers and retention of reneged customers. The model is analyzed using probability generating function (PGF) technique. Various queueing system characteristics are derived. Then, by setting the appropriate parameters, some special cases are discussed. Moreover, a cost model for the queueing system is developed. The parameter optimization is numerically illustrated using particle swarm optimization (PSO). Finally, numerical results are provided to explore the impact of system parameters on performance measures and costs of the queueing system.

show abstract

“…Substituting equations (22) and (33) into 28, we get Finally, in order to obtain P 0,0 , we use the normalization condition given as Substituting equations (32) and (34) into (35), we get…”

Section: This Impliesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Single Server Batch Arrival Bernoulli Feedback Queueing System with Waiting Server, K-Variant Vacations and Impatient Customers

Bouchentouf

Guendouzi

2021

SN Oper. Res. Forum

View full text Add to dashboard Cite

show abstract

“…6,7 The performance of the AGVTS can then be evaluated using solution methods for the queueing network model. 8,9 Nakano and Ohno 10 proposed a decomposition algorithm to calculate the cycle time of an AGVTS. Fazlollahtabar et al 11 proposed a mathematical programing approach integrated with performance analysis to optimize the flexible manufacturing systems involving AGVs.…”

Section: Introductionmentioning

confidence: 99%

Throughput evaluation of AGV transportation systems based on queueing modeling and AGV route decomposition

Gao

Kobayashi

Tajiri

et al. 2022

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

Automated guided vehicle (AGV) transportation systems are an important component of flexible warehouse systems, and research on the performance evaluation of AGV transportation systems contributes to the optimization and decision-making of flexible warehouse systems. Compared to simulation and experimental methods, analytic methods require less computational time, which is more applicable when integrated with optimization and decision-making methods. However, the previous analytical methods for performance evaluation neglected the velocity change and collision avoidance of AGVs, which decreased the evaluation accuracy. Therefore, herein, a throughput evaluation methodology based on AGV route decomposition is proposed for AGV transportation systems. In the proposed methodology, an AGV transportation system is modeled as an open queueing network model considering the velocity change of AGVs. The open queueing network model is decomposed into sub-models based on preplanned AGV routes, considering the collision avoidance among AGVs, to decrease the analysis complexity and computational time. Finally, the throughput of the AGV transportation system is obtained by the throughput sum of the sub-models corresponding to the unload stations. The numerical results indicate that the proposed methodology evaluates the throughput of an AGV transportation system with an accuracy of ≥94%. This study will facilitate the efficient throughput and decision-making of AGV transportation systems.

show abstract

“…[4][5][6] In general, basic queueing models are applied as approximations for complex computer and telecommunication networks, 7,8 manufacturing and service systems, [9][10][11][12] and, more recently, health care systems, [13][14][15] among others. [4][5][6] In general, basic queueing models are applied as approximations for complex computer and telecommunication networks, 7,8 manufacturing and service systems, [9][10][11][12] and, more recently, health care systems, [13][14][15] among others.…”

Section: Introductionmentioning

confidence: 99%

“…The use of queueing models has been the subject of a number of research studies, 1-3 mainly due to their ability to approximately represent industrial systems. [4][5][6] In general, basic queueing models are applied as approximations for complex computer and telecommunication networks, 7,8 manufacturing and service systems, [9][10][11][12] and, more recently, health care systems, [13][14][15] among others. In particular, M∕M∕s queues are one of the most basic queueing models, 16 which, in Kendall notation, stand for Markovian arrivals with rate , exponential service times with average 1∕ , and s parallel identical servers.…”

Section: Introductionmentioning

confidence: 99%

Control charts for traffic intensity monitoring of Markovian multiserver queues

Cruz

Quinino

2019

Quality & Reliability Eng

Self Cite

View full text Add to dashboard Cite

A number of recent research studies have applied queueing theory as an approximate modeling tool to mathematically describe industrial systems, which include manufacturing, distribution, and service, for instance. Among the main observable characteristics in queues, the number of users in the system can be controlled to keep waiting times as minimal as possible. The design of efficient control charts is an attempt to monitor and control such systems. Control charts are proposed to monitor infinite queues with Markovian arrivals, exponential service times, and s identical parallel servers. The proposed charts monitor traffic intensities, which are the ratio between the arrival rate and the service rate, estimated through the number of users in the queueing system at random epochs. The effectiveness and efficiency of the proposed approaches in terms of the average run lengths are established by a comprehensive set of Monte Carlo simulations. KEYWORDS attribute control charts, average run length, Markovian queues, quality control wileyonlinelibrary.com/journal/qre [Colour figure can be viewed at wileyonlinelibrary.com] [Colour figure can be viewed at wileyonlinelibrary.com] Frederico R. B. Cruz holds a bachelor's degree in electrical engineering (1988) as well as a master's degree (1991) and a doctorate (1997) in computer science from the Universidade Federal de Minas Gerais, where he is a full professor in the Department of Statistics and conducts research in operations research.Roberto C. Quinino has a PhD in production engineering from the Universidade de São Paulo (1998). He is currently a full professor at the Universidade Federal de Minas Gerais. He develops research on quality control and marketing engineering with an emphasis on stochastic modeling applications acting on the following subjects: Taguchi online, Markov chains, misclassification, optimization, control chart planning, regression analysis, planning of experiments, and conjoint analysis. He supervises undergraduate, specialization, master's, and doctoral students. He has published papers in several international journals.

show abstract

Modeling and optimization of buffers and servers in finite queueing networks

Cited by 8 publications

References 39 publications

Single Server Batch Arrival Bernoulli Feedback Queueing System with Waiting Server, K-Variant Vacations and Impatient Customers

Single Server Batch Arrival Bernoulli Feedback Queueing System with Waiting Server, K-Variant Vacations and Impatient Customers

Throughput evaluation of AGV transportation systems based on queueing modeling and AGV route decomposition

Control charts for traffic intensity monitoring of Markovian multiserver queues

Contact Info

Product

Resources

About