Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth.

Slides:

Advertisements

Similar presentations

Components of the Queuing System

Advertisements

Waiting Line Management

INDR 343 Problem Session

Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Capacity Planning and Queuing Models.

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

Waiting Lines and Queuing Theory Models

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

Other Markovian Systems

Waiting Line Management

Example 14.4 Queuing | 14.2 | 14.3 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n Which system has the.

Management of Waiting Lines

The Theory of Queues Models of Waiting in line. Queuing Theory Basic model: Arrivals  Queue  Being Served  Done – Queuing theory lets you calculate:

14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.

Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.

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.

Problem 8.4 K = ∞ R i = 60/4 = 15 /hr T p = 3 min = 0.05 hour c= 1 R p = c/Tp = 20 /hour Both Ti and Tp exponential Server $20 /hr Phone $5/hr Wait cost.

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

Processor 1 Processor 2 Disk 1 Disk 2 tasks Demo 1: Computer System with 2 Processors Sharing 2 Disks in Parallel.

1 Ardavan Asef-Vaziri Sep-09Operations Management: Waiting Lines3  Terminology: The characteristics of a queuing system is captured by five parameters:

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.

Solutions Queueing Theory 1

Introduction to Management Science

McGraw-Hill/Irwin © 2003 The McGraw-Hill Companies, Inc., All Rights Reserved. Waiting Line Models.

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.

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

Queuing Models. © 2002 Prentice-Hall, IncCh 9-2 Stay in Queue: Short Video &feature=related

McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.

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.

Ch 6 Tech Notes OBJECTIVES

Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Waiting Line Analysis for Service Improvement Operations Management.

1-1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved 1 Chapter 8A Waiting Line 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.

Chapter 16 Capacity Planning and Queuing Models

Simulation vs. Queuing Theory

M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...

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,

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.

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

Example 14.3 Queuing | 14.2 | 14.4 | 14.5 | 14.6 | 14.7 |14.8 | Background Information n County Bank has several.

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.

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

Module D Waiting Line Models.

Managing Waiting Lines & Queuing Systems

McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.

WAITING LINES AND SIMULATION

18 Management of Waiting Lines

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

Management of Waiting Lines

Queuing Theory Jackson Networks

Chapter 9: Queuing Models

Solutions Queueing Theory 1

IV-2 Manufacturing Systems modeling

Solutions Queueing Theory 1

Queuing Models and Capacity Planning

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.

EMGT 501 Fall 2005 Final Exam Due Day: Dec 12 (Noon)

Queuing Theory III.

Queuing Theory III.

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.

Queuing Models J. Mercy Arokia Rani Assistant Professor

Course Description Queuing Analysis This queuing course

Presentation transcript:

Solutions Hwk Que3 1 The port of Miami has 3 docking berths for loading and unloading ships but is considering adding a 4th berth. Ships arrive in accordance with a Poisson Process at a rate of 6 ships per day. Docking berths can unload and reload a ship in 10 hours. Calculate performance metrics to decide if the 4th berth should be considered or not. We have an M/M/c infinite queue. From Table 16, we could use the formula To find po, where r = 6/c(2.4 for a 3 shiftt day) and c = 3 or 4. I will assume a 3 shift day so r = 0.83 for 3 berths and r = 0.625 for 4 berths.

Solutions Hwk Que 3 1 You are asked to evaluate a queuing system. After some analysis, it appears that inter-arrival times are exponential at a rate of l = 4 per hour. You also determine that a single server can serve customers every 10 minutes on average and that service are close to exponential. If the company uses a waiting time cost function of h(W) = 10W, determine the expected waiting time cost per unit for a single server model. Soln: E[S] = 1/6 hr yields m = 6. Then (m-l) = 2 and

Solutions Hwk Que3 1 Parts arrive at a processing center which can service one part at time with a buffer capacity of 3 units. Management is considering one of two machines to service parts. Machine 1 has daily operating costs of $160. Machine 2 has larger daily costs of $220 but can service parts faster. The g(N) form is used to compute waiting time costs for the parts and is given by g(N) = 80N. You are given the following table showing costs, and steady state probabilities for Machines 1 and 2 respectively. Compute the better alternative between the two machines. Soln: