INDR 343 Problem Session 4 04.12.2014 http://home.ku.edu.tr/~indr343/

Slides:



Advertisements
Similar presentations
E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Advertisements

McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Where is There Waiting? Service Facility –Fast-food restaurants –Post office –Grocery store.
INDR 343 Problem Session
QUEUING MODELS Based on slides for Hilier, Hiller, and Lieberman, Introduction to Management Science, Irwin McGraw-Hill.
Operations research Quiz.
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.
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.
Waiting Line Models And Service Improvement
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
1 Queuing Theory 2 Queuing theory is the study of waiting in lines or queues. Server Pool of potential customers Rear of queue Front of queue Line (or.
Waiting Lines Students should be able to:
Waiting Line Analysis OPIM 310-Lecture 3 Instructor: Jose Cruz.
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),
Simulating Single server queuing models. Consider the following sequence of activities that each customer undergoes: 1.Customer arrives 2.Customer waits.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
1 TCOM 501: Networking Theory & Fundamentals Lectures 9 & 10 M/G/1 Queue Prof. Yannis A. Korilis.
Waiting lines problems
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 16 Waiting Line Models and.
Waiting line Models.
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. Queuing theory is the study of waiting in lines or queues. Server Pool of potential customers Rear of queue Front of queue Line (or queue)
Waiting Line Analysis for Service Improvement
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.
MNG221 - Management Science –
Queuing Theory (Waiting Line Models)
___________________________________________________________________________ Operations Research  Jan Fábry Waiting Line Models.
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
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
Waiting Line Models ___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry.
Introduction to Queuing Theory
4/11: Queuing Models Collect homework, roll call Queuing Theory, Situations Single-Channel Waiting Line System –Distribution of arrivals –Distribution.
Queuing Models. © 2002 Prentice-Hall, IncCh 9-2 Stay in Queue: Short Video &feature=related
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.
Manijeh Keshtgary. Queuing Network: model in which jobs departing from one queue arrive at another queue (or possibly the same queue)  Open and Closed.
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.
Supplement C Waiting Line Models Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Queuing Modeling and Analysis.
Spreadsheet Models for Managers: Session 12 12/1 Copyright © Richard Brenner Spreadsheet Models for Managers Session 12 Service Systems Single-Server.
1 Queuing Systems (2). Queueing Models (Henry C. Co)2 Queuing Analysis Cost of service capacity Cost of customers waiting Cost Service capacity Total.
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.
Waiting Lines and Queuing Theory Models
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.
Waiting Line Models Production and Operations Management Reporter:
Example 14.3 Queuing | 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n County Bank has several.
© 2015 McGraw-Hill Education. All rights reserved. Chapter 17 Queueing Theory.
Waiting Line Theroy BY, PRAYASH NEUPANE, KARAN CHAND & SANTOSH SHERESTHA.
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.
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,
Managerial Decision Making Chapter 13 Queuing Models.
Module D Waiting Line Models.
“QUEUING THEORY”.
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Queuing Models Economic Analyses.
Chapter 9: Queuing Models
Solutions Queueing Theory 1
System Performance: Queuing
Variability 8/24/04 Paul A. Jensen
Solutions Queueing Theory 1
Solutions Queueing Theory 1
Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.
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.
LECTURE 09 QUEUEING THEORY PART3
Presentation transcript:

INDR 343 Problem Session 4 04.12.2014 http://home.ku.edu.tr/~indr343/

17.8-1 Southeast Airlines is a small commuter airline serving primarily the state of Florida. Their ticket counter at a certain airport is staffed by a single ticket agent. There are two separate lines—one for first-class passengers and one for coach-class passengers. When the ticket agent is ready for another customer, the next first-class passenger is served if there are any in line. If not, the next coach-class passenger is served. Service times have an exponential distribution with a mean of 3 minutes for both types of customers. During the 12 hours per day that the ticket counter is open, passengers arrive randomly at a mean rate of 2 per hour for first-class passengers and 10 per hour for coach class passengers. (a) What kind of queueing model fits this queueing system? (b) Find the main measures of performance—L, Lq, W, and Wq— for both first-class passengers and coach- class passengers.

17.8-1 (c) What is the expected waiting time before service begins for first-class customers as a fraction of this waiting time for coach-class customers? (d) Determine the average number of hours per day that the ticket agent is busy.

17.8-4 A particular work center in a job shop can be represented as a single-server queueing system, where jobs arrive according to a Poisson process, with a mean rate of 8 per day. Although the arriving jobs are of three distinct types, the time required to perform any of these jobs has the same exponential distribution, with a mean of 0.1 working day. The practice has been to work on arriving jobs on a first-come-first-served basis. However, it is important that jobs of type 1 not wait very long, whereas the wait is only moderately important for jobs of type 2 and is relatively unimportant for jobs of type 3. These three types arrive with a mean rate of 2, 4, and 2 per day, respectively. Because all three types have experienced rather long delays on average, it has been proposed that the jobs be selected according to an appropriate priority discipline instead.

17.8-4 Compare the expected waiting time (including service) for each of the three types of jobs if the queue discipline is (a) first-come first- served, (b) nonpreemptive priority, and (c) preemptive priority

17.9-3 Consider a system of two infinite queues in series, where each of the two service facilities has a single server. All service times are independent and have an exponential distribution, with a mean of 3 minutes at facility 1 and 4 minutes at facility 2. Facility 1 has a Poisson input process with a mean rate of 10 per hour. (a) Find the steady-state distribution of the number of customers at facility 1 and then at facility 2. Then show the product form solution for the joint distribution of the number at the respective facilities. (b) What is the probability that both servers are idle? (c) Find the expected total number of customers in the system and the expected total waiting time (including service times) for a customer.

17.9-5. Consider a Jackson network with three service facilities. (a) Find the total arrival rate at each of the facilities. (b) Find the steady-state distribution of the number of customers at facility 1, facility 2, and facility 3. Then show the product form solution for the joint distribution of the number at the respective facilities.

17.9-5. (c) What is the probability that all the facilities have empty queues (no customers waiting to begin service)? (d) Find the expected total number of customers in the system. (e) Find the expected total waiting time (including service times) for a customer.

17.10-2 Jim McDonald, manager of the fast-food hamburger restaurant McBurger, realizes that providing fast service is a key to the success of the restaurant. Customers who have to wait very long are likely to go to one of the other fast-food restaurants in town next time. He estimates that each minute a customer has to wait in line before completing service costs him an average of 30 cents in lost future business. Therefore, he wants to be sure that enough cash registers always are open to keep waiting to a minimum. Each cash register is operated by a part-time employee who obtains the food ordered by each customer and collects the payment. The total cost for each such employee is $9 per hour. During lunch time, customers arrive according to a Poisson process at a mean rate of 66 per hour. The time needed to serve a customer is estimated to have an exponential distribution with a mean of 2 minutes. Determine how many cash registers Jim should have open during lunch time to minimize his expected total cost per hour.