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

Slides:

Advertisements

Similar presentations

Chapter 13 Queueing Models

Advertisements

Introduction to Queuing Theory

Chapter 20 Queuing Theory

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

Chapter 22 Simulation with Process Model to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

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.

© The McGraw-Hill Companies, Inc., Technical Note 6 Waiting Line Management.

Managing Waiting Lines

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.

Queueing Theory: Part I

Chapter 20 Queuing Theory

Lecture 11 Queueing Models. 2 Queueing System  Queueing System:  A system in which items (or customers) arrive at a station, wait in a line (or queue),

Data Communication and Networks Lecture 13 Performance December 9, 2004 Joseph Conron Computer Science Department New York University

1 Queueing Theory H Plan: –Introduce basics of Queueing Theory –Define notation and terminology used –Discuss properties of queuing models –Show examples.

Management of Waiting Lines

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

Introduction to Queuing Theory. 2 Queuing theory definitions  (Kleinrock) “We study the phenomena of standing, waiting, and serving, and we call this.

Chapter 9: Queuing Models

Group members  Hamid Ullah Mian  Mirajuddin  Safi Ullah.

Queuing Theory (Waiting Line Models)

___________________________________________________________________________ Operations Research  Jan Fábry Waiting Line Models.

Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.

1 Chapter 16 Applications of Queuing Theory Prepared by: Ashraf Soliman Abuhamad Supervisor by : Dr. Sana’a Wafa Al-Sayegh University of Palestine Faculty.

Introduction to Queuing Theory

McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. Service Processes CHAPTER 5.

Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.

4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.

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

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

1 Queuing Models Dr. Mahmoud Alrefaei 2 Introduction Each one of us has spent a great deal of time waiting in lines. One example in the Cafeteria. Other.

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

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

CS352 - Introduction to Queuing Theory Rutgers University.

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.

QUEUING THEORY.

Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.

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

(C) J. M. Garrido1 Objects in a Simulation Model There are several objects in a simulation model The activate objects are instances of the classes that.

Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.

Waiting Line Theory Akhid Yulianto, SE, MSc (log).

1 1 Slide Chapter 12 Waiting Line Models n The Structure of a Waiting Line System n Queuing Systems n Queuing System Input Characteristics n Queuing System.

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.

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

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

Queuing Models.

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,

QUEUING THOERY. To describe a queuing system, an input process and an output process must be specified. Examples of input and output processes are: SituationInput.

1 BIS 3106: Business Process Management (BPM) Lecture Nine: Quantitative Process Analysis (2) Makerere University School of Computing and Informatics Technology.

Abu Bashar Queuing Theory. What is queuing ?? Queues or waiting lines arise when the demand for a service facility exceeds the capacity of that facility,

Absolute time The passage of time as measured by a clock. Click here for Hint perceived time or absolute time or preprocess wait?

Chapter 1 Introduction.

population or infinite calling population?

Lecture 2.7. Queuing Theory

Queueing Theory What is a queue? Examples of queues:

Chapter 9: Queuing Models

Demo on Queuing Concepts

Introduction Notation Little’s Law aka Little’s Result

Chapter 20 Queuing Theory

Queuing Theory.

effective capacity The practical maximum output of a system,

Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry

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

Queueing Theory 2008.

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.

VIRTUE MARYLEE MUGURACHANI QUEING THEORY BIRTH and DEATH.

Presentation transcript:

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

2 Description Each of us has spent a great deal of time waiting in lines. In this chapter, we develop mathematical models for waiting lines, or queues.

Some Queuing Terminology To describe a queuing system, an input process and an output process must be specified. Examples of input and output processes are: SituationInput ProcessOutput Process BankCustomers arrive at bank Tellers serve the customers Pizza parlorRequest for pizza delivery are received Pizza parlor send out truck to deliver pizzas

4 The Input or Arrival Process The input process is usually called the arrival process. Arrivals are called customers. We assume that no more than one arrival can occur at a given instant. If more than one arrival can occur at a given instant, we say that bulk arrivals are allowed. Models in which arrivals are drawn from a small population are called finite source models. If a customer arrives but fails to enter the system, we say that the customer has balked.

5 The Output or Service Process To describe the output process of a queuing system, we usually specify a probability distribution – the service time distribution – which governs a customer’s service time. We study two arrangements of servers: servers in parallel and servers in series. Servers are in parallel if all server provide the same type of service and a customer need only pass through one server to complete service. Servers are in series if a customer must pass through several servers before completing service.

6 Queue Discipline The queue discipline describes the method used to determine the order in which customers are served. The most common queue discipline is the FCFS discipline (first come, first served), in which customers are served in the order of their arrival. Under the LCFS discipline (last come, first served), the most recent arrivals are the first to enter service. If the next customer to enter service is randomly chosen from those customers waiting for service it is referred to as the SIRO discipline (service in random order).

7 Finally we consider priority queuing disciplines. A priority discipline classifies each arrival into one of several categories. Each category is then given a priority level, and within each priority level, customers enter service on an FCFS basis. Another factor that has an important effect on the behavior of a queuing system is the method that customers use to determine which line to join.

8 The Kendall-Lee Notation for Queuing Systems Standard notation used to describe many queuing systems. The notation is used to describe a queuing system in which all arrivals wait in a single line until one of s identical parallel servers id free. Then the first customer in line enters service, and so on. To describe such a queuing system, Kendall devised the following notation. Each queuing system is described by six characters: 1/2/3/4/5/6

9 The first characteristic specifies the nature of the arrival process. The following standard abbreviations are used: M = Interarrival times are independent, identically distributed (iid) D = Interarrival times are iid and deterministic E k = Interarrival times are iid Erlangs with shape parameter k. GI = Interarrival times are iid and governed by some general distribution

10 The second characteristic specifies the nature of the service times: M = Service times are iid and exponentially distributed D = Service times are iid and deterministic E k = Service times are iid Erlangs with shape parameter k. G = Service times are iid and governed by some general distribution

11 The third characteristic is the number of parallel servers. The fourth characteristic describes the queue discipline:  FCFS = First come, first served  LCFS = Last come, first served  SIRO = Service in random order  GD = General queue discipline The fifth characteristic specifies the maximum allowable number of customers in the system. The sixth characteristic gives the size of the population from which customers are drawn.

12 In many important models 4/5/6 is GD/∞/∞. If this is the case, then 4/5/6 is often omitted. M/E 2 /8/FCFS/10/∞ might represent a health clinic with 8 doctors, exponential interarrival times, two-phase Erlang service times, an FCFS queue discipline, and a total capacity of 10 patients.