DCT Analysis. Concepts: UML-like class model of essential classes and actions.

Slides:

Advertisements

Similar presentations

Operations Management

Advertisements

Chapter 6 Queues and Deques.

3. 7 MBPF. Orange Juice Inc. produces and markets fruit juice

1 Chapter 8 Queueing models. 2 Delay and Queueing Main source of delay Transmission (e.g., n/R) Propagation (e.g., d/c) Retransmission (e.g., in ARQ)

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

Business Process Simulation Marc Voorhoeve HG 7.86(247)2420.

Event-drive SimulationCS-2303, C-Term Project #3 – Event-driven Simulation CS-2303 System Programming Concepts (Slides include materials from The.

Problems with parameterization (example:keeper usage): average duration: 1.27, min: 0.106, max: 6.46 possible outcome for keeper and crane queues? Assignment.

Queuing Models Basic Concepts

1 Queues Queue Concept Queue Design Considerations Queues in Java Collections APIs Queue Applications Reading L&C , 9.3.

Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.

Waiting Line Management

Occupation / queue size D/D/1: Constant arrivals, constant duration. M/D/1: Exponential arrivals, constant duration occupation rate queue size.

Low Coupling High Cohesion

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

Queueing Theory Professor Stephen Lawrence Leeds School of Business University of Colorado Boulder, CO

Given Connections Solution

Simulation Waiting Line. 2 Introduction Definition (informal) A model is a simplified description of an entity (an object, a system of objects) such that.

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

On G-network and resource allocation in multimedia systems 報告者 : 王敬育.

Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Rigorous fair Queueing requires per flow state: too costly in high speed core routers.

Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Fair Queueing requires per flow state: too costly in high speed core routers Yet, some.

1 Real-Time Queueing Network Theory Presented by Akramul Azim Department of Electrical and Computer Engineering University of Waterloo, Canada John P.

GRAPHING CALCULATORS AND STUDENTS’ ACHIEVEMENT BY RAED DANDAN.

Copyright warning. COMP5348 Lecture 6: Predicting Performance Adapted with permission from presentations by Alan Fekete.

Informational Interview of an Emergency Physician Anna December 23, 2008.

Network Analysis A brief introduction on queues, delays, and tokens Lin Gu, Computer Networking: A Top Down Approach 6 th edition. Jim Kurose.

1 Chapter 16 Applications of Queuing Theory Prepared by: Ashraf Soliman Abuhamad Supervisor by : Dr. Sana’a Wafa Al-Sayegh University of Palestine Faculty.

Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.

Sequences and Conveyors By Dr. Jason Merrick. Simulation with Arena — Further Statistical Issues C11/2 Sequences Open the Arena File “BankNoSequences.doe”

Chapter 10. Simulation An Integrated Approach to Improving Quality and Efficiency Daniel B. McLaughlin Julie M. Hays Healthcare Operations Management.

Assignment 5 Purpose: comparison of models and reporting on the conclusions. Models supposed to be correct, so e.g. apparently increased keeper productivity.

Introduction to Operations Research

Introduction to Queueing Theory

Modeling. Conceptual modeling: Petri nets Implementation: Arena, CPN tools Simulation needed: build models. Start with concepts, then select appropriate.

18 Management of Waiting Lines.

Queuing Queues are a part of life and waiting to be served is never really pleasant. The longer people wait the less likely they are to want to come back.

Chapter 16 Capacity Planning and Queuing Models

Course Information Sarah Diesburg Operating Systems COP 4610.

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

Advanced Algebra II Notes 9.1 Using the Distance Formula Investigation: Bucket Race The starting line of a bucket race is 5 m from one end of a pool, the.

The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.

Building Elevator System Simulation © 2012 ~ Mark Polczynski All rights reserved 1Building Elevator System Simulation.

Computer Networking Queueing (A Summary from Appendix A) Dr Sandra I. Woolley.

Loyola University Libraries The Pros, Cons, and Anomalies of an Academic Library Abby Annala.

Delays  Deterministic Assumes “error free” type case Delay only when demand (known) exceeds capacity (known)  Stochastic Delay may occur any time Random.

OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin

Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.

SRED: Stabilized RED T. Ott, T.V. Lakshman, L. Wong Presented by King-Shan Lui.

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

Queues 1. Introduction A sequential collection of data Changes occur at both ends, not just one Queue applications –files waiting to be printed –"jobs"

Tel Hai Academic College Department of Computer Science Prof. Reuven Aviv Markov Models for data flow In Computer Networks Resource: Fayez Gebali, Analysis.

Marlon Dumas marlon.dumas ät ut . ee

Session 10: Business Process Simulation

Al-Imam Mohammad Ibn Saud University

Application of Queueing

Queue Management Jennifer Rexford COS 461: Computer Networks

DCT container terminal

THINGS YOU SHOULD KNOW ABOUT JOB SCHEDULING. One such automation tool to run the essence of any organization or enterprise is Job scheduling. It is the.

GCSE Pearson Edexcel Business How to approach your exam

Delays Deterministic Stochastic Assumes “error free” type case

First Arena Model.

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

How long must the plant operate on peak days?

Greedy Methods Knapsack Problem Hoffman Codes

Data structures and algorithms

Delays Deterministic Stochastic Assumes “error free” type case

Discrete Event “Hand” Simulation of a GI/GI/1 Queue

24 February 2019 Model Antrian M/D/1.

Queueing Theory 2008.

Presentation transcript:

DCT Analysis

Concepts: UML-like class model of essential classes and actions.

Conceptual model: Simplest model: connected queues. More advanced models differ between 3 classes of trucks and various actions of crane.

Essence: 2 connected queues. (only 8 exceptions out of 500) Most important parameters:  k (keeper occupation rate)  c (crane occupation rate) Assume M/D/1 queues (exp arrival, const processing) if  k ≥  c, then crane queue empty. If  k <  c, then average queue length keeper: C/(1-  k ) average queue length crane+keeper: C/(1-  c ) (approximately for some constant C) If e.g.  k = 0.9 and  c = 0.91, then keeper queue 10C and crane queue C. Greatest capacity problem with crane, though! c.f. Arena model DCT.doe in "examples" directory.

Problem: large queues; keeper queue largest. Causes: keeper occupation rate too high, also crane capacity? Crane queue waiting time 35% of keeper waiting time, so crane capacity is an issue! Solutions: increase keeper productivity. Investigate crane occupation rate. Increase crane productivity also.

Short-term temporary solution: increase working hours. Cost: extra payment to workers, which is manageable ("business is booming"). Benefits: less dissatisfaction of customers. Longer term solution for keeper problem: use IT! Crane solutions (in any combination): - faster crane - double queue - improve container storage

Assignments 4-5 assignments throughout the course Bonus for exam: max. 2 points Bonuses awarded for overall quality and nice parts (e.g. concepts, problem analysis and suggestions). This assignment: score ≥ 8: full bonus (.4) OK(7): small bonus (.2)

Impression Much enthousiasm and hard work. Some reports were very good (talent or experience). Need course? Others need not despair. Hopefully course will help you.