Simulating Queuing Models in SAS

Size: px
Start display at page:

Download "Simulating Queuing Models in SAS"

Transcription

1 ABSTRACT Simulating Queuing Models in SAS Danny Rithy, California Polytechnic State University, San Luis Obispo, CA This paper introduces users to how to simulate queuing models using SAS. SAS will simulate queuing system in which entities (like customers, patients, cars or messages) arrive, get served either at a single station or at several stations in turn, might have to wait in one or more queues for service, and then may leave. After the simulation, SAS will give a graphical output as well as statistical analysis of the desired queuing model. INTRODUCTION Queuing is a common occurrence in everyday life. From the customer perspective, we want to be served as quickly as possible. From the company s perspective, we want a smooth process flow so customers do not need stay in the system for an inappropriately long period of time. Unfortunately, businesses have limited resources so they cannot hire many employees or machines to serve all their customers. A standard queuing system is needed in order to balance the needs and desires of both customers and service. To analyze the efficiency of such a system, our approach will be to simulate queuing models. Queuing models are analytical modeling approaches that develop a simulation of the process of the system. In the real world, every service has a system where customers have to go through a process. For example, a grocery store has several checkout lanes so customers pay their groceries and exit once they finished. A patient enters a hospital to receive treatment for an illness and exits the hospital once they have completed acute treatment. There are many components that build each individually unique system. In our grocery store example, we have the grocery cart corral, individual product aisles, front-end purchase centers, registers, and bagging stations. In the hospital example, we have registration, the urgent-care clinic, exam rooms, treatment rooms, discharge, and pharmacy. Any system is always consisted of queues (waiting lines) and service. Queuing theory is usually introduced in stochastic processes, (stochastic) operations research, and discrete event simulation to industrial engineers, operations researchers and statisticians. The math behind these models is based on continuous-time Markov chains, of which will not be covered in this paper. This paper will show how SAS users can simulate queuing models based on real world operations. An alternative approach is to use a discrete event simulation software to point-and-click the component of the system for better visualization and less computation-intense. ARRIVAL, SERVICE AND QUEUE CHARACTERISTICS There are two main characteristics in the queuing models: arrival and service distribution. The arrival distribution describes the customer s arrival into the system. It can be either finite or infinite. The distribution usually follows the Poisson distribution. A customer doesn t always arrive and waits in the queue. Their behavior depends on the number of customers waiting in line. They can be patient, balking (those who do not join a queue due to the long line), and reneging (those who join a queue but leave before being served). The service distribution describes the service time during which a customer is being served. It can be either constant or random. The distribution usually follows an exponential distribution. However, it can be any distribution where mean and variance are known. There are several ways to serve each customer from the queue when the server completes the service of the current customer. First-In First-Out is a common discipline to serve customers on a first-in first-out basis. Last-In First-Out is also a common discipline to serve customers on a last-in first-out basis. Priority occurs when a customer is served based on the importance to complete their service requirement. 1

2 KENDALL NOTATION Kendall s notation describes and classifies a queuing node, which denotes as A/B/s where: A = The arrival distribution. M represents Markovian which it follows a Poisson distribution. D represents constant or deterministic distribution. G represents a general distribution where mean and variance are known. The Greek letter λ (lambda) represents the arrival distribution. B = The service time distribution. M represents Markovian which it follows an exponential distribution. D represents a constant or deterministic distribution. G represents a general distribution where mean and variance are known. The Greek letter μ (mu) represents the service distribution. s = Number of servers. For example, the M/M/1 is the simplest queuing system where the arrival distribution represents a Poisson distribution, the service distribution represents an exponential distribution and the system has one server. An ATM is a typical example of the M/M/1 queuing system. QUEUE PERFORMANCE By the end of the simulation, we want to know the following questions: How long does each customer being served in the system, on average? What is the probability that there is no customers in the queue? What is the average time that each customer is waiting in the line? How many servers do we need? These questions are typically measure the system performance with the following metrics: W q = Average time that each customer spends in the queue. W = Average time that each customer spends in the system. L q = Average number of customers in the queue. L = Average number of customers in the system. ρ = Utilization factor in the system (e.g probability that all servers are busy). One thing to note is ρ has to between 0 and 1 (the average service rate is greater than the average arrival rate; or λ < μ). This means that the system has too many customers waiting in line than the servers provide. In the long run, the system will be overload. STATISTICAL ANALYSIS OF THE SIMULATION RESULTS In order to understand a system, we need to measure the system performance with the metrics using PROC MEANS. The following statements are PROC MEANS for a specific metric. &system is a macro variable where it contains a dataset of the simulation in a specific queuing system from the DATA step. The following metrics are defined in the DATA step and used in the VAR statement for PROC MEANS: Xt is the number of customers in the system at time t. Lq is the number of customers in the queue at time t. In the DATA step, we define Lq as: Xt 1. This can only calculated if there are greater than one customer in the system, or Xt > 1. Wn is the waiting time in the system for customer nth. Wn_Lq is the waiting time in the queue for customer nth. p is defined as an indicator variable whether there is a customer at time t. To calculate L, we simply specify Xt in the VAR statement. title "Average Number of Customers in the System"; var Xt; ODS OUTPUT Means.Summary = L; 2

3 To calculate Lq, we specify Lq in the VAR statement. title "Average Number of Customers in the Queue"; var Lq; ODS OUTPUT Means.Summary = Lq; In this statements, we want to take the average of Wn. The WHERE statement takes a subset of each customer leaving the system and more than one customer in the system. This reveals the amount of time each customer spends in the system. title "Average Time in the System"; var Wn; where event = -1 or Xt >= 1; ODS OUTPUT Means.Summary = W; In this statements, we want to take the average of Wn_Lq. The WHERE statement takes a subset only when there are more than one customer in the system. The server can serve only one customer at a time, so any customer who enters the system while the server is busy must wait in line. title "Average Waiting Time in the Queue"; var Wn_Lq; where Lq >= 1 and event = 1; ODS OUTPUT Means.Summary = Wq; To calculate p, again, we specify p in the VAR statement to take the average. title "Average Server Utilization"; var p; ODS OUTPUT Means.Summary = rho; M/M/1 QUEUE Suppose we have a single server in a small grocery store. Customer arrival at the small grocery store holds a Poisson distribution at a mean rate of 15 customers per hour. A server can serve each customer with an exponential distribution at a mean service rate of 20 customers per hour. Display 1 reveals the step plot of the number of customers who stay in the system over time where there is only one server. Depending on the arrival and service rate, the numbers will vary. If the service rate is much higher than the arrival rate, then we expect to see less than two customers in the service line at any given time. However, if the arrival rate is higher than the service rate, then we expect to see the number of customers grow exponentially and at a very fast rate. Display 2 reveals the histogram of number of customers in the system. On average, the server will handle one customer at a time. Table 1 has the summary statistics of the simulation. The average waiting time in the system is 32.4 seconds and the average waiting time in the queue is 25.2 seconds. The server is busy 68% of the time. 3

