Model Antrian M/G/1.

Slides:



Advertisements
Similar presentations
Part 3 Probabilistic Decision Models
Advertisements

Waiting Line Management
Module C8 Queuing Economic/Cost Models. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some.
IE 429, Parisay, January 2003 Review of Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete, continuous.
Chapter Queueing Notation
Chap. 20, page 1051 Queuing Theory Arrival process Service process Queue Discipline Method to join queue IE 417, Chap 20, Jan 99.
Waiting Lines and Queuing Theory Models
Queuing Models Economic Analyses. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some service.
Queuing Systems Chapter 17.
Multiple server queues In particular, we look at M/M/k Need to find steady state probabilities.
Chapter 13 Queuing Theory
Other Markovian Systems
Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
Queueing Theory Chapter 17.
MGTSC 352 Lecture 23: Congestion Management Introduction: Asgard Bank example Simulating a queue Types of congested systems, queueing template Ride’n’Collide.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
Queueing Theory lSpecification of a Queue mSource Finite Infinite mArrival Process mService Time Distribution mMaximum Queueing System Capacity mNumber.
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 16 Waiting Line Models and.
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.
Lecture 4 Mathematical and Statistical Models in Simulation.
Waiting Line Analysis for Service Improvement
Chapter 9: Queuing Models
Queuing Theory (Waiting Line Models)
Queueing Theory Specification of a Queue Source Arrival Process
Spreadsheet Modeling & Decision Analysis
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Introduction to Management Science
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. Service Processes CHAPTER 5.
1 Queuing Analysis Overview What is queuing analysis? - to study how people behave in waiting in line so that we could provide a solution with minimizing.
IE 429, Parisay, January 2010 What you need to know from Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete,
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
Chapter 16 Capacity Planning and Queuing Models
MGTSC 352 Lecture 25: Congestion Management MEC example Manufacturing example.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Technical Supplement 2 Waiting Line Models McGraw-Hill/Irwin Copyright © 2011 by the McGraw-Hill Companies, Inc. All rights reserved.
1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3 Example: The arrival rate to a GAP store is 6 customers per hour and has Poisson distribution.
Waiting Line Theory Akhid Yulianto, SE, MSc (log).
Queuing Models.
Managerial Decision Making Chapter 13 Queuing Models.
Module D Waiting Line Models.
Model Antrian Tunggal Pertemuan 20
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Queuing Models Economic Analyses.
A Basic Queueing System
Queueing Theory What is a queue? Examples of queues:
Chapter 9: Queuing Models
Chapter 6 Queueing Models
Demo on Queuing Concepts
Queueing Theory.
Birth-Death Process Birth – arrival of a customer to the system
Chapter 6 Queuing Models.
Chapter 5 Designing Services.
Solutions Queueing Theory 1
IV-2 Manufacturing Systems modeling
LESSON 12: EXPONENTIAL DISTRIBUTION
System Performance: Queuing
DECISION MODELING WITH Prentice Hall Publishers and
Variability 8/24/04 Paul A. Jensen
Solutions Queueing Theory 1
Queuing Models and Capacity Planning
Solutions Queueing Theory 1
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
24 February 2019 Model Antrian M/D/1.
Model Antrian M/M/s.
Queuing Theory III.
Waiting Line Models Waiting takes place in virtually every productive process or service. Since the time spent by people and things waiting in line is.
Presentation transcript:

Model Antrian M/G/1

The M/G/1 Model Assumptions Interarrival times have an exponential distribution with a mean of 1/l. Service times can have any probability distribution. You only need the mean (1/m) and standard deviation (s). The queueing system has one server. The probability of zero customers in the system is P0 = 1 – r The expected number of customers in the queue is Lq = [l2s2 + r2] / [2(1 – r)] The expected number of customers in the system is L = Lq + r The expected waiting time in the queue is Wq = Lq / l The expected waiting time in the system is W = Wq + 1/m © The McGraw-Hill Companies, Inc., 2003

