SIMULASI ANTRIAN MULTIPLE SERVER DENGAN TIPE KEDATANGAN BERKELOMPOK

Abstract

Waiting in a queue is a phenomenon in everyday life. Queue associated with all aspects of a situation where customers have to wait for a given service. Queuing models discussed in this study is the queue where customers come in groups follow a Poisson process. The number of subscribers in each group is a random variable (denoted by X) and the time between arrivals is exponential distribution. The service time is done with an exponential distribution, then the model queue becomes M^[X]/M/C. Processing served by many servers (denoted by C) with FIFO queuing discipline. This study used a simulation to calculate the average customer wait time in the queue, the average waiting time of customers in the system, the average number of customers in the queue, the average number of customers in the system and the probability of a busy server. Purpose of this study is to simulate multiple server queue with the arrival patterns in groups and can determine system performance through results obtained from the completion of the simulation.