4 Display 1. Step Plot of number of customers in the M/M/1 system over time. Display 2. Histogram of number of customers in the M/M/1 system. 4

5 Table 2. M/M/1 result with performance metrics. M/D/1 QUEUE The M/D/1 system is similar to the M/M/1 system except its service time is deterministic. A car wash is a typical example of the M/D/1 system. Suppose that people arrive at a pizza vending machine at a rate of 15 per hour and follow a Poisson distribution. It takes exactly 3 minutes to cook a pizza for each person through the process of adding ingredients, baking, and putting into a box. In this case, we specify the service rate as 20 per hour. Display 3 reveals the step plot of number of customers stay in the M/D/1 system over time while there is one server. Because the service time is deterministic, each customer leaves the system in 3 minutes. Therefore, the departure time is constant. Display 4 reveals the histogram of number of customers in the M/D/1 system. Table 2 has the summary statistics of the simulation. The average waiting time that each person spends in the queue is 6.09 minutes. The average time that each person spends in the system and receives his pizza is minutes. The average time of the system is high due to a lengthy queue during a particular time. Display 3. Step Plot of number of customers in the M/D/1 system over time. 5

6 Display 4. Histogram of number of customers in the M/D/1 system. Table 2. M/D/1 result with performance metrics. M/G/1 QUEUE The M/G/1 system s service time has the general distribution where mean and variance are known. The distribution can any distribution ranges from binomial to normal. A repair shop is a typical example of the M/G/1 system where the repair time vary around the average. Suppose that cars arrive at an oil change station at a rate of 4 per hour and follow the Poisson distribution. It takes 12 minutes, on average, to change an oil for each car with a variance of 4 minutes. Assume the service time follows the normal distribution. Display 5 reveals the step plot of number of customers stay in the M/G/1 system over time while there is one server. Display 6 reveals the histogram of number of customers in the M/G/1 system. Table 3 has the summary statistics of the simulation. The average waiting time that each person spends in the queue is 25.2 minutes. The average time that each car spends in the system and gets oil change is 29.4 minutes. 6

7 Display 5. Step Plot of number of customers in the M/G/1 system over time. Display 6. Histogram of number of customers in the M/G/1 system. Table 3. M/G/1 result with performance metrics. 7

8 FUTURE WORK This paper is a bit more challenging than I expected. Most of the simulation are involved in the DATA steps than anywhere. The average time each customer spends in the system and queue are challenging to get the precise and consistent number compare to the classic performance metric. I will update this paper in future conference proceedings and presentations. Particularly, I plan on adding the M/M/s system to the list of queuing processes. I also acknowledge that there are economics considerations that need to be added (e.g how many servers do we need?) in order for the models to near completeness. Because each queuing model is simple, it is also important to consider the many other variables that occur in real world business modeling. What is the probability that a customer arrives to the system decided not to join because of the lengthy queue? What is the probability that a customer leaves the queue? These metrics are known as balking and reneging, respectively, and require their own consideration in such a study. ACKNOWLEDGMENTS I would like to thank my industrial engineering professors, Dr. Kurt Colvin and Jill Speece, for introducing me to queuing theory. I would like to thank my statistics professor, Dr. Kevin Ross, for teaching stochastic processes at Cal Poly and diving deeper into the theory with mathematical models using continuous-time Markov chains. I would like to thank Deanna Schreiber-Gregory for providing me feedbacks on this paper. Lastly, I would like to thank WUSS and Statistics and Analytics committees for accepting my paper! CONTACT INFORMATION Your comments and questions are valued and encouraged. Contact the author at: Name: Danny Rithy rithy.danny@gmail.com Web: linkedin.com/in/drithy SAS and all other SAS Institute Inc. product or service names are registered trademarks or trademarks of SAS Institute Inc. in the USA and other countries. indicates USA registration. Other brand and product names are trademarks of their respective companies. 8

9 /* M/M/1 Queue */ data mm1; * Specify parameters; lambda = 10; * arrival rate ; mu = 20; * service rate ; Source Code * Specify # of jumps for simulation ; Njumps = 50; * Start simulation at time 0 ; Xt = 0; * number of customers in time t; cumsum_wn = 0; * cumsum_wn is the cumulative waiting time for job nth ; p = 0; * 1 if server is busy and 0 otherwise ; output; * Start simulation in a do-until loop until we reach the limit ; do n = 2 to Njumps; t_rexp = rand("exponential") * lambda; /* This if- statement is based on the transition probability matrix and we randomly sample either -1 or 1 */ if rand("uniform") <= mu / (lambda+mu) then event = -1; event = 1; /* If there is no customer in time t, then immediately move the process from 0 to 1 customer according to transition rate matrix */ do; Xt = Xt + 1; cumsum_wn = cumsum_wn + (t_rexp / lambda); p = 0; do; Xt = Xt + event; cumsum_wn = cumsum_wn + (t_rexp / (lambda + mu)); p = 1; output; drop lambda mu mins event hours; data mm1; set mm1; Wn = dif(cumsum_wn); * Take the difference between waiting time of the nth job and (n-1)th job ; * Create a variable called Lq where it measures # of customers waiting in the queue; Lq = 0; Lq = Xt - 1; data mm1; set mm1; 9

10 Wn_Lq = abs(dif(wn)); * Take the difference between waiting time of the nth job and (n-1)th job in the QUEUE; /* M/D/1 Queue */ data md1; * Specify parameters; D = 20; * Deterministic time ; lambda = 15; * arrival rate ; mu = D; * service rate ; * Specify time for simulation ; Njumps = 50; * Start simulation at time 0 ; Xt = 0; * number of customers in time t; cumsum_wn = 0; * cumsum_wn is the cumulative waiting time for job nth ; p = 0; output; do n = 2 to Njumps; t_rexp = rand("exponential") * lambda; /* This if- statement is based on the transition probability matrix and we randomly sample either -1 or 1 */ if rand("uniform") <= mu / (lambda + mu) then event = -1; event = 1; /* If there is no customer in time t, then immediately move the process from 0 to 1 customer according to transition rate matrix */ do; Xt = Xt + 1; event = 1; cumsum_wn = cumsum_wn + (t_rexp / lambda); do; Xt = Xt + event; if event = -1 then cumsum_wn = cumsum_wn + mu; cumsum_wn = cumsum_wn + (t_rexp / mu + lambda); output; p = 0; p = 1; drop lambda mu n D Njumps; data md1; set md1; Wn = dif(cumsum_wn); * Take the difference between waiting time of the nth job and (n-1)th job ; 10

