2014
DOI: 10.1016/j.mspro.2014.07.543
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Buffer Allocation in Tandem Closed Queuing Network with Single Server Using PSO

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
4
0
3

Year Published

2015
2015
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 8 publications
0
4
0
3
Order By: Relevance
“…The most common optimization criteria consider maximizing the average throughput rate (Gao, 2022;Gao, Higashi, Kobayashi, Taneda, Rubrico & Ota, 2020;Gao & Liu, 2023;Kassoul, Cheikhrouhou & Zufferey, 2023;Köse, Demir, Tunal & Eliiyi, 2015;Kose & Kilincci, 2015;Koyuncuoğlu & Demir, 2021;Lin & Chiu, 2018;Nahas, Nourelfath & Gendreau, 2014;Narasimhamu, Reddy & Rao, 2014;Patchong & Kerbache, 2017;Wang, Song, Shin & Moon, 2014), minimizing the total buffer size (Li, 2013;Weiss & Stolletz, 2015), minimizing the total cost of allocation (Magnanini, Terkaj & Tolio, 2022;Nahas, 2017;Nahas & Nourelfath, 2018;Ouzineb, Mhada, Pellerin & El Hallaoui, 2018;Tiacci, 2022), among others (Alfieri, Matta & Pastore, 2020;Hernández-Vázquez, Hernández-González, Jiménez-García, Hernández-Ripalda & Hernández-Vázquez, 2019;Hernández-Vázquez, Hernández-González, Hernández-Vázquez, Figueroa-Fernández & Cancino de la Fuente, 2022b;Koyuncuoğlu & Demir, 2023;Shaaban & Romero-Silva, 2021;Shao, Moroni, Li, & Xu, 2022;Xi, Smith, Chen, Mao, Zhang & Yu, 2021;Zhou, Liu, Yu & Tao, 2018).…”
Section: Buffer Allocation Problemmentioning
confidence: 99%
“…The most common optimization criteria consider maximizing the average throughput rate (Gao, 2022;Gao, Higashi, Kobayashi, Taneda, Rubrico & Ota, 2020;Gao & Liu, 2023;Kassoul, Cheikhrouhou & Zufferey, 2023;Köse, Demir, Tunal & Eliiyi, 2015;Kose & Kilincci, 2015;Koyuncuoğlu & Demir, 2021;Lin & Chiu, 2018;Nahas, Nourelfath & Gendreau, 2014;Narasimhamu, Reddy & Rao, 2014;Patchong & Kerbache, 2017;Wang, Song, Shin & Moon, 2014), minimizing the total buffer size (Li, 2013;Weiss & Stolletz, 2015), minimizing the total cost of allocation (Magnanini, Terkaj & Tolio, 2022;Nahas, 2017;Nahas & Nourelfath, 2018;Ouzineb, Mhada, Pellerin & El Hallaoui, 2018;Tiacci, 2022), among others (Alfieri, Matta & Pastore, 2020;Hernández-Vázquez, Hernández-González, Jiménez-García, Hernández-Ripalda & Hernández-Vázquez, 2019;Hernández-Vázquez, Hernández-González, Hernández-Vázquez, Figueroa-Fernández & Cancino de la Fuente, 2022b;Koyuncuoğlu & Demir, 2023;Shaaban & Romero-Silva, 2021;Shao, Moroni, Li, & Xu, 2022;Xi, Smith, Chen, Mao, Zhang & Yu, 2021;Zhou, Liu, Yu & Tao, 2018).…”
Section: Buffer Allocation Problemmentioning
confidence: 99%
“…• Formulación con un sólo objetivo: Los criterios de optimización más comunes consideran maximizar la tasa promedio de producción o throughput rate (Nahas et al, 2014;Wang et al, 2014;Narasimhamu et al, 2014;Kose and Kilincci, 2015;Köse et al, 2015;Patchong and Kerbache, 2017;Lin and Chiu, 2018;Koyuncuoğlu and Demir, 2021), minimizar el tamaño total del buffer (Li, 2013;Weiss and Stolletz, 2015), minimizar el costo total de la asignación (Nahas, 2017;Nahas and Nourelfath, 2018;Ouzineb et al, 2018), entre otros (Zhou et al, 2018;Hernández-Vázquez et al, 2019;Alfieri et al, 2020;Shaaban and Romero-Silva, 2020;Xi et al, 2021).…”
Section: Introductionunclassified
“…Recientemente en el estudio del BAP, las técnicas metaheurísticas han reportado con mucho éxito soluciones de mayor calidad en tiempos relativamente cortos. Algunas de las técnicas utilizadas son: Búsqueda Tabú (Costa et al, 2015), Recocido Simulado (Spinellis and Papadopoulos, 2000a, b), (Spinellis et al, 2000), Algoritmos Genéticos (Spinellis and Papadopoulos, 2000b), (Cruz et al, 2012), (Nahas et al, 2014), (Nahas and Nourelfath, 2018) Colonia de Hormigas (Nahas et al, 2009), (Nahas and Nourelfath, 2018) y Optimización por Enjambre de Partículas (Narasimhamu et al, 2014(Narasimhamu et al, , 2015.…”
Section: Introductionunclassified