A Glass Float Line Simulation: Modeling Methodology and Applications Scott R. Schultz - Mercer University, Macon, GA.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Adaptive Large Neighbourhood Search for the Vehicle Routing Problem with Drivers Working Hours Asvin Goel MIT-Zaragoza International Logistics Program.
Simulation - An Introduction Simulation:- The technique of imitating the behaviour of some situation or system (economic, military, mechanical, etc.) by.
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
New Non-Contact, Laser-Based Gauge for Measuring Length and Speed of Gypsum Board Stuart Manser Beta LaserMike.
Case Study 6: Concentrate Line at Florida Citrus Company
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
Introduction to CMOS VLSI Design Clock Skew-tolerant circuits.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
The AutoSimOA Project Katy Hoad, Stewart Robinson, Ruth Davies Warwick Business School WSC 07 A 3 year, EPSRC funded project in collaboration with SIMUL8.
Operating Systems (CSCI2413) Lecture 4 Process Scheduling phones off (please)
Scheduling Algorithms for Wireless Ad-Hoc Sensor Networks Department of Electrical Engineering California Institute of Technology. [Cedric Florens, Robert.
Searches & Sorts V Deena Engel’s class Adapted from W. Savitch’s text An Introduction to Computers & Programming.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
The AutoSimOA Project Katy Hoad, Stewart Robinson, Ruth Davies Warwick Business School OR49 Sept 07 A 3 year, EPSRC funded project in collaboration with.
1 Adaptive Kalman Filter Based Freeway Travel time Estimation Lianyu Chu CCIT, University of California Berkeley Jun-Seok Oh Western Michigan University.
Computer Science 1620 Programming & Problem Solving.
An overview of design and operational issues of kanban systems M. S. AKTÜRK and F. ERHUN Presented by: Y. Levent KOÇAĞA.
Parallel Computation in Biological Sequence Analysis Xue Wu CMSC 838 Presentation.
1 Simulation Methodology H Plan: –Introduce basics of simulation modeling –Define terminology and methods used –Introduce simulation paradigms u Time-driven.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Ann Melissa Campbell, Jan Fabian Ehmke 2013 Service Management and Science Forum Decision.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Basic Concepts Maximum CPU utilization.
Verification & Validation
Deadline-sensitive Opportunistic Utility-based Routing in Cyclic Mobile Social Networks Mingjun Xiao a, Jie Wu b, He Huang c, Liusheng Huang a, and Wei.
Timing Trials An investigation arising out of the Assignment CS32310 – Nov 2013 H Holstein 1.
Sequences and Conveyors By Dr. Jason Merrick. Simulation with Arena — Further Statistical Issues C11/2 Sequences Open the Arena File “BankNoSequences.doe”
Transit Priority Strategies for Multiple Routes under Headway-based Operations Shandong University, China & University of Maryland at College Park, USA.
*** CONFIDENTIAL *** © Toshiba Corporation 2008 Confidential Creating Report Templates.
Arterial Lane Selection Model Moshe Ben-Akiva, Charisma Choudhury, Varun Ramanujam, Tomer Toledo ITS Program January 21, 2007.
© 2008 Prentice Hall2-1 Introduction to Project Management Chapter 2 The Project Management Life Cycle Information Systems Project Management: A Process.
+ Simulation Design. + Types event-advance and unit-time advance. Both these designs are event-based but utilize different ways of advancing the time.
© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems Mutual Exclusion.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
Cell Zooming for Cost-Efficient Green Cellular Networks
PAGE 1 Sustainable Buildings 2030 © 2008 THE WEIDT GROUP Building Energy Benchmarks THE WEIDT GROUP.
August 27, 2012 ETM 607 Slide 1 ETM 607 Application of Monte Carlo Simulation: Scheduling Radar Warning Receivers (RWRs) Scott R. Schultz Mercer University.
© 2009 BMA Inc. All rights reserved.  Capacity analysis provides an overview of how effectively you use time in each cell.  The time is categorized.
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 5: CPU Scheduling Basic.
Jonathan Atzmon, ISE/ETM Dr. Joan Burtner, Advisor Last Revised 03/03/15 Atzmon ETM , Simulation in Healthcare, Spring 2015, Dr. Joan Burtner 1.
Introduction To CNC-Programming
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
6.1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Heuristic Methods for the Single- Machine Problem Chapter 4 Elements of Sequencing and Scheduling by Kenneth R. Baker Byung-Hyun Ha R2.
ExitTOC TIMSNT Introduction 2003-Part 3 1 Introduction to TIMSNT-Part 3 Part 3: Menu Items Runs, Driver Directions, Stops, Routes and Options Use the buttons.
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Computer Programming 12 Lesson 6 – Loop structure By: Dan Lunney.
1 Performance Impact of Resource Provisioning on Workflows Gurmeet Singh, Carl Kesselman and Ewa Deelman Information Science Institute University of Southern.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
1 Chapter 5: CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms.
Traffic Models Alaa Hleihel Daniel Mishne /32.
Repetition Structures Chapter 9
CHAPTER 5A Loop Structure
A Modeling Framework for Flight Schedule Planning
Instructor: Alexander Stoytchev
Chapter 6: CPU Scheduling
Introduction to Project Management Chapter 2 The Project Management Life Cycle Information Systems Project Management: A Process and Team Approach, 1e.
Module 5: CPU Scheduling
Routing Without Flow Control Hot-Potato Routing Simulation
World-Views of Simulation
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter 6: CPU Scheduling
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Chapter 6: CPU Scheduling
Chapter 9 Survey Methodology Basic survey language Types of surveys
Arrays.
Module 5: CPU Scheduling
Presentation transcript:

A Glass Float Line Simulation: Modeling Methodology and Applications Scott R. Schultz - Mercer University, Macon, GA.

Outline – Glass Float Line Simulation Glass Float Line Introduction Problem Statement Modeling Issues Selected Application - Typical Scheduling Session -Comparison of Sequencing Algorithms - Design for New Float Line

Glass Float Line Introduction Top View – Glass Float Line

Glass Float Line Introduction Cutting and Scoring Process 1 – Continuous Ribbon of Glass 2 – Streams of Glass 3 – Individual Brackets Conveyors Pull gaps (speedup conveyors) Spurline speed dependent on number of panels in light tilt-down conveyors conveyor control rules

Glass Float Line Introduction Mainline Scrap Generation conveyor immediately downstream from furnace cannot stop all other mainline conveyor sections will stop until spurline clears Cutting Algorithms up to 2 routes per spurline sequential –vs- dynamic

Operational Issues: Inefficient cutting schedules (generates mainline scrap, requires too much manpower) Cutting algorithms (which route to cut when, impacts mainline scrap) Issues / Problems Design Issues: Upstream or downstream mainline scrap cullet 4 –vs- 5 spurlines

Operational Issues: Evaluate cutting schedules (used on a daily basis) Evaluate and develop alternative cutting algorithms Design Issues (future float line): Evaluate effect of having an upstream –vs- downstream mainline scrap cullet Evaluate the impact of 4 –vs- 5 spurlines Simulation Goals

Process is initially continuous (ribbon of glass), then becomes discrete (lights, followed by panels). Gaps between “streams” and “brackets” must be precisely modeled due to impact on controlling conveyor zones. Modeling Issues

Continuous-discrete Process: Furnace produces continuous ribbon of glass 24 hours a day, but continuous ribbon turns into discrete “streams” at the slant cutter. Approach: ignore continuous portion. Start model at the slant cutters. Discrete entity – “stream” of glass Time between entity arrivals is a function of the “stream” length and the mainline conveyor speed. “Stream” length varies as a function of the cutting algorithm and cutting schedule. “Stream” of glass generates multiple entities at spurline snap roller. Modeling Issues

Controlling gaps between “streams” and “brackets” and conveyor control: gaps are generated as a function of the difference in speeds between the upstream conveyor and downstream speedup conveyor. zone control for tilt down conveyors - only one covey (streams for same spurline) per conveyor section. Modeling Issues

29 resources 74 conveyors 123 stations 600 parameters (mostly associated with cutting schedule) Model Summary

Analysis of Cutting Schedules Example cutting schedule entered by user.

Analysis of Cutting Schedules Example float line operating paramters.

Analysis of Cutting Schedules Results using previous cutting schedule and operating parameters.

Analysis of Cutting Schedules Analyst decided to reduce the number of active routes to from 11 to 8. Efficiency increased from 37.2% to 69.2%.

Analysis of Cutting Schedules Analyst decided to further reduce the number of active routes to 6. Utilization fell from 69.2 to 50.4%, and 35.9% scrapped at mainline cullet.

Comparing Cutting Algorithms Sequential: 1. Cut streams for all active routes, in order from spurline 7 to spurline Repeat steps 1 to 2. Dynamic: 1. Initialize a clock for every active spurline to 0. These clocks increment one unit for every elapsed second. 2. Find the spurline with the greatest clock value and cut all active routes for that spurline. 3. Reset the clock for the spurline chosen in step 2 to minus the stream removal time 1 for that spur. 4. Repeat steps 2 to 4. 1 Stream removal time - {(rm i + rt i )*n i } rm i - standard time to remove panel i rt i - time to rotate panel i n i - number of panels per stream i i - an element of the set of active routes for the stream.

Comparing Cutting Algorithms Modified-Dynamic: 1. Initialize a counter for every active spurline to Find the active spurline with the smallest counter value and cut all active routes for that spurline. 3. Increase the counter for the spurline chosen in step 2 by the stream removal time 1 for that spur. 4. Repeat steps 2 to 4.

Comparing Cutting Algorithms

Comparison of Results: Modified-Dynamic significantly outperforms both the sequential and dynamic in both mainline scrap reduction and balanced spurline utilization.

Comparison of 4 –vs- 5 Spurlines Approach Spurlines functional 90% of time (downtime associated with scheduled and unscheduled maintenance) 64 day cutting schedule simulated using 5, 4, 3, 2, or 1 spurline respectively to determine percent mainline scrap generated. Using Binomial function, and the 90% uptime estimate, probability of having 5,4,3,2,1, or 0 (or 4,3,2,1 or 0) spurlines active is calculated. Probabilities used in conjunction with simulation of scrap generation used to calculate expected scrap amount. Results Expected Mainline Scrap 4 Spurlines % 5 Spurlines -0.62%

Comparison of Upstream –vs- Downstream Mainline Cullet Approach Same 64 day cutting schedule and approach used to compare 4 –vs- 5 spurlines. For upstream cullet, when spurline gate is occupied, the glass will stop on the previous mainline conveyor section. Glass may continue to backup to mainline cullet. With downstream cullet, when spurline gate is occupied, glass destined for that spurline will pass over the spurline and will scrap at downstream location. Results Expected Mainline Scrap UpstreamDownstream 4 Spurlines %2.46% 5 Spurlines -0.62%0.47%

Questions ?