11 * Create a variable called Lq where it measures # of customers waiting in the queue ; Lq = 0; Lq = Xt - 1; data md1; set md1; Wn_Lq = abs(dif(wn)); * Take the difference between waiting time of the nth job and (n-1)th job in the QUEUE; /* M/G/1 Queue */ data mg1; * Specify parameters; lambda = 4; * arrival rate ; mu = 15; * service rate ; sd = 2; * Specify time for simulation ; Njumps = 50; * Start simulation at time 0 ; Xt = 0; * number of customers in time t; cumsum_wn = 0; * cumsum_wn is the cumulative waiting time for job nth ; p = 0; output; do n = 2 to Njumps; t_rexp = rand("exponential") * lambda; service_time = rand("normal", mu, sd); /* This if- statement is based on the transition probability matrix and we randomly sample either -1 or 1 */ if rand("uniform") <= mu / (lambda + mu) then event = -1; event = 1; /* If there is no customer in time t, then immediately move the process from 0 to 1 customer according to transition rate matrix */ do; Xt = Xt + 1; event = 1; cumsum_wn = cumsum_wn + (t_rexp / lambda); do; Xt = Xt + event; if event = -1 then cumsum_wn = cumsum_wn + 1/service_time; cumsum_wn = cumsum_wn + (t_rexp / (lambda + mu)); 11

12 output; p = 0; p = 1; drop lambda mu n Njumps; data mg1; set mg1; Wn = dif(cumsum_wn); * Take the difference between waiting time of the nth job and (n-1)th job ; * Create a variable called Lq where it measures # of customers waiting in the queue ; Lq = 0; Lq = Xt - 1; data mg1; set mg1; Wn_Lq = abs(dif(wn)); * Take the difference between waiting time of the nth job and (n-1)th job in the QUEUE; * Use SAS Macros to generate results from multiple datasets ; %macro queuing_plot(system=); title "Step Plot of Number of Customers in the System Over Time"; proc sgplot data = &system; step x = cumsum_wn y = Xt; xaxis label = "Time (t)"; yaxis label = "X(t)"; title "Histogram of Number of Customers in the System"; proc sgplot data = &system; histogram Xt; xaxis label = "# of Customers"; title "Histogram of Waiting Time in the Queue"; proc sgplot data = &system; histogram Wn / nbins = 10; xaxis label = "Time"; title "Average Number of Customers in the System"; var Xt; ODS OUTPUT Means.Summary = L; 12

13 title "Average Number of Customers in the Queue"; var Lq; ODS OUTPUT Means.Summary = Lq; title "Average Time in the System"; var Wn; where event = -1 or Xt >= 1; ODS OUTPUT Means.Summary = W; title "Average Waiting Time in the Queue"; var Wn_Lq; where Lq >= 1 and event = 1; ODS OUTPUT Means.Summary = Wq; title "Average Server Utilization"; var p; ODS OUTPUT Means.Summary = rho; %m data op_characteristics; input OP $45.; datalines; Average Number of Customers in the Queue Average Number of Customers in the System Average Waiting Time in the Queue Average Time in the System Average Server Utilization %macro queuing_metrics(system=, title=); data mean; set Lq (rename = (Lq_Mean = Mean)) L (rename = (Xt_Mean = Mean)) Wq (rename = (Wn_Lq_Mean = Mean)) W (rename = (Wn_Mean = Mean)) rho (rename = (p_mean = Mean)); data &system._result; merge op_characteristics mean; ODS PDF FILE = "F:\F-\WUSS 2016\Queuing Theory\&system._result.pdf"; title " &title Result"; proc report data = &system._result nowd style(header) = [background = BIBG font_size = 1 font_weight = bold]; column OP mean; define OP / "Operating Characteristics"; define mean / "Mean" mean format = 5.2; 13

14 compute OP; if OP IN ("Average Number of Customers in the System", "Average Time in the System") then call define (_row_, 'STYLE','STYLE = [background = BIBG ]'); endcomp; ODS PDF CLOSE; %m 14

Chapter 13. Waiting Lines and Queuing Theory Models

Chapter 13. Waiting Lines and Queuing Theory Models Chapter 13 Waiting Lines and Queuing Theory Models To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian Peterson Learning

More information

Chapter 14. Waiting Lines and Queuing Theory Models

Chapter 14. Waiting Lines and Queuing Theory Models Chapter 4 Waiting Lines and Queuing Theory Models To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl 2008 Prentice-Hall,

More information

An-Najah National University Faculty of Engineering Industrial Engineering Department. System Dynamics. Instructor: Eng.

An-Najah National University Faculty of Engineering Industrial Engineering Department. System Dynamics. Instructor: Eng. An-Najah National University Faculty of Engineering Industrial Engineering Department System Dynamics Instructor: Eng. Tamer Haddad Introduction Knowing how the elements of a system interact & how overall

More information

OPERATING SYSTEMS. Systems and Models. CS 3502 Spring Chapter 03

OPERATING SYSTEMS. Systems and Models. CS 3502 Spring Chapter 03 OPERATING SYSTEMS CS 3502 Spring 2018 Systems and Models Chapter 03 Systems and Models A system is the part of the real world under study. It is composed of a set of entities interacting among themselves

More information

Hamdy A. Taha, OPERATIONS RESEARCH, AN INTRODUCTION, 5 th edition, Maxwell Macmillan International, 1992

Hamdy A. Taha, OPERATIONS RESEARCH, AN INTRODUCTION, 5 th edition, Maxwell Macmillan International, 1992 Reference books: Anderson, Sweeney, and Williams, AN INTRODUCTION TO MANAGEMENT SCIENCE, QUANTITATIVE APPROACHES TO DECISION MAKING, 7 th edition, West Publishing Company,1994 Hamdy A. Taha, OPERATIONS

More information

Use of Queuing Models in Health Care - PPT

Use of Queuing Models in Health Care - PPT University of Wisconsin-Madison From the SelectedWorks of Vikas Singh December, 2006 Use of Queuing Models in Health Care - PPT Vikas Singh, University of Arkansas for Medical Sciences Available at: https://works.bepress.com/vikas_singh/13/

More information

