Fuzzy Cost Computations of M/M/1 and M/G/1 Queueing Models
Journal of Advances in Mathematics and Computer Science · pp. 120–132 · Published 16 Oct 2013
10.9734/BJMCS/2014/4353Abstract
In this paper two models of planning queuing system and its effect on the cost of the each system by using two fuzzy queuing models of M/M/1 and M/G/1 are studied. These two fuzzy queuing models based on the cost of each model are compared and fuzzy ranking methods are used to select the optimal model due to the resulted complexity. Fuzzy queuing is more practical and realistic than deterministic queuing models. The basic idea is to transform a fuzzy queuing cost problem to a family of conventional crisp queue cost problem by applying the α-cut approach and Zadeh’s extension principle. A set of parametric nonlinear programs are developed to calculate the lower and upper bound of the minimal expected total cost per unit time at α, through which the membership function of the total cost is constructed. Numerical example is illustrated to check the validity of the proposed method.
Cited by 1
· Journal of Pure and Applied Mathematics Advances and Applications · 2016
Related research
- A Heuristic Algorithm for Solving Two Person Zero Sum Game Using Triangular Fuzzy Number — shares topic coverage
- A Study of Fuzzy Relation and Its Application in Medical Diagnosis — shares topic coverage
- Comparative Analysis of Post University Matriculation Examination in Nigerian Universities Using Fuzzy Logic — shares topic coverage
Article metrics
Real usage data collected on this platform.
7
Page views
0
PDF downloads
0
Outbound clicks
1
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.