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

Slides:



Advertisements
Similar presentations
Chapter 13 Queueing Models
Advertisements

LESSONs NINE and TEN QUEUING MODELS.
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Where is There Waiting? Service Facility –Fast-food restaurants –Post office –Grocery store.
D Waiting-Line Models PowerPoint presentation to accompany
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.
Waiting Line Models And Service Improvement
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
Waiting Lines Students should be able to:
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),
1 Service A Queuing System Arrival Rate (  Average Number in Queue ( L q ) Avg Time in System ( W ) Avg Number in System ( L ) Average Wait in Queue.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
Waiting line Models.
Operations Management Waiting-Line Models Module D
Chapter 9: Queuing Models
WAITING LINES The study of waiting lines, called queuing theory, is one of the most widely used and oldest management science techniques. The three basic.
Group members  Hamid Ullah Mian  Mirajuddin  Safi Ullah.

Queuing Theory (Waiting Line Models)
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
Introduction to Management Science
MBA 8452 Systems and Operations Management MBA 8452 Systems and Operations Management Product Design & Process Selection —Service.
Service Systems & Queuing Chapter 12S OPS 370. Nature of Services –A
INDR 343 Problem Session
D-1 © 2004 by Prentice Hall, Inc., Upper Saddle River, N.J Operations Management Waiting-Line Models Module D.
Introduction to Queueing Theory
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Queuing Models. © 2002 Prentice-Hall, IncCh 9-2 Stay in Queue: Short Video &feature=related
Introduction to Operations Research
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.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
 One or more ‘customers’ waiting for a service.  ‘Customer’ can be: › People e.g. A person waiting in line to deposit cash in a bank. › Objects e.g.
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.
Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
Supplement D Waiting Line Models
Reid & Sanders, Operations Management © Wiley 2002 Waiting Line Models A SUPPLEMENT.
Chapter 20 Queuing Theory to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
Waiting Lines and Queuing Theory Models
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s 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.
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.
(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.
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.
Introduction Definition M/M queues M/M/1 M/M/S M/M/infinity M/M/S/K.
Advantages of simulation 1. New policies, operating procedures, information flows and son on can be explored without disrupting ongoing operation of the.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Queuing Models.
Queuing Theory Important definition in Queuing Theory: We define various terms, which are used in our queue model. 1.Queue length: The number of customers.
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.
Queueing Theory/Waiting Line: Models and Analysis Navneet Vidyarthi
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,
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 1 Introduction.
“QUEUING THEORY”.
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Chapter 9: Queuing Models
Queuing Systems Don Sutton.
Chapter 20 Queuing Theory
Supplement D Waiting Line Models
Lecture 13 – Queuing Systems
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:

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

What is queuing ??  Queues or waiting lines arise when the demand for a service facility exceeds the capacity of that facility, that is, the customers do not get service immediately upon request but must wait, or the service facilities stand idle and wait for customers.  Waiting lines, or queues are a common occurrence both in everyday life and in variety of business and industrial situations.  For example: Banks must decide how many teller windows to keep open to serve customers during various hours of the day.  Manufacturing plants must determine the optimal number of mechanics to have on duty in each shift to repair machines that break down.  Supermarkets must decide how many cash register check out positions should be opened.

BASIC COMPONENTS OF A QUEUING SYSTEM  INPUT SOURCE OF QUEUE An input source is characterized by  Size of the calling population: Arrival at a service may be drawn from a finite or an infinite population.  Pattern of arrivals at the system: The arrivals pattern of customer to the service system is either static or dynamic.  Behavior of the arrivals: The arriving customer shows different kind of behaviors that may be patient or impatient.

Queue Discipline  A queue discipline is a priority rule or set of rules for determining the order of service to customers in a waiting line.  The rules selected can have dramatic effect on the system’s overall performance  No. of customer in line, the average waiting time, range of variability in waiting time and the efficiency of the service facility are few factors affected by the choice of priority rule.

Major Queue Discipline  First-come, first served: Consumer are served in the order of their arrival.  Last-come, first served: Customer or unit coming last are served first.  Service in random order: Customer are selected for random irrespective of their arrivals.  Priority Service: Customer are grouped in priority classes on the basis of some attributes such as service urgency, and FCFS rule is used within each class to provide service.  Pre-emptive priority: The highest priority customer is allowed to enter into the service immediately after into the system even if a customer with lower priority is already in service.  Non-pre-emptive priority: Highest priority customer goes ahead in the queue, but service is started immediately on completion of current service.

Service Process  The service process is concern with the manner in which customers are serviced and leave the service system. It is characterized by: Arrangement and capacity of service facility and Distribution of service time.  Arrangement and capacity of service facility: The capacity of service mechanism is measured in terms of customers that can be served simultaneously and effectively on unit time. Eg, hour, day etc. It may have different layout such as series arrangements, parallel arrangements and mixed arrangements.  Series arrangements: Series arrangement consists of a sequence of a number of service facilities such that a customer must go through one facility after another in a particular sequence before the whole service. It can be single queue, single server or single queue, multiple servers. Eg, during college admissions, the student go through one counter after another before their admission formalities is completed.

conted  Parallel arrangements: The service facilities are arranged in parallel to each other. This provides opportunity for customer to join any service central of his choice. Check in point of airport is best example.  Mixed arrangements: Consists of service facilities in both series as well as parallel form. This type of arrangements are often seen in hospitals or universities.  Distribution of service time: The time interval from the commencement of service to the completion of service for a customer is known as service time. The capacity of servers in number of units per time period is called service rate. The service time distribution can be described in terms of either Poisson or as exponential distribution.

Types of Waiting Line System  Single channel system  Multi channel system  Single queue with many service counter system  Many queue with single counter system  Multi stage system

Single channel system Single Server – Single Queue  The models that involve one queue – one service station facility are called single server models where customer waits till the service point is ready to take him for servicing. Students arriving at a library counter is an example of a single server facility.

Single Server – Several Queues  In this type of facility there are several queues and the customer may join any one of these but there is only one service channel.

Several (Parallel) Servers – Single Queue  In this type of model there is more than one server and each server provides the same type of facility. The customers wait in a single queue until one of the service channels is ready to take them in for servicing.

Multi channel System Several Servers – Several Queues  This type of model consists of several servers where each of the servers has a different queue. Different cash counters in an electricity office where the customers can make payment in respect of their electricity bills provide an example of this type of model.

Multi Stage Channel  A service center opens different counter for providing services in sequence and customer are asked to pass through required counters for getting respective service.

Any Queries??????????