Chapter C Waiting Lines

Chapter C Waiting Lines Supplement C Waiting Lines Chapter C Waiting Lines TRUE/FALSE 1. Waiting lines cannot develop if the time to process a customer is constant. Answer: False Reference: Why Waiting Lines Form Keywords: waiting,

More information

Chapter III TRANSPORTATION SYSTEM. Tewodros N.

Chapter III TRANSPORTATION SYSTEM. Tewodros N. Chapter III TRANSPORTATION SYSTEM ANALYSIS www.tnigatu.wordpress.com tedynihe@gmail.com Lecture Overview Traffic engineering studies Spot speed studies Volume studies Travel time and delay studies Parking

More information

QUEUING THEORY 4.1 INTRODUCTION

QUEUING THEORY 4.1 INTRODUCTION C h a p t e r QUEUING THEORY 4.1 INTRODUCTION Queuing theory, which deals with the study of queues or waiting lines, is one of the most important areas of operation management. In organizations or in personal

More information

PERFORMANCE EVALUATION OF DEPENDENT TWO-STAGE SERVICES

PERFORMANCE EVALUATION OF DEPENDENT TWO-STAGE SERVICES PERFORMANCE EVALUATION OF DEPENDENT TWO-STAGE SERVICES Werner Sandmann Department of Information Systems and Applied Computer Science University of Bamberg Feldkirchenstr. 21 D-96045, Bamberg, Germany

More information

Reducing Customer Waiting Time with New Layout Design

Reducing Customer Waiting Time with New Layout Design Reducing Customer Waiting Time with New Layout Design 1 Vinod Bandu Burkul, 2 Joon-Yeoul Oh, 3 Larry Peel, 4 HeeJoong Yang 1 Texas A&M University-Kingsville, vinodreddy.velmula@gmail.com 2*Corresponding

More information

PERFORMANCE MODELING OF AUTOMATED MANUFACTURING SYSTEMS

PERFORMANCE MODELING OF AUTOMATED MANUFACTURING SYSTEMS PERFORMANCE MODELING OF AUTOMATED MANUFACTURING SYSTEMS N. VISWANADHAM Department of Computer Science and Automation Indian Institute of Science Y NARAHARI Department of Computer Science and Automation

More information

Banks, Carson, Nelson & Nicol

Banks, Carson, Nelson & Nicol Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose To present several examples of simulations that can be performed by devising a simulation table either manually or with a spreadsheet.

More information

Queuing Theory: A Case Study to Improve the Quality Services of a Restaurant

Queuing Theory: A Case Study to Improve the Quality Services of a Restaurant Queuing Theory: A Case Study to Improve the Quality Services of a Restaurant Lakhan Patidar 1*, Trilok Singh Bisoniya 2, Aditya Abhishek 3, Pulak Kamar Ray 4 Department of Mechanical Engineering, SIRT-E,

More information

Midterm for CpE/EE/PEP 345 Modeling and Simulation Stevens Institute of Technology Fall 2003

Midterm for CpE/EE/PEP 345 Modeling and Simulation Stevens Institute of Technology Fall 2003 Midterm for CpE/EE/PEP 345 Modeling and Simulation Stevens Institute of Technology Fall 003 The midterm is open book/open notes. Total value is 100 points (30% of course grade). All questions are equally

More information

Preface. Skill-based routing in multi-skill call centers

Preface. Skill-based routing in multi-skill call centers Nancy Marengo nmarengo@fewvunl BMI-paper Vrije Universiteit Faculty of Sciences Business Mathematics and Informatics 1081 HV Amsterdam The Netherlands November 2004 Supervisor: Sandjai Bhulai Sbhulai@fewvunl

More information

Chapter 2 Simulation Examples. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 2 Simulation Examples. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Chapter 2 Simulation Examples Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose To present several examples of simulations that can be performed by devising a simulation table either

More information

Motivating Examples of the Power of Analytical Modeling

Motivating Examples of the Power of Analytical Modeling Chapter 1 Motivating Examples of the Power of Analytical Modeling 1.1 What is Queueing Theory? Queueing theory is the theory behind what happens when you have lots of jobs, scarce resources, and subsequently

More information

Application of queuing theory in construction industry

Application of queuing theory in construction industry Application of queuing theory in construction industry Vjacheslav Usmanov 1 *, Čeněk Jarský 1 1 Department of Construction Technology, FCE, CTU Prague, Czech Republic * Corresponding author (usmanov@seznam.cz)

More information

THE APPLICATION OF QUEUEING MODEL/WAITING LINES IN IMPROVING SERVICE DELIVERING IN NIGERIA S HIGHER INSTITUTIONS

THE APPLICATION OF QUEUEING MODEL/WAITING LINES IN IMPROVING SERVICE DELIVERING IN NIGERIA S HIGHER INSTITUTIONS International Journal of Economics, Commerce and Management United Kingdom Vol. III, Issue 1, Jan 2015 http://ijecm.co.uk/ ISSN 2348 0386 THE APPLICATION OF QUEUEING MODEL/WAITING LINES IN IMPROVING SERVICE

More information

BERTHING PROBLEM OF SHIPS IN CHITTAGONG PORT AND PROPOSAL FOR ITS SOLUTION

BERTHING PROBLEM OF SHIPS IN CHITTAGONG PORT AND PROPOSAL FOR ITS SOLUTION 66 BERTHING PROBLEM OF SHIPS IN CHITTAGONG PORT AND PROPOSAL FOR ITS SOLUTION A. K. M. Solayman Hoque Additional Chief Engineer, Chittagong Dry Dock Limited, Patenga, Chittagong, Bnagladesh S. K. Biswas

More information

APPLICABILITY OF INFORMATION TECHNOLOGIES IN PARKING AREA CAPACITY OPTIMIZATION

APPLICABILITY OF INFORMATION TECHNOLOGIES IN PARKING AREA CAPACITY OPTIMIZATION APPLICABILITY OF INFORMATION TECHNOLOGIES IN PARKING AREA CAPACITY OPTIMIZATION 43 APPLICABILITY OF INFORMATION TECHNOLOGIES IN PARKING AREA CAPACITY OPTIMIZATION Maršanić Robert, Phd Rijeka Promet d.d.

More information

Application the Queuing Theory in the Warehouse Optimization Jaroslav Masek, Juraj Camaj, Eva Nedeliakova

Application the Queuing Theory in the Warehouse Optimization Jaroslav Masek, Juraj Camaj, Eva Nedeliakova Application the Queuing Theory in the Warehouse Optimization Jaroslav Masek, Juraj Camaj, Eva Nedeliakova Abstract The aim of optimization of store management is not only designing the situation of store

