Problem definition and Analysis. Scope Performance indicators (system time, resource occupation, cost,...) Key object classes (order, delivery,...) and.

Slides:



Advertisements
Similar presentations
Chapter 13 Queueing Models
Advertisements

Facility Planning: Capacity. Capacity Planning Interrelated facility planning decisions: 1.Number of facilities and general type 2.Capacity 3.Locations.
Capacity Setting and Queuing Theory
Corridor planning: a quick response strategy. Background NCHRP Quick Response Urban Travel Estimation Techniques (1978) Objective: provide tools.
Spreadsheet Demonstration New Car Simulation. 2 New car simulation Basic problem  To simulate the profitability of a new model car over a several-year.
DCT Analysis. Concepts: UML-like class model of essential classes and actions.
Business Process Simulation Marc Voorhoeve HG 7.86(247)2420.
Chapter 4 Process design Shenval. Alamy.
Problems with parameterization (example:keeper usage): average duration: 1.27, min: 0.106, max: 6.46 possible outcome for keeper and crane queues? Assignment.
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Final Exam Tuesday, December 9 2:30 – 4:20 pm 121 Raitt Hall Open book
Waiting Lines and Queuing Theory Models
Queuing Systems Chapter 17.
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.
Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
Lec13, Ch.6, pp : Gap acceptance and Queuing Theory (Objectives)
Managing Process Flows
Supply Chain Management Lecture 27. Detailed Outline Tuesday April 27Review –Simulation strategy –Formula sheet (available online) –Review final Thursday.
What we will cover…  CPU Scheduling  Basic Concepts  Scheduling Criteria  Scheduling Algorithms  Evaluations 1-1 Lecture 4.
Copyright © 1998 Wanda Kunkle Computer Organization 1 Chapter 2.1 Introduction.
14-1. Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 14 Capacity Planning and Queuing Models.
Waiting Lines.
1 Part VI System-level Performance Models for the Web © 1998 Menascé & Almeida. All Rights Reserved.
capacity planning and control
Monté Carlo Simulation MGS 3100 – Chapter 9. Simulation Defined A computer-based model used to run experiments on a real system.  Typically done on a.
Product layout Assembly-line balancing approach. 2 Facility layout Process terminology Cycle time: Average time between completions of successive units.
OPSM 301: Operations Management
Spreadsheet Modeling & Decision Analysis
Introduction to Management Science
Simulation Examples ~ By Hand ~ Using Excel
Chapter 6: CPU Scheduling
ISM 270 Service Engineering and Management Lecture 7: Forecasting and Managing Service Capacity.
Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
Announcement-exam rules
Introduction to Operations Research
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
The McGraw-Hill Companies, Inc. 2006McGraw-Hill/Irwin 12 Financial and Cost- Volume-Profit Models.
Modeling. Conceptual modeling: Petri nets Implementation: Arena, CPN tools Simulation needed: build models. Start with concepts, then select appropriate.
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.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Normal distributions Theorem: Let X,Y normally distributed independent stochastic variables with mean and variance respectively. Then Y-X is normally distributed.
IE450 Models Relating Cycle-time, Throughput, WIP and Batch Sizes
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part VI System-level Performance Models for the Web (Book, Chapter 8)
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Model of the Nodes in the Packet Network Chapter 10.
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
Manager ethics ETHICAL DECISION MAKING MODEL Slovak University of Technology Faculty of Material Science and Technology in Trnava.
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.
1 Queuing Delay and Queuing Analysis. RECALL: Delays in Packet Switched (e.g. IP) Networks End-to-end delay (simplified) = End-to-end delay (simplified)
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
Random Variables r Random variables define a real valued function over a sample space. r The value of a random variable is determined by the outcome of.
Managerial Decision Making Chapter 13 Queuing Models.
CPU Scheduling G.Anuradha Reference : Galvin. CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time.
1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.
CHAPTER 11 and appendix RELEVANT COSTS With LINEAR PROGRAMMING.
Ó 1998 Menascé & Almeida. All Rights Reserved.1 Part VI System-level Performance Models for the Web.
Dan C. Marinescu Office: HEC 439 B. Office hours: M, Wd 3 – 4:30 PM.
B.Ramamurthy Appendix A
CPU Scheduling G.Anuradha
Chapter 6: CPU Scheduling
Chapter 5: CPU Scheduling
Delays Deterministic Stochastic Assumes “error free” type case
Chapter 5 Process Analysis.
Variability 8/24/04 Paul A. Jensen
Mitchell Jareo MAT4340 – Operations Research Dr. Bauldry
Delays Deterministic Stochastic Assumes “error free” type case
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
CSE 550 Computer Network Design
Chapter 5 Process Analysis.
Use invNorm (2nd VARS 3) functions: Use invT (2nd VARS 4) functions:
Presentation transcript:

Problem definition and Analysis

Scope Performance indicators (system time, resource occupation, cost,...) Key object classes (order, delivery,...) and actions. Actions cause state change of objects. Necessary for understanding and modeling. Solution alternatives Problems to be addressed Account for expected future developments Define what to study (and what not). Too much = wasted work!

Objects and actions A citizen can be in various states: e.g. not involved, entered, being judged, being instructed, away for 2nd photo, back, being helped, finished. Servant's states: idle, judging, instructing, processing. Objects have a life cycle, consisting of states. For example, for the passport case, citizen and civil servant objects do matter. Passport actions? Ferry objects and actions?

Performance indicators Ferry case? Passport case: average lead time, standard deviation. maximum queue size (facilities). occupation rate of civil servant. Average lead time and standard deviation for A to B and for B to A cars.

Problems and solutions Ferry case? Passport case: Long queues (possibly, depending on demand) Solutions: approve more, skip judgement, appointment system Which new ferry to buy Consider future developments extrapolate trends beware special circumstances!

Analysis Parameters: - maximal capacity of key resource(s) -  : arrival intensity divided by capacity ( both measured in nr of cases per time unit) Analyze extreme cases: - small  -  almost 1 Capacity and intensity can be estimated or assumed.

Passport problem case: citizen needing document resource: civil servant Problem: long queues. Proposed solutions: - less strict judgement - oblige photo from preferred shop performance measured by system time (wait time + service time).

Passport analysis Passport/photo example: accept ratio a, with 0 < a < 1 average time to instruct photo remake: t average time to create document: u Average resource time needed for client: u + a.t (= waiting time in absence of queues) Average influx  clients per u + a.t time units.  ≥1: not enough resource capacity; infinite waiting time. Analyze extreme cases. Assuming M/M/1 queue (appendix F), we obtain an average service time of ( u + a.t) / ( 1 -  ).

M/M/1 passport queue time / ( u + a.t )

Passport case Simulation needed? Proposed solutions: - less strict judgement - oblige photo from preferred shop - introduce an appointment system Give comment on proposals Can you think of additional constraints that preclude the problem's analysis? Beware of tunnel vision!

Ferry problem case: car needing to cross resource: ferry Problem: new ferry needed Proposed alternatives: - faster, less cars - slower, more cars performance measured by system time (wait time + service time).

Ferry analysis Ferry example: cycle time: c; up to n ≥10 places per cycle (batch size) capacity: n/c cars per time unit Input:  (n/c) cars per time unit;  <1. Minimum average waiting time c/2. Processing: fixed time c /2. Low influx (e.g.  ≤ 0.3 ): negligible probability of more than n waiting cars. average system time c + .

Ferry queue time / c 

Two ferries are proposed. For ferry 1, cycle time c equals 6 minutes, n equals 10. For ferry 2, c equals 8 minutes and n equals 15. systime ferry 2 systime ferry 1 system time (minutes) intensity (cars per minute)

Standard deviation important for traffic studies. measured times: 5,11,13, 7,14; average: 10 measured times: 8,11,10, 9,12; average: 10 How do the two ferries compare w.r.t. stdev?

Ferry case Simulation needed? Give essential characteristics. M/D/1 queue with batches extra time for getting on/off Choice between alternatives depends on traffic intensity. Increase expected? Decision based on mean throughput time  and standard deviation . For only plm. 15% of cases, throughput time exceeds   .

Homework: Study chapter 3 and appendix F of lecture notes. Special attention to Little's formula and M/M/1. Assignment (individual, discussions encouraged): Write DCT report (2 pags A4), defining concepts pertaining to the case. Indicate a few promising solution strategies. Classwork/Homework Classwork: Exercises on page 6 and 10 of lecture notes. Analyze DCT case, pose additional questions, propose strategies. (give evidence by analysis) Mail to