Steady-State Parameters of M/G/1 Queue r = l / m L = r + {l2 (m-2 + s2)} / {2 (1 - r)} = r + {r2 (1 + s2 m2)} / {2 (1 - r)} W = m-1 + {l (m-2 + s2)} / {2 (1 - r)} Wq = {l (m-2 + s2)} / {2 (1 - r)} Lq = {l2 (m-2 + s2)} / {2 (1 - r)} = {r2 (1 + s2 m2)} / {2 (1 - r)} P0 = 1 - r 19 February 2019 R. Rumani M / rrm@ittelkom.ac.id Telkom Institute of Technology 30 16

The Values of s and Lq for the M/G/1 Model with Various Service-Time Distributions Mean s Model Lq Exponential 1/m M/M/1 r2 / (1 – r) Degenerate (constant) M/D/1 (1/2) [r2 / (1 – r)] Erlang, with shape parameter k (1/k) (1/m) M/Ek/1 (k+1)/(2k) [r2 / (1 – r)] © The McGraw-Hill Companies, Inc., 2003 Table 14.6 The values of s and Lq for the M/G/1 model with various service-time distributions.

Example 1 Baker and Able There are two workers competing for a job. Able claims an average service time which is faster than Baker’s, but Baker claims to be more consistent, if not as fast. The arrivals occur according to a Poisson process at a rate of l= 2 per hour. (1/30 per minute). Able’s statistics are an average service time of 24 minutes with a standard deviation of 20 minutes. Baker’s service statistics are an average service time of 25 minutes, but a standard deviation of only 2 minutes. If the average length of the queue is the criterion for hiring, which worker should be hired? 19 February 2019 R. Rumani M / rrm@ittelkom.ac.id Telkom Institute of Technology 30 13

Example 1 Baker and Able For Able, l = 1/30 (per min), m-1 = 24 (min) r = l / m = 24/30 = 4/5 s2 = 202 = 400(min2) Lq = {l2 (m-2 + s2)} / {2 (1 - r)} = {(1/30)2 (242 + 400)} / {2 (1-4/5)} = 2.711 (customers) For Baker l = 1/30 (per min), m-1 = 25 (min) r = l / m = 25/30 = 5/6 s2 = 22 = 4(min2) Lq = {(1/30)2 (252 + 4)} / {2 (1-5/6)} = 2.097 (customers) 19 February 2019 R. Rumani M / rrm@ittelkom.ac.id Telkom Institute of Technology 30 16

Example 1 Baker and Able Although working faster on the average, Able’s greater service variability results in an average queue length about 30% greater than Baker’s. On the other hand, the proportion of arrivals who would find Able idle and thus experience no delay is P0 = 1 - r = 1 / 5 = 20%, while the proportion who would find Baker idle and thus experience no delay is P0 = 1 - r = 1 / 6 = 16.7%. On the basis of average queue length, Lq , Baker wins. 19 February 2019 R. Rumani M / rrm@ittelkom.ac.id Telkom Institute of Technology 30 13

Example 2 VP of Engineering Approach © The McGraw-Hill Companies, Inc., 2003 l = 3 The proposed new service standard is that the average waiting time before service begins be two hours (i.e., Wq ≤ 1/4 day). The Vice President for Engineering has suggested providing tech reps with new state-of-the-art equipment that would reduce the time required for the longer repairs. After gathering more information, they estimate the new equipment would have the following effect on the service-time distribution: Decrease the mean from 1/4 day to 1/5 day. Decrease the standard deviation from 1/4 day to 1/10 day.

Example 2 VP of Engineering Approach © The McGraw-Hill Companies, Inc., 2003 Figure 14.7 This Excel template for the M/G/1 model shows the results from applying this model to the approach suggested by the Dupit’s vice president for engineering to use state-of-the-art equipment.

Standar Deviasi Jika Standar Deviasi tidak diketahui, maka 𝜎= 1 𝑁−1 𝑖=1 𝑁 𝑥 𝑖 − 𝑥 2 N = jumlah data 𝑥 = mean

Example 3 sampai 10:30 Minimarket dengan 1 Kasir Hitunglah : Standar Deviasi waktu pelayanan. Rata-rata banyaknya pelanggan dalam Minimarket (Ls) Rata-rata pelanggan yang mengantri (Lq) Berapa lama pelanggan mengantri (Wq) Berapa lama pelanggan dilayani oleh Kasir (Wb = Ws-Wq)