More information

STATISTICAL TECHNIQUES. Data Analysis and Modelling

STATISTICAL TECHNIQUES. Data Analysis and Modelling STATISTICAL TECHNIQUES Data Analysis and Modelling DATA ANALYSIS & MODELLING Data collection and presentation Many of us probably some of the methods involved in collecting raw data. Once the data has

More information

Chapter 1 INTRODUCTION TO SIMULATION

Chapter 1 INTRODUCTION TO SIMULATION Chapter 1 INTRODUCTION TO SIMULATION Many problems addressed by current analysts have such a broad scope or are so complicated that they resist a purely analytical model and solution. One technique for

More information

Techniques of Operations Research

Techniques of Operations Research Techniques of Operations Research C HAPTER 2 2.1 INTRODUCTION The term, Operations Research was first coined in 1940 by McClosky and Trefthen in a small town called Bowdsey of the United Kingdom. This

More information

Discrete Event Simulation: A comparative study using Empirical Modelling as a new approach.

Discrete Event Simulation: A comparative study using Empirical Modelling as a new approach. Discrete Event Simulation: A comparative study using Empirical Modelling as a new approach. 0301941 Abstract This study introduces Empirical Modelling as a new approach to create Discrete Event Simulations

More information

Abstract. Introduction

Abstract. Introduction Queuing Theory and the Taguchi Loss Function: The Cost of Customer Dissatisfaction in Waiting Lines Ross Fink and John Gillett Abstract As customer s wait longer in line they become more dissatisfied.

More information

4 BUILDING YOUR FIRST MODEL. L4.1 Building Your First Simulation Model. Knowing is not enough; we must apply. Willing is not enough; we must do.

4 BUILDING YOUR FIRST MODEL. L4.1 Building Your First Simulation Model. Knowing is not enough; we must apply. Willing is not enough; we must do. Pro, Second Edition L A B 4 BUILDING YOUR FIRST MODEL Knowing is not enough; we must apply. Willing is not enough; we must do. Johann von Goethe In this lab we build our first simulation model using Pro.

More information

G54SIM (Spring 2016)

G54SIM (Spring 2016) G54SIM (Spring 2016) Lecture 03 Introduction to Conceptual Modelling Peer-Olaf Siebers pos@cs.nott.ac.uk Motivation Define what a conceptual model is and how to communicate such a model Demonstrate how

More information

Mathematical Modeling and Analysis of Finite Queueing System with Unreliable Single Server

Mathematical Modeling and Analysis of Finite Queueing System with Unreliable Single Server IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 3 Ver. VII (May. - Jun. 2016), PP 08-14 www.iosrjournals.org Mathematical Modeling and Analysis of Finite Queueing

More information

CONTENTS CHAPTER TOPIC PAGE NUMBER

CONTENTS CHAPTER TOPIC PAGE NUMBER CONTENTS CHAPTER TOPIC PAGE NUMBER 1 Introduction to Simulation 1 1.1 Introduction 1 1.1.1 What is Simulation? 2 1.2 Decision and Decision Models 2 1.3 Definition of Simulation 7 1.4 Applications of Simulation

More information

PRACTICE PROBLEM SET Topic 1: Basic Process Analysis

PRACTICE PROBLEM SET Topic 1: Basic Process Analysis The Wharton School Quarter II The University of Pennsylvania Fall 1999 PRACTICE PROBLEM SET Topic 1: Basic Process Analysis Problem 1: Consider the following three-step production process: Raw Material

More information

Recent Developments in Vacation Queueing Models : A Short Survey

Recent Developments in Vacation Queueing Models : A Short Survey International Journal of Operations Research International Journal of Operations Research Vol. 7, No. 4, 3 8 (2010) Recent Developments in Vacation Queueing Models : A Short Survey Jau-Chuan Ke 1,, Chia-Huang

More information

Numerical investigation of tradeoffs in production-inventory control policies with advance demand information

Numerical investigation of tradeoffs in production-inventory control policies with advance demand information Numerical investigation of tradeoffs in production-inventory control policies with advance demand information George Liberopoulos and telios oukoumialos University of Thessaly, Department of Mechanical

More information

Asymptotic Analysis of Real-Time Queues

Asymptotic Analysis of Real-Time Queues Asymptotic Analysis of John Lehoczky Department of Statistics Carnegie Mellon University Pittsburgh, PA 15213 Co-authors: Steve Shreve, Kavita Ramanan, Lukasz Kruk, Bogdan Doytchinov, Calvin Yeung, and

More information

Optimizing Capacity Utilization in Queuing Systems: Parallels with the EOQ Model

Optimizing Capacity Utilization in Queuing Systems: Parallels with the EOQ Model Optimizing Capacity Utilization in Queuing Systems: Parallels with the EOQ Model V. Udayabhanu San Francisco State University, San Francisco, CA Sunder Kekre Kannan Srinivasan Carnegie-Mellon University,

More information

Harold s Hot Dog Stand Part I: Deterministic Process Flows

Harold s Hot Dog Stand Part I: Deterministic Process Flows The University of Chicago Booth School of Business Harold s Hot Dog Stand Part I: Deterministic Process Flows December 28, 2011 Harold runs a hot dog stand in downtown Chicago. After years of consulting

More information

Modeling And Optimization Of Non-Profit Hospital Call Centers With Service Blending

Modeling And Optimization Of Non-Profit Hospital Call Centers With Service Blending Wayne State University Wayne State University Dissertations 1-1-2015 Modeling And Optimization Of Non-Profit Hospital Call Centers With Service Blending Yanli Zhao Wayne State University, Follow this and

More information

