Chapter 1 Introduction.

Slides:

Advertisements

Similar presentations

UNIT-II Queuing Theory

Advertisements

Chapter 13 Queueing Models

MGT 560 Queuing System Simulation Stochastic Modeling © Victor E. Sower, Ph.D., C.Q.E

Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.

Chap. 20, page 1051 Queuing Theory Arrival process Service process Queue Discipline Method to join queue IE 417, Chap 20, Jan 99.

Model Antrian By : Render, ect. Outline  Characteristics of a Waiting-Line System.  Arrival characteristics.  Waiting-Line characteristics.  Service.

Waiting Lines and Queuing Theory Models

1 Analysis Of Queues For this session, the learning objectives are:  Learn the fundamental structure of a queueing system.  Learn what needs to be specified.

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.

Waiting Line Management

Management of Waiting Lines

Queueing Network Model. Single Class Model Open - Infinite stream of arriving customers Closed - Finite population eg Intranet users Indistinguishable.

CHAPTER 18 Waiting Lines.

Chapter 18 Management of Waiting Lines

19-1 McGraw-Hill Ryerson Operations Management, 2 nd Canadian Edition, by Stevenson & Hojati Copyright © 2004 by The McGraw-Hill Companies, Inc. All rights.

To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 14-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 14.

Queuing Theory (Waiting Line Models)

Queuing Models and Capacity Planning

Queueing Theory Models Training Presentation By: Seth Randall.

Queueing Theory I. Summary Little’s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems  M/M/1  M/M/m  M/M/1/K  …

Simulation Examples ~ By Hand ~ Using Excel

Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,

Supplement C Waiting Line Models Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.

McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 18 Management of Management of Waiting Lines.

Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.

1 Queueing Theory Frank Y. S. Lin Information Management Dept. National Taiwan University

Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.

1 Elements of Queuing Theory The queuing model –Core components; –Notation; –Parameters and performance measures –Characteristics; Markov Process –Discrete-time.

Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.

Spreadsheet Models for Managers: Session 12 12/1 Copyright © Richard Brenner Spreadsheet Models for Managers Session 12 Service Systems Single-Server.

CS433 Modeling and Simulation Lecture 12 Queueing Theory Dr. Anis Koubâa 03 May 2008 Al-Imam Mohammad Ibn Saud University.

1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.

Waiting Lines and Queuing Theory Models

Chapter 1 Introduction. “Wait-in-line” is a common phenomenon in everywhere. Reason: Demand is more than service. “How long must a customer wait?” or.

Structure of a Waiting Line System Queuing theory is the study of waiting lines Four characteristics of a queuing system: –The manner in which customers.

Chapter 6 Queueing Models

Introduction Definition M/M queues M/M/1 M/M/S M/M/infinity M/M/S/K.

Queuing Theory.  Queuing Theory deals with systems of the following type:  Typically we are interested in how much queuing occurs or in the delays at.

Adeyl Khan, Faculty, BBA, NSU Elements of Queuing System ArrivalsServiceWaiting line Exit Processing order System.

© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.

Waiting Line Theroy BY, PRAYASH NEUPANE, KARAN CHAND & SANTOSH SHERESTHA.

Queuing Models.

Queueing Theory. The study of queues – why they form, how they can be evaluated, and how they can be optimized. Building blocks – arrival process and.

Mohammad Khalily Islamic Azad University.  Usually buffer size is finite  Interarrival time and service times are independent  State of the system.

Simple Queueing Theory: Page 5.1 CPE Systems Modelling & Simulation Techniques Topic 5: Simple Queueing Theory  Queueing Models  Kendall notation.

QUEUING THEORY 1.  - means the number of arrivals per second   - service rate of a device  T - mean service time for each arrival   = ( ) Utilization,

WAITING LINES AND SIMULATION

population or infinite calling population?

“QUEUING THEORY”.

Al-Imam Mohammad Ibn Saud University

McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved

Management of Waiting Lines

Internet Queuing Delay Introduction

Demo on Queuing Concepts

Management of Waiting Lines

Queuing Systems Don Sutton.

Introduction Notation Little’s Law aka Little’s Result

Chapter 20 Queuing Theory

System Performance: Queuing

effective capacity The practical maximum output of a system,

Supplement D Waiting Line Models

Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry

Waiting Lines Waiting lines are non-value added occurrences.

absolute time The passage of time as measured by a clock.

Queueing Theory 2008.

Queueing Theory Frank Y. S. Lin Information Management Dept.

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.

Course Description Queuing Analysis This queuing course

Presentation transcript:

Chapter 1 Introduction

“Wait-in-line” is a common phenomenon in everywhere. Reason: Demand is more than service. “How long must a customer wait?” or “ How many people will form in the line?” Queueing theory: answers these questions through mathematical analysis.

1.1 Description of the Queueing Problem A queueing system: customers arriving for service, waiting for service, leaving the system. A “customer” could be any object waiting for being processed. Queueing theory: model queueing systems for predicting their behaviors.

1.2 Characteristics of Queueing Processs 6 characteristics: (1) arrival pattern of customers, (2) service pattern of servers, (3) queue discipline, (4) system capacity, (5) number of service channels, and (6) number of service stages.

1.2.1 Arrival pattern of customers The process of arrivals is stochastic. Interarrival times: a probability distribution (PDF) sequential or batch/bulk arrivals (need to know the PDF of the size)

The reaction upon entering the system Wait or leave? Balked: leave for observing the line being too long. Reneged: leave for waiting too long. Jockey: switch from line to line. Time-dependent (non-stationary) or time-independent (stationary).

1.2.2 Service Patterns Service time: a PDF. Single or batch (e.g., parallel processing or guided tour) State-independent or State-dependent (the service process depends on the number of customers waiting in line).

Time-dependent (non-stationary) or time-independent (stationary). Queue length distribution: the result of arrival and service processes.

1.2.3 Queueing Discipline How customers are selected from the queue for service? FCFS: first come, first served LCFS: last come, first served RSS: random selection for service PR: priority Preemptive Non-preemptive

1.2.4 System Capacity finite or infinite queue length A finite queue can be viewed as one with forced balking.

1.2.5 Number of Service Channels Single or multiple service channels Multiple service channels single queue shared by all channels (e.g., salon) each channel has its own queue (e.g., supermarket)

1.2.6 Stages of Service Single or multiple stages (e.g., health exam) Multiple stages with recycling or feedback

1.3 Notation A/B/X/Y/Z A: Interarrival-time PDF B: Service-time PDF X: # of parallel server channels Y: System capacity Z: Queue disciplne see Table 1.1

1.4 Measuring System Performance Effectiveness: Random variables of interest: Waiting time: system or queue Accumulation in queue: system or queue Server idle time (utilization)

Objectives: Measuring the effectiveness of a existing system Design an “optimal” system. Trade-off of better customer service vs. the expense of providing more service capability.

1.5 Some General Results l: average arrival rate m: average service rate c: the number of servers Traffic intensity: r=l/cm

steady state: time goes infinity r >1: non-steady state r =1: steady only when deterministic arrival and service r <1: steady always