Open AccessAnalysis of Priorities Queuing Model (N-P) System With Multiple Channel Multiple Phase and Simple Additive Weighting
Author(s) -
Herman Putra Rajagukguk,
Muhammad Zarlis,
Sutarman Sutarman
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1339/1/012033
Subject(s) - queue management system , queue , weighting , computer science , fifo (computing and electronics) , priority queue , queueing theory , burke's theorem , fork–join queue , mathematical optimization , mathematics , computer network , physics , acoustics , computer hardware
The queue is a situation where people/goods must wait to get a turn of service. This happens because the number of arrivals is greater than the number of services. Generally, there are 4 queuing methods, namely FIFO (First In First Out), FILO (First In Last Out), SIRO(Services in random order), and PS (Priority Services). In this research, the authors conducted priority queues based on weighting using the SAW algorithm. Queue modeling uses Multiple channel Multiple Phase, where there are 2 phases that will be passed on the queue system. In phase 1, an assessment will be made using the SAW algorithm to produce weights value for each queue. Then in phase 2, a call will be made based on the priority value. In the priority queue, the queue can get service faster or slower according to the queue category. Tests are carried out following (M/M/1:GD/∞/∞) dan (M/M/3:PS/∞/∞) modeling with 100 test data with random variables. In this queue model, the arrival distribution follows a Poisson distribution, and the service distribution follows an exponential distribution. After testing, the results of the queue were obtained: 15, 3% effective in the low category, 65% effective in the normal category, 100% effective in the medium category, 100% effective in the high category. From the results it can be concluded that the queue system is effective in the queue with Normal, Medium and High categories. Queues will not effective in low category.