A computational algorithm for the CPP/M/c retrial queue.
Van Do, Tien (2008)
Annales Mathematicae et Informaticae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Service stations location problem”
A computational algorithm for the CPP/M/c retrial queue.
Computational procedures for a class of GI/D/ systems in discrete time.
Rahman, Md.Mostafizur, Alfa, Attahiru Sule (2009)
Journal of Probability and Statistics
Similarity:
A service points location problem with Min-Max distance optimality criterion
Oto Hudec, Karel Zimmermann (1993)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Modeling and optimization of M/G/1-type queueing networks: an efficient sensitivity analysis approach.
Tang, Liang, Xi, Hong-Sheng, Zhu, Jin, Yin, Bao-Qun (2010)
Mathematical Problems in Engineering
Similarity:
Sensitivity examination of the simulation result of discrete event dynamic systems with perturbation analysis.
Tamas Koltai, Juan Carlos Larrañeta, Luis Onieva, Sebastián Lozano (1994)
Qüestiió
Similarity:
Simulation completed with perturbation analysis provides a new approach for the optimal control of queuing network type systems. The objective of this paper is to calculate the sensitivity range of finite zero-order perturbation, that is, to determine the maximum and minimum size of perturbation within which zero-order propagation rules can be applied. By the introduction of the concept of virtual queue and first and second level no-input and full-output matrices, an algorithm is provided...