Search published articles


Showing 3 results for Queuing Theory

Ali Habibi Badrabadi , Mohammad Jafar Tarokh,
Volume 21, Issue 4 (12-2010)
Abstract

  Response time is one of the critical web service quality dimensions. It refers to how long it takes that a web service responds to request of a user. In order to manage the response time, pricing schemes can work as an efficient access control mechanism. In this paper, we study competition between two providers offering functionally same web services where there is a monopoly service provider. The monopoly offers a service that is complementary to their services. Each provider needs to decide a service level (L or H) and a corresponding price for the selected service level to meet the service level guarantee. We construct a Stackelberg game and benefit from queuing theory concept to propose a model that can examine strategic choices of the providers .


Parviz Fattahi, Bahman Ismailnezhad,
Volume 27, Issue 2 (6-2016)
Abstract

In this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. Since cell formation problem is NP-Hard, two algorithms based on genetic and modified particle swarm optimization (MPSO) algorithms are developed to solve the problem. For generating initial solutions in these algorithms, a new heuristic method is developed, which always creates feasible solutions. Moreover, full factorial and Taguchi methods are implemented to set crucial parameters in the solutions procedures. Deterministic method of branch and bound (B&B) algorithm is used to evaluate the results of modified particle swarm optimization algorithm and the genetic algorithm. The results indicate that proposed algorithms have better performance in quality of the metaheurstic algorithms final answer and solving time compared with the method of Lingo software’s B&B algorithm. The solution of two metaheurstic algorithms is compared by t test. Ultimately, the results of numerical examples indicate that considering reliability has significant effect on block structures of machine-part matrixes.


Ebrahim Teimoury, Farshad Saeedi, Ahmad Makui,
Volume 28, Issue 1 (3-2017)
Abstract

Recently, urbanization has been expanded rapidly in the world and a number of metropolitan areas have been appeared with a population of more than 10 million people. Because of dense population in metropolitan and consequently increasing the delivery of goods and services, there has been a lot of problems including traffic congestion, air pollution, accidents and high energy consumption. This made some complexities in distribution of urban goods; Therefore, it is essential to provide creative solutions to overcome these complexities. City logistics models can be effective in solving these complexities.

In this paper, concepts and definitions related to city logistics are explained to provide a mathematical model in order to design city logistics distribution network aim at minimizing response times. This objective is effective for goods and emergency services, especially in times of crisis and also for goods that are delivered as soon as possible. This is a three-level network and has been used in modeling of queuing theory. To validate the model, a numerical example has been established and results of the model have been explained using BARON solver in Gams software. Finally, conclusions and recommendations for future research are presented.



Page 1 from 1