1. For s, a, initialize Q ( s,

1. For s, a, initialize Q ( s, Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS

More information

Math 29 Probability Final Exam. Saturday December 18, 2-5 pm in Merrill 03

Math 29 Probability Final Exam. Saturday December 18, 2-5 pm in Merrill 03 Name: Math 29 Probability Final Exam Saturday December 18, 2-5 pm in Merrill 03 Instructions: 1. Show all work. You may receive partial credit for partially completed problems. 2. You may use calculators

More information

WAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering May, 2010

WAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering May, 2010 WAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering May, 2010 PhD Preliminary Examination Candidate Name: 1- Sensitivity Analysis (20 points) Answer ALL Questions Question 1-20

More information

A BUSINESS COURSE IN SIMULATION MODELING

A BUSINESS COURSE IN SIMULATION MODELING A BUSINESS COURSE IN SIMULATION MODELING Richard G. Born, Northern Illinois University, rborn@niu.edu Ingolf Ståhl, Stockholm School of Economics, ingolf.stahl@hhs.se ABSTRACT The economic and improved

More information

SAS Enterprise Guide: Point, Click and Run is all that takes

SAS Enterprise Guide: Point, Click and Run is all that takes ABSTRACT SAS Enterprise Guide: Point, Click and Run is all that takes Aruna Buddana, TiVo Inc, Alviso, CA The Audience Research and Measurement team at TiVo constantly collects and processes anonymous

More information

Justifying Simulation. Why use simulation? Accurate Depiction of Reality. Insightful system evaluations

Justifying Simulation. Why use simulation? Accurate Depiction of Reality. Insightful system evaluations Why use simulation? Accurate Depiction of Reality Anyone can perform a simple analysis manually. However, as the complexity of the analysis increases, so does the need to employ computer-based tools. While

More information

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling

Scheduling 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 information

MATH 2070 Mixed Practice Sections

MATH 2070 Mixed Practice Sections Name: Directions: For each question, show the specific mathematical notation that leads to your answer. Round final answers to three decimals unless the context dictates otherwise. 1. The demand for board

More information

Mean and Individual Subject Graphs of Concentration vs. Time Data Using PROC SGPLOT

Mean and Individual Subject Graphs of Concentration vs. Time Data Using PROC SGPLOT PharmaSUG 2017 - Paper DV04 Mean and Individual Subject Graphs of Concentration vs. Time Data Using PROC SGPLOT ABSTRACT Pooja Trivedi, Cadila Healthcare Limited, Ahmedabad, India In clinical research

More information

Explain the needs, goals, and pain points addressed. [The Customer] About. Main Goals. Pain Points

Explain the needs, goals, and pain points addressed. [The Customer] About. Main Goals. Pain Points Story A big multi-brand hypermarket is interested in providing smart shopping experience to the customers. Currently, the customers are not delighted about the shopping experience and sometime have trouble

More information

C programming on Waiting Line Systems

C programming on Waiting Line Systems OPTICAL COMMUNICATIONS (ELECTROSCIENCE '08), Trondheim, Norway, July -4, 008 C programming on Waiting Line Systems OZER OZDEMIR Department of Statistics Faculty of Science Anadolu University Eskisehir,

More information

Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds

Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds Proceedings of the 0 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds OPTIMAL BATCH PROCESS ADMISSION CONTROL IN TANDEM QUEUEING SYSTEMS WITH QUEUE

More information

If you want to flag a question for later review, select the "Mark for review" button.

If you want to flag a question for later review, select the Mark for review button. Exam Number: 584002RR Lesson Name: Microsoft Excel 2016 Exam Guidelines: This exam is now available only in the online assessment system. If your study guide still contains an exam, that exam is no longer

More information

UNIT - 1 INTRODUCTION:

UNIT - 1 INTRODUCTION: 1 SYSTEM MODELING AND SIMULATION UNIT-1 VIK UNIT - 1 INTRODUCTION: When simulation is the appropriate tool and when it is not appropriate; Advantages and disadvantages of Simulation; Areas of application;

More information

Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations

Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 54006 Thessaloniki, Greece karatza@csd.auth.gr Abstract

More information

TimeNet - Examples of Extended Deterministic and Stochastic Petri Nets

TimeNet - Examples of Extended Deterministic and Stochastic Petri Nets TimeNet - Examples of Extended Deterministic and Stochastic Petri Nets Christoph Hellfritsch February 2, 2009 Abstract TimeNet is a toolkit for the performability evaluation of Petri nets. Performability

More information

Intro to O/S Scheduling. Intro to O/S Scheduling (continued)

Intro to O/S Scheduling. Intro to O/S Scheduling (continued) Intro to O/S Scheduling 1. Intro to O/S Scheduling 2. What is Scheduling? 3. Computer Systems Scheduling 4. O/S Scheduling Categories 5. O/S Scheduling and Process State 6. O/S Scheduling Layers 7. Scheduling

More information

Ferry Rusgiyarto S3-Student at Civil Engineering Post Graduate Department, ITB, Bandung 40132, Indonesia

Ferry Rusgiyarto S3-Student at Civil Engineering Post Graduate Department, ITB, Bandung 40132, Indonesia International Journal of Civil Engineering and Technology (IJCIET) Volume 8, Issue 10, October 2017, pp. 1085 1095, Article ID: IJCIET_08_10_112 Available online at http://http://www.iaeme.com/ijciet/issues.asp?jtype=ijciet&vtype=8&itype=10

More information

OPTIMIZATION AND OPERATIONS RESEARCH Vol. IV - Inventory Models - Waldmann K.-H

OPTIMIZATION AND OPERATIONS RESEARCH Vol. IV - Inventory Models - Waldmann K.-H INVENTORY MODELS Waldmann K.-H. Universität Karlsruhe, Germany Keywords: inventory control, periodic review, continuous review, economic order quantity, (s, S) policy, multi-level inventory systems, Markov

More information

Università degli Studi di Roma Tre Dipartimento di Informatica e Automazione. Via della Vasca Navale, Roma, Italy

Università degli Studi di Roma Tre Dipartimento di Informatica e Automazione. Via della Vasca Navale, Roma, Italy R O M A TRE DIA Università degli Studi di Roma Tre Dipartimento di Informatica e Automazione Via della Vasca Navale, 79 00146 Roma, Italy Performance assessment for single echelon airport spare part management

More information

General Terms Measurement, Performance, Design, Theory. Keywords Dynamic load balancing, Load sharing, Pareto distribution, 1.

General Terms Measurement, Performance, Design, Theory. Keywords Dynamic load balancing, Load sharing, Pareto distribution, 1. A Dynamic Load Distribution Strategy for Systems Under High Tas Variation and Heavy Traffic Bin Fu Zahir Tari School of Computer Science and Information and Technology Melbourne, Australia {b fu,zahirt}@cs.rmit.edu.au

More information

Automated Energy Distribution In Smart Grids

Automated Energy Distribution In Smart Grids Automated Energy Distribution In Smart Grids John Yu Stanford University Michael Chun Stanford University Abstract We design and implement a software controller that can distribute energy in a power grid.

More information

Performance evaluation of centralized maintenance workshop by using Queuing Networks

Performance evaluation of centralized maintenance workshop by using Queuing Networks Performance evaluation of centralized maintenance workshop by using Queuing Networks Zineb Simeu-Abazi, Maria Di Mascolo, Eric Gascard To cite this version: Zineb Simeu-Abazi, Maria Di Mascolo, Eric Gascard.

More information

Sven Axsäter. Inventory Control. Third Edition. Springer

Sven Axsäter. Inventory Control. Third Edition. Springer Sven Axsäter Inventory Control Third Edition Springer Contents 1 Introduction 1 1.1 Importance and Objectives of Inventory Control 1 1.2 Overview and Purpose of the Book 2 1.3 Framework 4 2 Forecasting

More information

Pilot prototype of autonomous pallets and employing Little s law for routing

Pilot prototype of autonomous pallets and employing Little s law for routing Pilot prototype of autonomous pallets and employing Little s law for routing Afshin Mehrsai 1, Hamid-Reza Karimi 2, Klaus-Dieter Thoben 1 and Bernd Scholz-Reiter 1 1 Department of Planning and Control

More information

Lecture 11: CPU Scheduling

Lecture 11: CPU Scheduling CS 422/522 Design & Implementation of Operating Systems Lecture 11: CPU Scheduling Zhong Shao Dept. of Computer Science Yale University Acknowledgement: some slides are taken from previous versions of

More information

CHAPTER 5: DISCRETE PROBABILITY DISTRIBUTIONS

CHAPTER 5: DISCRETE PROBABILITY DISTRIBUTIONS Discrete Probability Distributions 5-1 CHAPTER 5: DISCRETE PROBABILITY DISTRIBUTIONS 1. Thirty-six of the staff of 80 teachers at a local intermediate school are certified in Cardio- Pulmonary Resuscitation

More information

Determining the Maximum Allowable Headway

Determining the Maximum Allowable Headway 36 Determining the Maximum Allowable Headway The purpose of this activity is to give you the opportunity to determine the maximum allowable headway (MAH) for your intersection. Select an MAH VISSIM input

More information

Resource Allocation Strategies in a 2-level Hierarchical Grid System

Resource Allocation Strategies in a 2-level Hierarchical Grid System st Annual Simulation Symposium Resource Allocation Strategies in a -level Hierarchical Grid System Stylianos Zikos and Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 5

More information

Simulation of an Order Picking System in a Pharmaceutical Warehouse

Simulation of an Order Picking System in a Pharmaceutical Warehouse Simulation of an Order Picking System in a Pharmaceutical Warehouse João Pedro Jorge 1,5, Zafeiris Kokkinogenis 2,4,5, Rosaldo J. F. Rossetti 2,3,5, Manuel A. P. Marques 1,5 1 Department of Industrial

More information

An Adaptive Kanban and Production Capacity Control Mechanism

An Adaptive Kanban and Production Capacity Control Mechanism An Adaptive Kanban and Production Capacity Control Mechanism Léo Le Pallec Marand, Yo Sakata, Daisuke Hirotani, Katsumi Morikawa and Katsuhiko Takahashi * Department of System Cybernetics, Graduate School

More information

A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types

A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple Job Types University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 8-2013 A Simple, Practical Prioritization Scheme for a Job Shop Processing Multiple

More information

Use the following headings

Use the following headings Q 1 Furgon Van Hire rents out trucks and vans. One service they offer is a sameday rental deal under which account customers can call in the morning to hire a van for the day. Five vehicles are available

More information

Example1: Courseware System Description

Example1: Courseware System Description Use Case Examples Example1: Courseware System Description The organization offers courses. Each course is made up of a set of topics. Tutors in the organization are assigned courses to teach according

More information

Control Charts for Customer Satisfaction Surveys

Control Charts for Customer Satisfaction Surveys Control Charts for Customer Satisfaction Surveys Robert Kushler Department of Mathematics and Statistics, Oakland University Gary Radka RDA Group ABSTRACT Periodic customer satisfaction surveys are used

More information

Story - Shop MyWy self-serve Checkout solution

Story - Shop MyWy self-serve Checkout solution Story - Shop MyWy self-serve Checkout solution Summary: A large supermarket chain needs new and improved self-service check out facilities in order to positively transform buyer s journey throughout their

More information

Cost Optimization for Cloud-Based Engineering Simulation Using ANSYS Enterprise Cloud

Cost Optimization for Cloud-Based Engineering Simulation Using ANSYS Enterprise Cloud Application Brief Cost Optimization for Cloud-Based Engineering Simulation Using ANSYS Enterprise Cloud Most users of engineering simulation are constrained by computing resources to some degree. They

More information

Business Process Management - Quantitative

Business Process Management - Quantitative Business Process Management - Quantitative November 2013 Alberto Abelló & Oscar Romero 1 Knowledge objectives 1. Recognize the importance of measuring processes 2. Enumerate the four performance measures

More information

Passenger Batch Arrivals at Elevator Lobbies

Passenger Batch Arrivals at Elevator Lobbies Passenger Batch Arrivals at Elevator Lobbies Janne Sorsa, Juha-Matti Kuusinen and Marja-Liisa Siikonen KONE Corporation, Finland Key Words: Passenger arrivals, traffic analysis, simulation ABSTRACT A typical

More information

PLANNING AND CONTROL FOR A WARRANTY SERVICE FACILITY

PLANNING AND CONTROL FOR A WARRANTY SERVICE FACILITY Proceedings of the 2 Winter Simulation Conference M. E. Kuhl, N. M. Steiger, F. B. Armstrong, and J. A. Joines, eds. PLANNING AND CONTROL FOR A WARRANTY SERVICE FACILITY Amir Messih Eaton Corporation Power

More information

SIMULATION ON DEMAND: Using SIMPROCESS in an SOA Environment

SIMULATION ON DEMAND: Using SIMPROCESS in an SOA Environment SIMULATION ON DEMAND: Using SIMPROCESS in an SOA Environment Joseph M DeFee Senior Vice President Advanced Systems Division CACI Services-Oriented Architecture The one constant in business is change. New

More information

Global position system technology to monitoring auto transport in Latvia

Global position system technology to monitoring auto transport in Latvia Peer-reviewed & Open access journal www.academicpublishingplatforms.com The primary version of the journal is the on-line version ATI - Applied Technologies & Innovations Volume 8 Issue 3 November 2012

More information

PharmaSUG 2016 Paper 36

PharmaSUG 2016 Paper 36 PharmaSUG 2016 Paper 36 What's the Case? Applying Different Methods of Conducting Retrospective Case/Control Experiments in Pharmacy Analytics Aran Canes, Cigna, Bloomfield, CT ABSTRACT Retrospective Case/Control

More information

PreMBA Analytical Primer

PreMBA Analytical Primer PreMBA Analytical Primer PreMBA Analytical Primer Essential Quantitative Concepts for Business Math Regina Treviño PREMBA ANALYTICAL PRIMER Copyright Regina Treviño, 2008. Softcover reprint of the hardcover

More information

Chapter 7 Entity Transfer and Steady-State Statistical Analysis

Chapter 7 Entity Transfer and Steady-State Statistical Analysis Chapter 7 Entity Transfer and Steady-State Statistical Analysis What We ll Do... Types of Entity Transfers Resource-Constrained Transfers Transporters (Model 7.1) Conveyors Non-accumulating (Model 7.2)

More information

Project: Simulation of parking lot in Saint-Petersburg Airport

Project: Simulation of parking lot in Saint-Petersburg Airport Project: Simulation of parking lot in Saint-Petersburg Airport worked by: Khabirova Maja Course: 4IT496 SImulation of Systems VŠE, FIS-KI 2012 1. Problem definition 1.1 Introduction Anyone who has ever

More information

INTRODUCTION TO HOM. The current version of HOM addresses five key competitive advantage drivers

INTRODUCTION TO HOM. The current version of HOM addresses five key competitive advantage drivers 1 INTRODUCTION TO HOM 1. OVERVIEW HOM is a software system designed to help mid level managers and owners of small businesses gain competitive advantage from operations. It is also useful for business

More information

as the algorithm that will be implemented in Asynchronous Transfer Mode ( ATM ) networks.

as the algorithm that will be implemented in Asynchronous Transfer Mode ( ATM ) networks. ON SIMPLIFIED MODELLING OF THE LEAKY BUCKET M Jennings, R J McEliece, J Murphy andzyu Abstract The Generic Cell Rate Algorithm, or more commonly the leaky bucket, has been standardised as the algorithm

More information

An EOQ Model For Multi-Item Inventory With Stochastic Demand

An EOQ Model For Multi-Item Inventory With Stochastic Demand An EOQ Model For Multi-Item Inventory With Stochastic Demand Kizito Paul Mubiru Makerere University Abstract Traditional approaches towards determining the economic order quantity (EOQ) in inventory management

More information

IE221: Operations Research Probabilistic Methods

IE221: Operations Research Probabilistic Methods IE221: Operations Research Probabilistic Methods Fall 2001 Lehigh University IMSE Department Tue, 28 Aug 2001 IE221: Lecture 1 1 History of OR Britain, WWII (1938). Multi-disciplinary team of scientists

More information

TEACHER NOTES MATH NSPIRED

TEACHER NOTES MATH NSPIRED Math Objectives Students will recognize that the mean of all the sample variances for samples of a given size drawn with replacement calculated using n-1 as a divisor will give the population variance

More information

CELLULAR BASED DISPATCH POLICIES FOR REAL-TIME VEHICLE ROUTING. February 22, Randolph Hall Boontariga Kaseemson

CELLULAR BASED DISPATCH POLICIES FOR REAL-TIME VEHICLE ROUTING. February 22, Randolph Hall Boontariga Kaseemson CELLULAR BASED DISPATCH POLICIES FOR REAL-TIME VEHICLE ROUTING February 22, 2005 Randolph Hall Boontariga Kaseemson Department of Industrial and Systems Engineering University of Southern California Los

More information

Markov and Non-Markov Models for Brand Switching and Market Share Forecasting

Markov and Non-Markov Models for Brand Switching and Market Share Forecasting Markov and Non-Markov s for Brand Switching and Market Share Forecasting Ka Ching Chan Member IEEE Abstract Markov chain has been a popular approach for the brand switching problem and market share forecasting

More information

COMPARISON OF BOTTLENECK DETECTION METHODS FOR AGV SYSTEMS. Christoph Roser Masaru Nakano Minoru Tanaka

COMPARISON OF BOTTLENECK DETECTION METHODS FOR AGV SYSTEMS. Christoph Roser Masaru Nakano Minoru Tanaka Roser, Christoph, Masaru Nakano, and Minoru Tanaka. Comparison of Bottleneck Detection Methods for AGV Systems. In Winter Simulation Conference, edited by S. Chick, Paul J Sanchez, David Ferrin, and Douglas

More information

Principles of Operating Systems

Principles of Operating Systems Principles of Operating Systems Lecture 9-10 - CPU Scheduling Ardalan Amiri Sani (ardalan@uci.edu) [lecture slides contains some content adapted from previous slides by Prof. Nalini Venkatasubramanian,

More information

PharmaSUG 2017 Paper 47

PharmaSUG 2017 Paper 47 PharmaSUG 2017 Paper 47 Visualization & interactive application in design and analysis by using R Shiny Baoyue LI, Eli Lilly & Company, Shanghai, China Boyao SHAN, Eli Lilly & Company, Shanghai, China

More information

KWAME NKRUMAH UNIVERSITY OF SCIENCE AND TECHNOLOGY. Modelling Queuing system in Healthcare centres. A case study of the

KWAME NKRUMAH UNIVERSITY OF SCIENCE AND TECHNOLOGY. Modelling Queuing system in Healthcare centres. A case study of the KWAME NKRUMAH UNIVERSITY OF SCIENCE AND TECHNOLOGY Modelling Queuing system in Healthcare centres. A case study of the dental department of the Essikado Hospital, Sekondi By Rebecca Nduba Quarm A THESIS

More information

All Possible Mixed Model Selection - A User-friendly SAS Macro Application

All Possible Mixed Model Selection - A User-friendly SAS Macro Application All Possible Mixed Model Selection - A User-friendly SAS Macro Application George C J Fernandez, University of Nevada - Reno, Reno NV 89557 ABSTRACT A user-friendly SAS macro application to perform all

More information

The Logic of Flow: Some Indispensable Concepts

The Logic of Flow: Some Indispensable Concepts The Logic of Flow: Some Indispensable Concepts FLOWCON 014 San Francisco, CA September 3, 014 No part of this presentation may be reproduced without the written permission of the author. Donald G. Reinertsen

More information

On Shortcomings of the ns-2 Random Number Generator

On Shortcomings of the ns-2 Random Number Generator On Shortcomings of the ns-2 Random Number Generator Univ.-Doz. Dr. Karl Entacher and Dipl.-Ing.(FH) Bernhard Hechenleitner University of Applied Sciences and Technologies, 5020 Salzburg, Austria Salzburg

More information

Using Excel s Analysis ToolPak Add In

Using Excel s Analysis ToolPak Add In Using Excel s Analysis ToolPak Add In Introduction This document illustrates the use of Excel s Analysis ToolPak add in for data analysis. The document is aimed at users who don t believe that Excel s

More information