MODEL SISTEM ANTRIAN PADA PELAYANAN RESTORAN CEPAT SAJI (Studi Kasus di KFC Gajah Mada Kabupaten Jember)

KFC is one of the fast food restaurants in the Jember Regency which is never deserted of visitors, especially that on Gajah Mada Street. The purposes of this study were to determine the characteristics of the queuing system, analyze the queuing applied at KFC, formulate recommendations for improving the queuing system to reduce queuing, and minimize costs. The Data analysis was performed to compare manual calculations and simulation methods using ARENA 14.0. The characteristics of the current queue at KFC are random and unlimited arrival patterns, FIFO (first in first out) queue discipline, and the design of the single phase multi channel queuing system. The queuing distribution used for arrival and service time was the exponential distribution. The queuing model notation at the M/M/2 cashier: FIFO/∞/∞. The recommended queuing model that can be applied was to add 1 cashier to 3 cashiers at a cost of Rp 150,560 from the scenario made. The performance variable in the scenario becomes less than the initial condition, which was ρ cashier becomes 188%, total Wq about 0.92 minutes, and Lq about 2 people. Adding these facilities changes the queuing model notation to (M/M/3: FIFO/∞/∞). Keywords: ARENA, FIFO queuing discipline KFC Jember, queuing system

A BIOLOGICALLY INSPIRED FLUID MODEL OF THE CYCLIC SERVICE SYSTEM

A deterministic fluid model in the form of nonlinear ordinary differential equations is developed to provide the description for a multichannel service system with service-in-random-order queue discipline, abandonment and re-entry, where servers are treated like enzyme molecules. The parametric analysis of the model’s fixed point is given, particularly, how the arrival rate of new customers affects the steady-state demand. It is also shown that the model implies a saturating clearing function (yield vs. demand) of the Karmarkar type providing the mean service time is much shorter than the characteristic waiting time.

A study on Non-Markovian Bulk Arrival And Bulk Service with Multiple Vacations

A queue or a waiting line, involves arriving customers who is waiting to be served at one or more service stations, by one or more servers. The term ‘customer’ may refer, for example, to a machine arriving at an inspection center or to a person arriving at a booking counter in a railway station. Customers are selected for service by certain rule known as queue discipline. The basic characteristics of a queuing system follows systematically (1) The arrival pattern of customer (2) The service pattern of servers (3) The queue discipline (4) The system capacity (5) Number of servers. If more than one arrival enters the system simultaneously, the input is said to Bulk Arrival. Customer may be served individually or in batches, in case of batch service the service system is called bulk service system.

An QPSL Queuing Model for Load Balancing in Cloud Computing

Load balancing is the process of distributing a workload among various servers. Queuing is the most common scenario for day-to-day applications. Queuing theory is used to study the problem of waiting lines. Queuing theory bridges the gap between service demands and the delay in replies given to users. The proposed QPSL Queuing Model makes use of M/M/k queue with FIFO queue discipline for load balancing in cloud computing. The model makes use of exponential distribution for calculating service rates and Poisson distribution for calculating waiting lines. The proposed QPSL queuing model is also compared with other existing queuing models for load balancing on various parameters. The experimental analysis depicts that QPSL model performed better in terms of service rate and response time.

Efficient priority queueing routing strategy on networks of mobile agents

As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in–first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.