Stochastic Models of Manufacturing Systems
|
|
- Amber Cox
- 5 years ago
- Views:
Transcription
1 Stochastic Models of Manufacturing Systems Ivo Adan
2 Exponential closed networks 2/55 Workstations 1,..., M Workstation m has c m parallel identical machines N circulating jobs (N is the population size) Processing times in workstation m are exponential with rate Processing order is FCFS Buffers are unlimited Markovian routing: job moves from workstation m to n with probability p mn This network is also called Closed Jackson network
3 Exponential closed networks 3/55! #"%$&$('*),+-./0 4/8# : /0*4
4 Example: Robotic barn 4/55
5 Example: Robotic barn 5/55 How to design a robotic barn? How many robots?
6 Example: Robotic barn 6/55 Closed network with K circulating cows and 6 workstations: 1. Milking robot, 2. Concentrate feeder, 3. Forage lane, 4. Water trough, 5. Cubicle and 6. (artifical one) Walking.
7 Example: Robotic barn 7/55 Closed network with K circulating cows and 6 workstations: Milking Concentrate Forage Walking Water Cublices
8 Example: Zone-Picking 8/55 Main conveyor Segment entrance Segment conveyor Segment System entrance/exit
9 Example: Zone-Picking 9/55 Issues in design: What should be the layout of the network? Size of zones? Where to locate items? What number of pickers and zones? Required CONWIP level?
10 Example: Single Zone 10/55 Storage Zone Weight check Buffer System entrance/exit Recirculation Tote Order picker
11 Example: Single Zone 11/55 System entrance/exit e Conveyor c 1 Zone z 1. Conveyor c 2 Conveyor c 3 Zone z 2.. Closed network with K totes and 6 workstations
12 Example: KIVA robots 12/55
13 Example: KIVA robots 13/55 How to design a KIVA system? How many robots?
14 Example: KIVA robots 14/55 Buffer area in front of aisle T ravel time of robot within aisle T ravel time of robot in departure path of cross aisle 2 1 T ravel time of robot on arrival path of cross aisle N + 1 N + 2 N T ime spent in order picking by the order picker N + 3 Buffer area in front of LU P oint Closed queueing network model with K circulating robots
15 Example: Container terminal 15/55 How many AGVs needed for unloading ship?
16 Example: Container terminal 16/55 Figure 1: Overview Abstract of view the of model load/unload of a sea process container terminal. 1
17 Example: Container terminal 17/55 Figure 2: Closed Queuing queueing network. network The servers model withtwo K circulating circles represent AGVs the twophase servers. The servers with an arrow through the circle represent the load dependent servers.
18 Exponential single server network 18/55 States of network (k 1,..., k M ) where k m is number of jobs in workstation m Note that M k m = N m=1 so there are ( N+M 1) M 1 states! State probabilities p(k 1, k 2,..., k M ) satisfy balance equations (c m = 1) p(k) M ɛ(k m ) = m=1 M M n=1 m=1 p(k + e n e m )µ n p nm ɛ(k m ) where e m = (0,..., 1,..., 0) with 1 at place m and ɛ(k) = { 1 if k > 0 0 else
19 Exponential single server network 19/55 Product form solution Jackson s miracle p(k) = Cp 1 (k 1 )p 2 (k 2 ) p M (k M ), where C is normalizing constant and p m (k m ) = ( vm ) km, k m = 0, 1,... with v m the arrival rate to workstation m This is again the product of M/M/1 solutions, where the number in station m follows the M/M/1 solution with arrival rate v m and service rate!
20 Exponential single server network 20/55 v m is the relative arrival rate or visiting frequency to m, satisfying v m = M v n p nm, n=1 m = 1,..., M Remarks: Equations above determine v m s up to a multiplicative constant Set v 1 = 1, then v m is the expected number of visits to m in between two successive visits to station 1 Product form result also valid for fixed routing Although p(k) is again a product, the queues at stations are dependent!
21 Normalizing constant 21/55 Let C(m, n) = k 1,..., k m 0 mi=1 k i = n ( v1 ) k1 ( ) k2 v2 µ 1 µ 2 ( vm ) km. So C(m, n) is sum of products in network with stations 1,..., m and population n. Clearly C = 1/C(M, N) Recursion (Buzen s algorithm): C(m, n) = C(m 1, n) + v m C(m, n 1) with initial conditions C(0, n) = 0, n = 1,..., N, C(m, 0) = 1, m = 1,..., M,
22 Normalizing constant 22/55 Recursion (Buzen s algorithm): C(m, n) = C(m 1, n) + v m C(m, n 1) with initial conditions C(0, n) = 0, n = 1,..., N, C(m, 0) = 1, m = 1,..., M, m M n N
23 Mean values 23/55 What is the real arrival rate λ m? Note that and λ M = v m C(M, N 1) C(M, N) λ m = v m v M λ M What is mean number E(L M ) in station M? E(L M ) = 1 C(M, N) N k M =0 ( ) km vm k M C(M 1, N k M ) µ M What is expected cycle time E(C) between two visits to station 1? E(C) = N λ 1 (Little s law)
24 Exponential multi server network 24/55 Product form solution p(k) = Cp 1 (k 1 )p 2 (k 2 ) p M (k M ), where C is normalizing constant and p m (k m ) = k m k=1 v m (k) where (k) = min(k, c m ) and v m the visiting frequency to workstation m This is product of M/M/c m solutions with arrival rate v m and service rate! Normalizing constant C can again be calculated via recursion (verify!)
25 Arrival theorem 25/55 Question: What is the state seen by job moving from one station to another? Total number of jumps per time unit that see the (single server) network in state k S(N 1) = {k 0 M i=1 k i = N 1} M m=1 p(k + e m ) = 1 C(M, N) p 1(k 1 ) p M (k M ) M v m, m=1 where p m (k m ) = ( vm ) km Total number of all jumps per time unit in the (single server) network M l S(N 1) m=1 p(l + e m ) = 1 C(M, N) l S(N 1) M p 1 (l 1 ) p M (l M ) v m, m=1
26 Arrival theorem 26/55 Fraction of jumps per time unit that see the network in state k S(N 1) 1 C(M,N) 1 C(M,N) p 1(k 1 ) p M (k M ) M m=1 v m l S(N 1) p 1(l 1 ) p M (l M ) = M m=1 v m 1 C(M, N 1) p 1(k 1 ) p M (k M ) which is probability that network with N 1 circulating jobs is in state k Conclusion: Arbitrary job moving from one station to another sees the network in equilibrium with a population with one job less (job does not see himself) Remarks: Also valid in multi-server networks (verify!) Also valid for jobs moving to a specific station (verify!) What is the impact of this result?
27 Mean value analysis 27/55 Define for network with population k E(S m (k)) = mean production lead time at station m m (k) = throughput of station m E(L m (k)) = mean number of jobs in station m For population k = 1, 2,..., N in single server network E(S m (k)) = E(L m (k 1)) m (k) = kv m Mn=1 v n E(S n (k)) (Arrival theorem) (Little) E(L m (k)) = m (k)e(s m (k)) with initially E(L m (0)) = 0 (Little)
28 Mean value analysis 28/55 In multi server network E(S m (k)) = m (k 1) ( 1 + E(L m (k 1)) ) m(k 1) c m where m (k 1) is probability that all servers are busy c m Approximate m (k 1) by probability of waiting in corresponding M/M/c m m (k 1) ( 1 m(k 1) c m 1 c m! ) cm 1 i=0 ( ) cm m (k 1) 1 i! ( m (k 1) ) i + 1 cm! ( m (k 1) ) cm If c m = (no waiting) E(S m (k)) = 1
29 General closed networks 29/55 In multi server station E(S m (k)) = m (k 1) E(R m) + (E(L m (k 1)) m (k 1)E(B m )) E(B m) c m c m +E(B m ) where m (k 1) is approximated by probability of waiting in M/M/c In single server station this reduces to E(S m (k)) = ρ m (k 1)E(R m ) + (L m (k 1) ρ m (k 1)) E(B m ) + E(B m ) where ρ m (k 1) = m (k 1) E(B m )
30 Example 30/55 Closed system with 4 single server stations and 10 circulating pallets:! #" $ "&% '(#)* '+, Processing characteristics: Station E(B m ) c 2 B m
31 Example 31/55 Mean value analysis: 1 (10) = parts per time unit Simulation: 1 (10) = ± parts per time unit Station E(S m (10)) amva sim ± ± ± ± 0.118
32 Example 32/55 Production system: C machines N pallets M operations to be performed each operation requires a specific tool set r m copies of tool set m v m E(B m ) is work load to be handled by tool set m
33 Example 33/55 Optimization problem: max T H(c 1, c 2,..., c m ) subject to M c m C, m=1 1 c m r m, m = 1, 2,..., M.
34 Example 34/55 Optimization problem: max T H(c 1, c 2,..., c m ) subject to M c m C, m=1 1 c m r m, m = 1, 2,..., M. Heuristic solution: Subsequently allocate tool sets to machines allocate tool set with maximum increase in throughput
35 Example: Robotic barn 35/55 Closed network with K circulating cows and 6 workstations: 1. Milking robot, 2. Concentrate feeder, 3. Forage lane, 4. Water trough, 5. Cubicle and 6. (artifical one) Walking.
36 Example: Robotic barn 36/ Histogram of the processing time (in min.) in the milking robot:
37 Example: Robotic barn 37/55 Processing times in the facilities of the barn: Processing time (in min.) Facility Routing probability Mean Standard deviation Milking robot Concentrate feeder Forage lane Water trough Cubicle
38 Example: Robotic barn 38/55 Milking Concentrate Forage Walking Water Cublices General closed network model of robotic dairy barn.
39 Type Cow 39/55 type cow = tuple (real arr; int stat); type cow_walk = tuple(cow x; timer t);
40 Buffer 40/55 proc B(chan? cow a; chan! cow b): list cow xs; cow x; end while true: select a?x: xs = xs + [x] alt size(xs) > 0, b!xs[0]: xs = xs[1:] end end
41 Machine 41/55 proc M(chan? cow a; chan! cow b, c; dist real u): cow x; end while true: a?x; b!x; delay sample u; c!x; end
42 Workstation 42/55 proc W(chan? cow a; chan! cow b, c; dist real u; int m): chan cow d; run B(a,d), unwind j in range(m): M(d, b, c, u) end end
43 Workstation Walking 43/55 proc WLK(chan? cow a; list chan! cow b; real walk): list cow_walk xst; cow x; list(1000) int dest; for i in range(1000): if i < 164: dest[i] = 0; elif i < 319: dest[i] = 1;... while true: select a?x: x.arr = time + walk; x.stat = dest[sample uniform(0, 1000)]; xst = xst + [(x, timer(walk))] alt not empty(xst) and ready(xst[0].t), b[xst[0].x.stat]!xst[0].x: xst = xst[1:]
44 Model Dairy Barn 44/55 model DairyBarn(): chan cow a, c; list(5) chan cow b; run G(a, 10), WLK(a, b, 5.0), W(b[0], c, a, exponential(8.41), 1), W(b[1], c, a, exponential(6.38), 1), W(b[2], c, a, exponential(15.0), 1), W(b[3], c, a, exponential(3.18), 1), W(b[4], c, a, exponential(38.9), 1), E(c, ) end
45 Multiple visits to work stations 45/55 n m distinct types of operations at (single server) work station m v mr visits to work station m for type r operation mean processing time for type r operation at work station m is E(B mr ) mean residual processing time is E(R mr )
46 Multiple visits to work stations 46/55 Define E(S mr (k)) = mean production lead time at station m for job of type r operation mr (k) = arrival rate at station m of jobs for type r operation E(L mr (k)) = mean number of jobs at station m for type r operation Then E(S mr (k)) = n m s=1 ρ ms (k 1)E(R ms ) + +E(B mr ) n m s=1 where ρ ms (k 1) = ms (k 1)E(B ms ) and kv mr mr (k) = Mn=1 nm s=1 v ns E(S ns (k)) E(L mr (k)) = mr (k)e(s mr (k)) (E(L ms (k 1)) ρ ms (k 1))E(B ms )
47 Closed multi-class networks 47/55 Workstations 1,..., M Workstation m has c m parallel identical machines R job types N r circulating jobs of type r Processing times in workstation m are exponential with rate (so processing times are job-type independent!) Processing order is FCFS Buffers are unlimited Markovian routing: type r job moves from workstation m to n with probability p r mn (so each job type has its own Markovian routing) This network is also called Closed multi-class Jackson network
48 Closed multi-class networks 48/55 States of network (k 1,..., k M ) where k m = (k m1,..., k m R ) is the aggregate situation in station k k mr is the number of type r jobs in workstation m Note that for each r M k mr = N r m=1 v mr is the relative visiting frequency to station m of type r jobs satisfying v mr = M n=1 v nr pnm r, m = 1, 2,..., M.
49 Closed multi-class networks 49/55 Jackson s miracle p(k) = Cp 1 (k 1 )p 2 (k 2 ) p M (k M ), where C is normalizing constant If c m = 1 p m (k m ) = (k m1 + k m2 + + k m R )! k m1!k m2! k m R! If c m > 1 p m (k m ) = (k m1 + k m2 + + k m R )! k m1!k m2! k m R! where (k) = min(k, c m ) ( vm1 ) km1 ( ) km2 vm2 ( vm R ) km R v k m1 m1 vk m2 m2 vk m R m R (1) (2) (k m1 + k m2 + + k m R )
50 Arrival theorem 50/55 Arbitrary type r job moving from one station to another sees the network in equilibrium with a population with one job of his own type less (job does not see himself) N = (N 1, N 2,..., N R ) is the population vector So jumping type r job sees the network in equilibrium with population N e r
51 Mean value analysis Define for network with population N E(S mr (N)) = mean production lead time at work station m for type r job mr (N) = throughput of type r jobs of station m E(L mr (N)) = mean number of type r jobs in station m 51/55 In single-server network r E(S mr (N)) = E(L ms (N e r )) s=1 N r v mr mr (N) = Mn=1 v nr E(S nr (N)) E(L mr (N)) = mr (N)E(S mr (N)) with initially E(L ms (0)) Recursion over population vector N, starting from k = 0 to k = N!
52 Priority stations Define for network with population N E(W mr (N)) = mean waiting time at work station m for type r job mr (N) = throughput of type r jobs of station m E(Q mr (N)) = mean number of type r jobs waiting in station m 52/55 In non-preemptive (single server) priority station m (type 1 highest priority) R E(W mr (N)) = ρ ms (N e r ) 1 r + s=1 r 1 + s=1 where ρ mr (N) = mr (N) 1 s=1 ms (N e r )E(W mr (N)) 1 E(Q ms (N e r )) 1
53 Fixed-point modeling 53/55 Breaking the recursion: Assume jumping type r job sees the system in equilibrium with population N (instead of N e r ) In FCFS single server station m E(S mr (N)) = r s=1 E(L ms (N)) So mean number seen on arrival is mean number in system including himself
54 Fixed-point modeling 54/55 Breaking the recursion: Assume jumping type r job sees the system in equilibrium with population N (instead of N e r ) In FCFS single server station m E(S mr (N)) = r s=1 E(L ms (N)) So mean number seen on arrival is mean number in system including himself To avoid self queueing E(S mr (N)) = s =r E(L ms (N)) 1 + N r 1 N r E(L mr (N)) 1 + 1
55 Fixed-point modeling 55/55 3M R equations for 3M R unknowns E(S mr (N)), mr (N) and E(L mr (N)) E(S mr (N)) = s =r E(L ms (N)) 1 + N r 1 N r E(L mr (N)) mr (N) = N r v mr Mn=1 v nr E(S nr (N)) E(L mr (N)) = mr (N)E(S mr (N)) Solution by successive substitutions
15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More information15 Closed production networks
5 Closed production networks In the previous chapter we developed and analyzed stochastic models for production networks with a free inflow of jobs. In this chapter we will study production networks for
More informationStochastic Models of Manufacturing Systems
Stochastic Models of Manufacturing Systems Ivo Adan Systems 2/49 Continuous systems State changes continuously in time (e.g., in chemical applications) Discrete systems State is observed at fixed regular
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
More informationStochastic Models of Manufacturing Systems
Stochastic Models of Manufacturing Systems Ivo Adan Organization 2/47 7 lectures (lecture of May 12 is canceled) Studyguide available (with notes, slides, assignments, references), see http://www.win.tue.nl/
More informationBuzen s algorithm. Cyclic network Extension of Jackson networks
Outline Buzen s algorithm Mean value analysis for Jackson networks Cyclic network Extension of Jackson networks BCMP network 1 Marginal Distributions based on Buzen s algorithm With Buzen s algorithm,
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More information11 The M/G/1 system with priorities
11 The M/G/1 system with priorities In this chapter we analyse queueing models with different types of customers, where one or more types of customers have priority over other types. More precisely we
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationMarkov Processes and Queues
MIT 2.853/2.854 Introduction to Manufacturing Systems Markov Processes and Queues Stanley B. Gershwin Laboratory for Manufacturing and Productivity Massachusetts Institute of Technology Markov Processes
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationQueueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions
Queueing Theory II Summary! M/M/1 Output process! Networks of Queue! Method of Stages " Erlang Distribution " Hyperexponential Distribution! General Distributions " Embedded Markov Chains M/M/1 Output
More informationScheduling I. Today Introduction to scheduling Classical algorithms. Next Time Advanced topics on scheduling
Scheduling I Today Introduction to scheduling Classical algorithms Next Time Advanced topics on scheduling Scheduling out there You are the manager of a supermarket (ok, things don t always turn out the
More informationScheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling
Scheduling I Today! Introduction to scheduling! Classical algorithms Next Time! Advanced topics on scheduling Scheduling out there! You are the manager of a supermarket (ok, things don t always turn out
More informationIntroduction to queuing theory
Introduction to queuing theory Claude Rigault ENST claude.rigault@enst.fr Introduction to Queuing theory 1 Outline The problem The number of clients in a system The client process Delay processes Loss
More informationChapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 6 Queueing Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
More informationQueuing Theory. Using the Math. Management Science
Queuing Theory Using the Math 1 Markov Processes (Chains) A process consisting of a countable sequence of stages, that can be judged at each stage to fall into future states independent of how the process
More informationCDA5530: Performance Models of Computers and Networks. Chapter 4: Elementary Queuing Theory
CDA5530: Performance Models of Computers and Networks Chapter 4: Elementary Queuing Theory Definition Queuing system: a buffer (waiting room), service facility (one or more servers) a scheduling policy
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationSlides 9: Queuing Models
Slides 9: Queuing Models Purpose Simulation is often used in the analysis of queuing models. A simple but typical queuing model is: Queuing models provide the analyst with a powerful tool for designing
More informationPBW 654 Applied Statistics - I Urban Operations Research
PBW 654 Applied Statistics - I Urban Operations Research Lecture 2.I Queuing Systems An Introduction Operations Research Models Deterministic Models Linear Programming Integer Programming Network Optimization
More informationAnalysis of Software Artifacts
Analysis of Software Artifacts System Performance I Shu-Ngai Yeung (with edits by Jeannette Wing) Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 2001 by Carnegie Mellon University
More informationQueueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
More informationModule 5: CPU Scheduling
Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained
More informationOperational Laws Raj Jain
Operational Laws 33-1 Overview What is an Operational Law? 1. Utilization Law 2. Forced Flow Law 3. Little s Law 4. General Response Time Law 5. Interactive Response Time Law 6. Bottleneck Analysis 33-2
More informationA PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS
A PARAMETRIC DECOMPOSITION BASED APPROACH FOR MULTI-CLASS CLOSED QUEUING NETWORKS WITH SYNCHRONIZATION STATIONS Kumar Satyam and Ananth Krishnamurthy Department of Decision Sciences and Engineering Systems,
More informationIntro to Queueing Theory
1 Intro to Queueing Theory Little s Law M/G/1 queue Conservation Law 1/31/017 M/G/1 queue (Simon S. Lam) 1 Little s Law No assumptions applicable to any system whose arrivals and departures are observable
More informationControl of Fork-Join Networks in Heavy-Traffic
in Heavy-Traffic Asaf Zviran Based on MSc work under the guidance of Rami Atar (Technion) and Avishai Mandelbaum (Technion) Industrial Engineering and Management Technion June 2010 Introduction Network
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationA Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers
UNIVERSITY OF OKLAHOMA GENERAL EXAM REPORT A Study on Performance Analysis of Queuing System with Multiple Heterogeneous Servers Prepared by HUSNU SANER NARMAN husnu@ou.edu based on the papers 1) F. S.
More informationGlossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP
Glossary availability The long-run average fraction of time that the processor is available for processing jobs, denoted by a (p. 113). cellular manufacturing The concept of organizing the factory into
More information4.7 Finite Population Source Model
Characteristics 1. Arrival Process R independent Source All sources are identical Interarrival time is exponential with rate for each source No arrivals if all sources are in the system. OR372-Dr.Khalid
More information5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.
The objective of queuing analysis is to offer a reasonably satisfactory service to waiting customers. Unlike the other tools of OR, queuing theory is not an optimization technique. Rather, it determines
More informationAnalytical Approximations to Predict Performance Measures of Manufacturing Systems with Job Failures and Parallel Processing
Florida International University FIU Digital Commons FIU Electronic Theses and Dissertations University Graduate School 3-12-2010 Analytical Approximations to Predict Performance Measures of Manufacturing
More informationElementary queueing system
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue M/M/1 with preemptive-resume priority M/M/1 with non-preemptive priority 1 History of queueing theory An old
More informationKendall notation. PASTA theorem Basics of M/M/1 queue
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue 1 History of queueing theory An old research area Started in 1909, by Agner Erlang (to model the Copenhagen
More informationQueuing Theory. The present section focuses on the standard vocabulary of Waiting Line Models.
Queuing Theory Introduction Waiting lines are the most frequently encountered problems in everyday life. For example, queue at a cafeteria, library, bank, etc. Common to all of these cases are the arrivals
More informationλ λ λ In-class problems
In-class problems 1. Customers arrive at a single-service facility at a Poisson rate of 40 per hour. When two or fewer customers are present, a single attendant operates the facility, and the service time
More informationImproved Algorithms for Machine Allocation in Manufacturing Systems
Improved Algorithms for Machine Allocation in Manufacturing Systems Hans Frenk Martine Labbé Mario van Vliet Shuzhong Zhang October, 1992 Econometric Institute, Erasmus University Rotterdam, the Netherlands.
More informationA product form solution to a system with multi-type jobs and multi-type servers Visschers, J.W.C.H.; Adan, I.J.B.F.; Weiss, G.
A product form solution to a system with multi-type jobs and multi-type servers Visschers, JWCH; Adan, IJBF; Weiss, G Published: 01/01/2011 Document Version Publisher s PDF, also known as Version of Record
More information6 Solving Queueing Models
6 Solving Queueing Models 6.1 Introduction In this note we look at the solution of systems of queues, starting with simple isolated queues. The benefits of using predefined, easily classified queues will
More informationClassical Queueing Models.
Sergey Zeltyn January 2005 STAT 99. Service Engineering. The Wharton School. University of Pennsylvania. Based on: Classical Queueing Models. Mandelbaum A. Service Engineering course, Technion. http://iew3.technion.ac.il/serveng2005w
More informationStructured Markov Chains
Structured Markov Chains Ivo Adan and Johan van Leeuwaarden Where innovation starts Book on Analysis of structured Markov processes (arxiv:1709.09060) I Basic methods Basic Markov processes Advanced Markov
More informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationSolutions to COMP9334 Week 8 Sample Problems
Solutions to COMP9334 Week 8 Sample Problems Problem 1: Customers arrive at a grocery store s checkout counter according to a Poisson process with rate 1 per minute. Each customer carries a number of items
More informationExercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems
Exercises Solutions Note, that we have not formulated the answers for all the review questions. You will find the answers for many questions by reading and reflecting about the text in the book. Chapter
More informationLink Models for Packet Switching
Link Models for Packet Switching To begin our study of the performance of communications networks, we will study a model of a single link in a message switched network. The important feature of this model
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained
More informationCOMP9334: Capacity Planning of Computer Systems and Networks
COMP9334: Capacity Planning of Computer Systems and Networks Week 2: Operational analysis Lecturer: Prof. Sanjay Jha NETWORKS RESEARCH GROUP, CSE, UNSW Operational analysis Operational: Collect performance
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationBasic Queueing Theory
After The Race The Boston Marathon is a local institution with over a century of history and tradition. The race is run on Patriot s Day, starting on the Hopkinton green and ending at the Prudential Center
More informationCHAPTER 4. Networks of queues. 1. Open networks Suppose that we have a network of queues as given in Figure 4.1. Arrivals
CHAPTER 4 Networks of queues. Open networks Suppose that we have a network of queues as given in Figure 4.. Arrivals Figure 4.. An open network can occur from outside of the network to any subset of nodes.
More informationVARUN GUPTA. Takayuki Osogami (IBM Research-Tokyo) Carnegie Mellon Google Research University of Chicago Booth School of Business.
VARUN GUPTA Carnegie Mellon Google Research University of Chicago Booth School of Business With: Taayui Osogami (IBM Research-Toyo) 1 2 Homogeneous servers 3 First-Come-First-Serve Buffer Homogeneous servers
More informationOn the Partitioning of Servers in Queueing Systems during Rush Hour
On the Partitioning of Servers in Queueing Systems during Rush Hour This paper is motivated by two phenomena observed in many queueing systems in practice. The first is the partitioning of server capacity
More informationPERFORMANCE ANALYSIS OF MULTI-SERVER TANDEM QUEUES WITH FINITE BUFFERS AND BLOCKING
PERFORMANCE ANALYSIS OF MULTI-SERVER TANDEM QUEUES WITH FINITE BUFFERS AND BLOCKING Marcel van Vuuren a, Ivo J.B.F. Adan a and Simone A. E. Resing-Sassen b a Eindhoven University of Technology, P.O. Box
More informationConvolution Algorithm
Convolution Algorithm Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-08/
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-11/
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationA POPULATION-MIX DRIVEN APPROXIMATION FOR QUEUEING NETWORKS WITH FINITE CAPACITY REGIONS
A POPULATION-MIX DRIVEN APPROXIMATION FOR QUEUEING NETWORKS WITH FINITE CAPACITY REGIONS J. Anselmi 1, G. Casale 2, P. Cremonesi 1 1 Politecnico di Milano, Via Ponzio 34/5, I-20133 Milan, Italy 2 Neptuny
More informationAnalysis of A Single Queue
Analysis of A Single Queue Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings
More informationThroughput Optimization in Single and Dual-Gripper Robotic Cells
Throughput Optimization in Single and Dual-Gripper Robotic Cells U.V. Manoj; manojuv@tamu.edu College of Engineering, Texas A&M University, College Station, TX Chelliah Sriskandarajah Mays Business School,
More informationMulti-class, multi-server queues with non-preemptive priorities
Multi-class, multi-server queues with non-preemptive priorities Andrei Sleptcheno. EURANDOM, Eindhoven University of Technology, P.O. Box 53, 5600MB Eindhoven, The Netherlands. e-mail:sleptcheno@eurandom.tue.nl
More informationP (L d k = n). P (L(t) = n),
4 M/G/1 queue In the M/G/1 queue customers arrive according to a Poisson process with rate λ and they are treated in order of arrival The service times are independent and identically distributed with
More informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
More informationDesign of Plant Layouts with Queueing Effects
Design of Plant Layouts with Queueing Effects Saifallah Benjaafar Department of echanical Engineering University of innesota inneapolis, N 55455 July 10, 1997 Abstract In this paper, we present a formulation
More informationNATCOR: Stochastic Modelling
NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control
More informationCSM: Operational Analysis
CSM: Operational Analysis 2016-17 Computer Science Tripos Part II Computer Systems Modelling: Operational Analysis by Ian Leslie Richard Gibbens, Ian Leslie Operational Analysis Based on the idea of observation
More informationChapter 10. Queuing Systems. D (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines.
Chapter 10 Queuing Systems D. 10. 1. (Queuing Theory) Queuing theory is the branch of operations research concerned with waiting lines. D. 10.. (Queuing System) A ueuing system consists of 1. a user source.
More informationCourse Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design
Course Outline Introduction to Transportation Highway Users and their Performance Geometric Design Pavement Design Speed Studies - Project Traffic Queuing Intersections Level of Service in Highways and
More informationStationary Analysis of a Multiserver queue with multiple working vacation and impatient customers
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 932-9466 Vol. 2, Issue 2 (December 207), pp. 658 670 Applications and Applied Mathematics: An International Journal (AAM) Stationary Analysis of
More informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
More informationManagement of intermodal container terminals using feedback control
Management of intermodal container terminals using feedback control A. Alessandri, S. Sacone $, S.Siri $ Institute of Intelligent Systems for Automation ISSIA-CNR National Research Council of Italy Via
More information1 Markov decision processes
2.997 Decision-Making in Large-Scale Systems February 4 MI, Spring 2004 Handout #1 Lecture Note 1 1 Markov decision processes In this class we will study discrete-time stochastic systems. We can describe
More informationSystems Simulation Chapter 6: Queuing Models
Systems Simulation Chapter 6: Queuing Models Fatih Cavdur fatihcavdur@uludag.edu.tr April 2, 2014 Introduction Introduction Simulation is often used in the analysis of queuing models. A simple but typical
More informationBatch Arrival Queuing Models with Periodic Review
Batch Arrival Queuing Models with Periodic Review R. Sivaraman Ph.D. Research Scholar in Mathematics Sri Satya Sai University of Technology and Medical Sciences Bhopal, Madhya Pradesh National Awardee
More informationStationary remaining service time conditional on queue length
Stationary remaining service time conditional on queue length Karl Sigman Uri Yechiali October 7, 2006 Abstract In Mandelbaum and Yechiali (1979) a simple formula is derived for the expected stationary
More informationOn the Partitioning of Servers in Queueing Systems during Rush Hour
On the Partitioning of Servers in Queueing Systems during Rush Hour Bin Hu Saif Benjaafar Department of Operations and Management Science, Ross School of Business, University of Michigan at Ann Arbor,
More informationContents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory
Contents Preface... v 1 The Exponential Distribution and the Poisson Process... 1 1.1 Introduction... 1 1.2 The Density, the Distribution, the Tail, and the Hazard Functions... 2 1.2.1 The Hazard Function
More informationMulti Heterogeneous Queueing Server System. General Exam Oral Examination Fall 2012 prepared by Husnu Saner Narman
Multi Heterogeneous Queueing Server System General Exam Oral Examination Fall 2012 prepared by Husnu Saner Narman Content Motivation Contribution Multi Heterogeneous System First Model Analysis of First
More informationSection 3.3: Discrete-Event Simulation Examples
Section 33: Discrete-Event Simulation Examples Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 33: Discrete-Event Simulation
More informationCHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK
CHAPTER 3 STOCHASTIC MODEL OF A GENERAL FEED BACK QUEUE NETWORK 3. INTRODUCTION: Considerable work has been turned out by Mathematicians and operation researchers in the development of stochastic and simulation
More informationTHE ON NETWORK FLOW EQUATIONS AND SPLITTG FORMULAS TRODUCTION FOR SOJOURN TIMES IN QUEUEING NETWORKS 1 NO FLOW EQUATIONS
Applied Mathematics and Stochastic Analysis 4, Number 2, Summer 1991, III-I16 ON NETWORK FLOW EQUATIONS AND SPLITTG FORMULAS FOR SOJOURN TIMES IN QUEUEING NETWORKS 1 HANS DADUNA Institut flit Mathematische
More informationEE 368. Weeks 3 (Notes)
EE 368 Weeks 3 (Notes) 1 State of a Queuing System State: Set of parameters that describe the condition of the system at a point in time. Why do we need it? Average size of Queue Average waiting time How
More informationAn M/M/1 Queue in Random Environment with Disasters
An M/M/1 Queue in Random Environment with Disasters Noam Paz 1 and Uri Yechiali 1,2 1 Department of Statistics and Operations Research School of Mathematical Sciences Tel Aviv University, Tel Aviv 69978,
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
More informationCPU scheduling. CPU Scheduling
EECS 3221 Operating System Fundamentals No.4 CPU scheduling Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University CPU Scheduling CPU scheduling is the basis of multiprogramming
More informationCPU Scheduling. CPU Scheduler
CPU Scheduling These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and print a single copy of each
More informationJELMER PIER VAN DER GAAST. Stochastic models for order picking systems
JELMER PIER VAN DER GAAST Stochastic models for order picking systems Stochastic Models for Order Picking Systems Stochastic Models for Order Picking Systems Stochastische modellen voor orderverzamelsystemen
More informationMULTIPLE CHOICE QUESTIONS DECISION SCIENCE
MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects
More informationQueueing Theory and Simulation. Introduction
Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan
More informationIntroduction to Queuing Theory. Mathematical Modelling
Queuing Theory, COMPSCI 742 S2C, 2014 p. 1/23 Introduction to Queuing Theory and Mathematical Modelling Computer Science 742 S2C, 2014 Nevil Brownlee, with acknowledgements to Peter Fenwick, Ulrich Speidel
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationHomework 1 - SOLUTION
Homework - SOLUTION Problem M/M/ Queue ) Use the fact above to express π k, k > 0, as a function of π 0. π k = ( ) k λ π 0 µ 2) Using λ < µ and the fact that all π k s sum to, compute π 0 (as a function
More information