Capacity analysis of complex materials handling systems.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Group 1 Ray Quintero, Lei Tian, Jiayin Liu, Morvarid Amirfathi, Rabeeh Sahranavard, Max Tubbs Production Control & Queuing.
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
Machines and Devices of Logistics - Thematics
Module C8 Queuing Economic/Cost Models. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some.
Case Study 6: Concentrate Line at Florida Citrus Company
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 13 MATERIAL HANDLING SYSTEMS E. Gutierrez-Miravete Spring 2001.
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Final Exam Tuesday, December 9 2:30 – 4:20 pm 121 Raitt Hall Open book
Chap. 20, page 1051 Queuing Theory Arrival process Service process Queue Discipline Method to join queue IE 417, Chap 20, Jan 99.
Queuing Models Economic Analyses. ECONOMIC ANALYSES Each problem is different Examples –To determine the minimum number of servers to meet some service.
Material Handling Conventional. Operations Process (Flow) Chart Flow diagram is a plan of work area, indicating the position of machines, flow of materials.
MODELING AND ANALYSIS OF AN AUCTION- BASED LOGISTICS MARKET Barış Tan Semra Ağralı and Fikri Karaesmen Department of Industrial Engineering Koç University,
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
Lecture 14 – Queuing Systems
Material Transport Systems
Queuing Networks. Input source Queue Service mechanism arriving customers exiting customers Structure of Single Queuing Systems Note: 1.Customers need.
Introduction to Management Science
MBA 8452 Systems and Operations Management MBA 8452 Systems and Operations Management Product Design & Process Selection —Service.
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
The Simulation Project. Simulation Project Steps a.- Problem Definition b.- Statement of Objectives c.- Model Formulation and Planning d.- Model Development.
Simulation Examples ~ By Hand ~ Using Excel
Capacity analysis of complex materials handling systems.
PowerPoint Presentation by Charlie Cook The University of West Alabama Copyright © 2005 Prentice Hall, Inc. All rights reserved. Operations Management.
Asst. Prof. Dr. Mongkut Piantanakulchai
Stochastic Processes A stochastic process is a model that evolves in time or space subject to probabilistic laws. The simplest example is the one-dimensional.
Lecture 14 – Queuing Networks Topics Description of Jackson networks Equations for computing internal arrival rates Examples: computation center, job shop.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Velocity And Acceleration Velocity: Velocity: Both speed and direction of an object V=d/t. Acceleration: Acceleration: The rate at which velocity changes.
Entities and Objects The major components in a model are entities, entity types are implemented as Java classes The active entities have a life of their.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
The Network Layer.
Traffic Flow Fundamentals
1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.
Quantitative Techniques Deepthy Sai Manikandan. Topics: Linear Programming Linear Programming Transportation Problem Transportation Problem Assignment.
Modeling and Simulation Queuing theory
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
1 Chapter 4 Fundamental Queueing System. 2 3 Ref: Mischa Schwartz “Telecommunication Networks” Addison-Wesley publishing company 1988.
Internet Applications: Performance Metrics and performance-related concepts E0397 – Lecture 2 10/8/2010.
Berlin, December 11 th 2012 Faculty of Mechanical Engineering · Chair of Logistics Engineering Network Optimization prior to Dynamic Simulation of AMHS.
(C) J. M. Garrido1 Objects in a Simulation Model There are several objects in a simulation model The activate objects are instances of the classes that.
Introduction Definition M/M queues M/M/1 M/M/S M/M/infinity M/M/S/K.
SIMULATION EXAMPLES. Monte-Carlo (Static) Simulation Estimating profit on a sale promotion Estimating profit on a sale promotion Estimating profit on.
EVOLUTION OF INDUSTRIAL ENGINEERING Prof. Dr. Orhan TORKUL Res. Asst. M. Raşit CESUR Res. Asst. Furkan YENER.
William Stallings Data and Computer Communications
Modeling and Evaluation of Fibre Channel Storage Area Networks
Supply Chain Management
OPERATING SYSTEMS CS 3502 Fall 2017
WAITING LINES AND SIMULATION
Lecture 14 – Queuing Networks
Topics discussed in this section:
Prepared by Lloyd R. Jaisingh
Dynamic Graph Partitioning Algorithm
Queuing Theory Non-Markov Systems
B.Ramamurthy Appendix A
Introduction Traffic flow characteristics
CSCI1600: Embedded and Real Time Software
Queuing Systems Don Sutton.
IE 469 Manufacturing Systems
Variability 8/24/04 Paul A. Jensen
مهندسی مجدد فرآیندهای تجاری
Introduction to Queueing Theory
Lecture 13 – Queuing Systems
Lecture 14 – Queuing Networks
CSE 550 Computer Network Design
Chapter-5 Traffic Engineering.
Motion Section 3 Acceleration
Stochastic Processes A stochastic process is a model that evolves in time or space subject to probabilistic laws. The simplest example is the one-dimensional.
Presentation transcript:

Capacity analysis of complex materials handling systems

Capacity calculation of a single conveyor section Capacity The capacity of a material handling machine can be calculated from the follow distance of two incoming unit loads (L) and the speed of the moving unit load (v). v L Q = v / L [piece/sec]

Relevant features Reducing effect by mechanical interlocking Turntable A Driven roller conveyors v unit load time ω turntable time A B C B C t cycle t cycle = t moving in + t turning right +t moving out + t turning left Capacity = 3600/t cycle [piece/hour]

Relevant features Reducing effect by presence of multiple unit loads Empty roller conveyor sections due to traffic control v i+2 th unit load i+1 th unit load i th unit load S follow Capacity = 3600*v/S follow [piece/hour] Traffic control’s principle: If the unit load reaches end of the i th section, close down the i-1 th section and free the i-2 th section

Relevant features Reducing effect by presence of branches A B1 Definition: Partial capacity limits for different relations: μ AB1 = 3600 / t AB1 μ AB2 = 3600 / t AB2 B2 If the actual material flows for different relations are: AB1 and AB2 then the following equation is valid: AB1 / μ AB1 + AB2 / μ AB2  1 AB1, μ AB1 AB2, μ AB2 μ AB1 μ AB2

Relevant features Partial capacity limit example – opening branch A B1 Transfer table for roller conveyor μ AB2 = 3600 / t AB2 B2 3 m2 m3 m 2,5 m v unit load time v transfer table time A t cycle t cycle = t moving in + t transfer t. down +t moving out + t transfer t. up Speed and acceleration data: v unit load : 0,3 m/s a unit load : 0,2 m/s 2 v transfer t. : 0,2 m/s a transfer t. : 0,1 m/s 2 4,6/0,3+0,3/0,2 2,5/0,2+0,2/0,1 3,4/0,3+0,3/(2*0,2) 2,5/0,2+0,2/0,1

Fundamentals of Production Logistic systems

Relation of materials handling and production logistics Materials handling Provision of materials’ transport services Production logistic Requirements on timing and relations Operational characteristics of a production company Operation in increasing market competition Decreasing product life cycles Continuous adaptive behavior required Increasing product diversity Flexible manufacturing systems Necessity of continuously improving products and services Requirements on price delivery time and reliability Flexible materials handling and logistic services Low stock amount and WIP rates Economical operation required

Objectives of production logistic

Throughput time’s effect on the final value of a product Production costs total raw material workforce amortization techn. time throughput time wait time value production cost logistic cost profit value function production cost function modified throughput time loss value total production cost

Effect of stock amount on the production costs Delivery costStorage cost Total cost Optimal delivered amount:

Representation of logistic objectives in throughput diagrams

Modelling possibilities of complex materials handling systems

Model types 1. Logistic operation function models 2. Queuing models 3. Graph models 4. Petri net models 5. Simulation models Characteristics: examination of production related logistic features such as WIP, throughput time, using throughput diagrams Characteristics: examination of equipment related features such as length of the waiting queue, average waiting time, statistical distribution of the incoming arrivals, necessary number of servers. Characteristics: modeling of static topology and examination of material flow related parameters. Characteristics: modeling and visualizing of actual states and state changes Characteristics: modeling of static topology, state changes. Widespread visual, analytic and optimization features.

Logistic operation function models Characteristics: examination of production related logistic features such as WIP, throughput time, using throughput diagrams

Queuing models Construction of queuing models: Characteristics: examination of equipment related features such as length of the waiting queue, average waiting time, statistical distribution of the incoming arrivals, necessary number of servers. arrivals (unlimited or limited length) Server 1 Server N.:.: Model types: 1. Queuing model with unlimited arrivals and a single server 2. Queuing model with limited arrivals and a single server 3. Queuing model with unlimited arrivals and multiple servers 4. Queuing model with limited arrivals and multiple servers Applicability of explicite equations: Arrival rate – Poisson distribution Service time – Exponential distribution (Markov model)

Queuing models M/M/1 queuing model: arrivals (unlimited length) Server Calculation of optimal service rate: Cost components

Queuing models M/M/S queuing model: arrivals (unlimited length) Calculation of the number of optimal servers: Server 1 Server N.:.:

Graph models Directed graphs – for modelling continuously operating materials handling machines Undirected graphs – for modelling non-continuously operating materials handling machines Graphs: set of objects, where some pairs are connected by links. Characteristics: modeling of static topology and examination of material flow related parameters.

Graph models Mathematical representation of graphs using adjacency matrix A = Material flow related parameters: Material flow intensity vector: µ [piece/time unit] Nodal material flow intensity vector: µ n [piece/time unit] Relationship between µ and µ n : µ n = A µ Example: roller conveyor system for unit loads having different traveling order.