scholarly journals SIMULATION OF QUEUE PATIENT SERVICE

2017 ◽  
Vol 1 (1) ◽  
Author(s):  
Hendra Cipta
Keyword(s):  
Queue Length ◽  
Busy Period ◽  
Test Calculation ◽  
Queuing Model ◽  
Average Speed ◽  
System Parameters ◽  
Everyday Activities ◽  
Measured System ◽  
Patient Service ◽  
Velocity Average

<p>Queue is one of the phenomena that occur in everyday activities experienced by everyone. As a result of this queue many people turn to other places to avoid a queue and get more leverage. The purpose of this study is to study the performance of the queue system by modeling a single queue simulation. From the analysis of distribution test calculation will be obtained by queuing model. The measured system parameters are expected average speed velocity, average service speed expectation, chance of busy period, probability of all patient service in system, expectation of queue length, expectation of waiting time in system, and waiting expectation in queue.<br />Keywords: distribution test, queuing model, and system parameters</p>

scholarly journals Comparing an Approximate Queuing Approach with Simulation for the Solution of a Cross-Docking Problem

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Roberta Briesemeister ◽  
Antônio G. N. Novaes
Keyword(s):  
Queue Length ◽  
Computational Analysis ◽  
Queuing Model ◽  
Simulated Model ◽  
Final Destination ◽  
Cross Docking ◽  
Efficiency Performance ◽  
Management Concept ◽  
Intermediate Facilities ◽  
To Receive

Cross-docking is a logistics management concept in which products are temporarily unloaded at intermediate facilities and loaded onto output trucks to be sent to their final destination. In this paper, we propose an approximate nonstationary queuing model to size the number of docks to receive the trucks, so that their unloading will be as short as possible at the receiving dock, thus making the cross-docking process more efficient. It is observed that the stochastic queuing process may not reach the steady equilibrium state. A type of modeling that does not depend on the stationary characteristics of the process developed is applied. In order to measure the efficiency, performance, and possible adjustments of the parameters of the algorithm, an alternative simulation model is proposed using the Arena® software. The simulation uses analytic tools to make the problem more detailed, which is not allowed in the theoretical model. The computational analysis compares the results of the simulated model with the ones obtained with the theoretical algorithm, considering the queue length and the average waiting time of the trucks. Based on the results obtained, the simulation represented very well the proposed problem and possible changes can be easily detected with small adjustments in the simulated model.

scholarly journals Optimization of Healthy Service by Implementing the System Queues on Social Insurance Administration Organization (BPJS) in Dr. H. Marzoeki Mahdi Hospital in Bogor

2019 ◽  
Vol 8 (2S7) ◽  
pp. 134-137
Keyword(s):  
Management System ◽  
Social Insurance ◽  
Busy Period ◽  
Arrival Rate ◽  
S Model ◽  
Patient Service

Patient queue buildup on Social Insurance Administration Organization (BPJS) in the Dr. H. Marzoeki Mahdi hospital (RSMM) in Bogor is a problem that often occurs. This is caused by the patient's arrival rate exceeds the service facilities provided. To reduce the buildup of queues and improve services, queueing M/M/S model is applied in BPJS patient. M/M/S model is used so that the Ministry can optimize the management system as well as reduce queues at the BPJS patients patient service (TPP) in Bogor RSMM. On-site system queues on the TPP can be done at a time when the number of staff service (counter) at least 5 officers of service so that in addition to be able to reduce the chance of a busy period of previous service officer can also optimize on-site services, but for the wait and cost expenditures costs of facilities not significant therefore need to add 1 more Ministry officials became 6 officer's service in order to improve the facilities of the Ministry on patients as well as patients BPJS TPP not too long to wait in the process the queue.

scholarly journals Big Jobs Arrive Early: From Critical Queues to Random Graphs

2020 ◽  
Vol 10 (4) ◽  
pp. 310-334
Author(s):  
Gianmarco Bet ◽  
Remco van der Hofstad ◽  
Johan S. H. van Leeuwaarden
Keyword(s):  
Head Start ◽  
Random Graphs ◽  
Queue Length ◽  
Busy Period ◽  
Asymptotic Result ◽  
Service Requirement ◽  
Exploration Process ◽  
Asymptotic Regime ◽  
Long Period ◽  
Inhomogeneous Random Graphs

We consider a queue to which only a finite pool of n customers can arrive, at times depending on their service requirement. A customer with stochastic service requirement S arrives to the queue after an exponentially distributed time with mean S-α for some [Formula: see text]; therefore, larger service requirements trigger customers to join earlier. This finite-pool queue interpolates between two previously studied cases: α = 0 gives the so-called [Formula: see text] queue and α = 1 is closely related to the exploration process for inhomogeneous random graphs. We consider the asymptotic regime in which the pool size n grows to infinity and establish that the scaled queue-length process converges to a diffusion process with a negative quadratic drift. We leverage this asymptotic result to characterize the head start that is needed to create a long period of activity. We also describe how this first busy period of the queue gives rise to a critically connected random forest.

On the many server queue with exponential service times

1973 ◽  
Vol 5 (1) ◽  
pp. 170-182 ◽  
Author(s):  
J. H. A. De Smit
Keyword(s):  
Waiting Time ◽  
Queue Length ◽  
Busy Period ◽  
Virtual Waiting Time ◽  
Server Queue ◽  
Poisson Arrivals ◽  
Service Times ◽  
The Many ◽  
Special Case ◽  
Busy Cycle

