This paper includes a simulation model built in order to predict the performance indicessuch aswaiting time by analyzing queue’s components in the real world under uncertain and subjective situation. The objective of this paper is to predict the waiting time of each customer in an M/M/C queuing model. In this regard, to enable decision makers to obtain useful results with enough knowledge on th...

In this paper we present an approximate discrete time analysis of the machine interference problem with generally distributed working failure and walking times We analyze the corresponding asymmetric polling system consisting of N separate closed queuing stations bu er and server each of which contains a single customer These queuing stations are attended to by a common server in a cyclic manne...

Design: We used a queuing theory model to simulate 3 different potential solutions to decrease the delay from patient identification to connection with discharge services. Measurements: The measures included average rate at which patients were being connected to the post discharge heart failure services program, average number of patients in line, and average patient waiting time. Results: Usin...

Queuing theory is a major topic of applied mathematics that deals with phenomenon of waiting and arises from the use of powerful mathematical analysis to describe production processes. This study examines the use of production capacity of facilities in Fujitsu Components (M) Sdn. Bhd. based on queuing theory. The aim of this study is to achieve an appropriate queuing analytical model and determ...

The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on in both categories, the connection between these was poorly understood so far. In this work we build by specifying a (competitive) model, which is terms of time, proving its convergence...

today, in a competitive market, service organizations and producers have a great attention to optimization and customer satisfaction in order to become competitive. service organization must reduce the number of arrival, waiting time and service time in the queue to increase the customer satisfaction. in this paper by the aim of queuing theory we analyze the optimal amount of increment in a rep...

The class of Gaussian processes is one of the most widely used families of stochastic processes for modeling dependent data observed over time, or space, or time and space. The popularity of such processes stems primarily from two essential properties. First, a Gaussian process is completely determined by its mean and covariance functions. This property facilitates model fitting as only the fir...

We look at routing and scheduling problems on Kelly type networks where the injection process is under the control of an adversary. The novelty of the model we consider is that the adversary injects requests of distinct types. Resources are subject to switch-over delays or setups when they begin servicing a new request class. In this new setting, we study the behavior of sensible policies as in...

The investigation of security lines and the stochastic processes that personify them is known as queuing theory. Its goal to use mathematics understand real-world scenarios, for example, a massive crowd waiting in line at bank, or tasks lining up on your smartphone's back end. In linear programming, how long wait time extent is, regularly hoped be which can achieved using models. does not alway...

In this paper we present an approximate discrete-time analysis of the machine interference problem with generally distributed working, failure, and walking times. We analyze the corresponding asymmetric polling system consisting of N separate closed queuing stations (buuer and server), each of which contains a single customer. These queuing stations are attended to by a common server in a cycli...