The general theory for the many server queue due to Pollaczek (1961) and generalized by the author (de Smit (1973)) is applied to the system with exponential service times. In this way many explicit results are obtained for the distributions of characteristic quantities, such as the actual waiting time, the virtual waiting time, the queue length, the number of busy servers, the busy period and the busy cycle. Most of these results are new, even for the special case of Poisson arrivals.

Controlling of Traffic Lights Using RFID Technology and Neural Network

2012 ◽  
Vol 433-440 ◽  
pp. 740-745 ◽  
Author(s):  
Sasan Mohammadi ◽  
Abolfazl Rajabi ◽  
Mostafa Tavassoli
Keyword(s):  
Neural Network ◽  
Radio Frequency Identification ◽  
Queue Length ◽  
New Technology ◽  
Weather Condition ◽  
Access Point ◽  
Rfid Technology ◽  
Average Speed ◽  
Traffic Lights ◽  
Frequency Identification

In this paper, the new technology of RDIF (Radio Frequency Identification) has been used in order to identify vehicles and also 3 significant parameters including the average speed of vehicles at any side of access point, the average time for waiting and the queue length. They have been used based on the data from neural network for making the best decision throughout the process of finding out duration of the cycle and percentage of green time for each of the access point. Implementation of this system is possible in the shortest time and it has a better function in any kind of weather condition, time or place compared to similar systems.

The Trivariate Distribution of the Maximum Queue Length, the Number of Customers Served and the Duration of the Busy Period for the M/G/1 Queueing System

1969 ◽  
Vol 6 (1) ◽  
pp. 154-161 ◽  
Author(s):  
E.G. Enns
Keyword(s):  
Queue Length ◽  
Busy Period ◽  
Queueing System ◽  
Single Server ◽  
List Type ◽  
Type Number ◽  
Distribution Of The Maximum ◽  
Maximum Queue Length ◽  
Number Of Customers

In the study of the busy period for a single server queueing system, three variables that have been investigated individually or at most in pairs are:1.The duration of the busy period.2.The number of customers served during the busy period.3.The maximum number of customers in the queue during the busy period.

A single server tandem queue

1971 ◽  
Vol 8 (1) ◽  
pp. 95-109 ◽  
Author(s):  
Sreekantan S. Nair
Keyword(s):  
Waiting Time ◽  
Queue Length ◽  
Busy Period ◽  
Single Server ◽  
Queueing Model ◽  
Tandem Queue ◽  
Limiting Behavior ◽  
Virtual Waiting Time ◽  
Priority Model

Avi-Itzhak, Maxwell and Miller (1965) studied a queueing model with a single server serving two service units with alternating priority. Their model explored the possibility of having the alternating priority model treated in this paper with a single server serving alternately between two service units in tandem.Here we study the distribution of busy period, virtual waiting time and queue length and their limiting behavior.

A Hybrid Multiple Parallel Queuing Model to Enhance QoS in Cloud Computing

2020 ◽  
Vol 12 (1) ◽  
pp. 18-34 ◽  
Author(s):  
Shahbaz Afzal ◽  
G. Kavitha
Keyword(s):  
Cloud Computing ◽  
Response Time ◽  
Waiting Time ◽  
Queue Length ◽  
Utilization Rate ◽  
Queuing Model ◽  
Total Response Time ◽  
Proposed Model ◽  
Mathematical Equations ◽  
And Performance

Among the different QoS metrics and parameters considered in cloud computing are the waiting time of cloud tasks, execution time of tasks in VM's, and the utilization rate of servers. The proposed model was developed to overcome some of the pitfalls in the existing systems among which are sub-optimal markdown in the queue length, waiting time, response time, and server utilization rate. The proposed model contemplates on the enhancement of these metrics using a Hybrid Multiple Parallel Queuing approach with a joint implementation of M/M/1: ∞ and M/M/s: N/FCFS to achieve the desired objectives. A neoteric set of mathematical equations have been formulated to validate the efficiency and performance of the hybrid queuing model. The results have been validated with reference to the workload traces of Bit Brains infrastructure provider. The results obtained indicate the significant reduction in the queue length by 60.93 percent, waiting time in the queue by 73.85 percent, and total response time by 97.51%.

On the many server queue with exponential service times

1973 ◽  
Vol 5 (01) ◽  
pp. 170-182 ◽  
Author(s):  
J. H. A. De Smit
Keyword(s):  
Waiting Time ◽  
Queue Length ◽  
Busy Period ◽  
Virtual Waiting Time ◽  
Server Queue ◽  
Poisson Arrivals ◽  
Service Times ◽  
The Many ◽  
Special Case ◽  
Busy Cycle

The general theory for the many server queue due to Pollaczek (1961) and generalized by the author (de Smit (1973)) is applied to the system with exponential service times. In this way many explicit results are obtained for the distributions of characteristic quantities, such as the actual waiting time, the virtual waiting time, the queue length, the number of busy servers, the busy period and the busy cycle. Most of these results are new, even for the special case of Poisson arrivals.

Sign in / Sign up

Export Citation Format

Share Document