Flexible Assembly line Minimum part set(MPS) Suppose there are l product types. Let N l denote the number of jobs for each product type l. If z is the.

Slides:



Advertisements
Similar presentations
EMBA-2, BUP Major Asad EO Chapter 5: Process Analysis.
Advertisements

Operations Scheduling
Process Analysis If you cannot describe what you are doing as a process, you do not know what you are doing. W.E. Deming.
FLOW SHOPS: F2||Cmax. FLOW SHOPS: JOHNSON'S RULE2 FLOW SHOP SCHEDULING (n JOBS, m MACHINES) n JOBS BANK OF m MACHINES (SERIES) n M1 M2Mm.
Chapter 5 Fundamental Algorithm Design Techniques.
Process Selection and Facility Layout
Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,
Types of scheduling problems Project scheduling - Chapter 4 Job shop - Chapter 5 (shifting bottle neck) Flow shop - Chapter 5 Flexible assembly - Chapter.
11–1. 11–2 Chapter Eleven Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Merge Sort 4/15/2017 6:09 PM The Greedy Method The Greedy Method.
© J. Christopher Beck Lecture 14: Assembly Line Scheduling 2.
1 IRWIN  a Times Mirror Higher Education Group, Inc. company, 1996 Facilities Layout.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E
1 IOE/MFG 543 Chapter 6: Flow shops Sections 6.1 and 6.2 (skip section 6.3)
Operations Management
1 IOE/MFG 543 Chapter 7: Job shops Sections 7.1 and 7.2 (skip section 7.3)
Lot sizing and scheduling
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Elements of the Heuristic Approach
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All rights reserved.
BY MISS FARAH ADIBAH ADNAN IMK
INTRODUCTION TO SCHEDULING
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Chapter 6 Process Analysis.
1 © The McGraw-Hill Companies, Inc., 2004 Introduction (from Chase) Process Analysis.
1-1 1 McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved.
Operational Research & ManagementOperations Scheduling Flow Shop Scheduling 1.Flexible Flow Shop 2.Flexible Assembly Systems (unpaced) 3.Paced Assembly.
Dr. Cesar Malave Texas A & M University
Manual Assembly Lines Chapter 4 Sections:
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Sequencing Mixed Models & Unpaced Lines Active Learning Module 4 Dr. César O. Malavé Texas A&M University.
Line Balancing Problem
1 Slides used in class may be different from slides in student pack Chapter 5 Process Analysis  Process Analysis  Process Flowcharting  Categories of.
Topics To Be Covered 1. Tasks of a Shop Control Manager.
Assembly Lines – Reliable Serial Systems
Assembly Line Balancing
Princeton University COS 423 Theory of Algorithms Spring 2001 Kevin Wayne Approximation Algorithms These lecture slides are adapted from CLRS.
Process Analysis I Operations -- Prof. Juran.
Process Layout Chapter 7 July 20, 2005.
Outline Introduction Minimizing the makespan Minimizing total flowtime
Work Systems and the Methods, Measurement, and Management of Work by Mikell P. Groover, ISBN ©2007 Pearson Education, Inc., Upper Saddle.
Processor Architecture
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
Operations Fall 2015 Bruce Duggan Providence University College.
© The McGraw-Hill Companies, Inc., Chapter 12 On-Line Algorithms.
Activity Scheduling and Control
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 6 Process Selection and Facilities Layout.
11 -1 Chapter 12 On-Line Algorithms On-Line Algorithms On-line algorithms are used to solve on-line problems. The disk scheduling problem The requests.
Facility Layout Objectives of Facility Layout Basic Types
1 Job Shop Scheduling. 2 Job shop environment: m machines, n jobs objective function Each job follows a predetermined route Routes are not necessarily.
Part 3.
Lecture 4 CPU scheduling. Basic Concepts Single Process  one process at a time Maximum CPU utilization obtained with multiprogramming CPU idle :waiting.
Organization of Workstations
Chapter 5 Process Analysis. Chapter 5 Process Analysis.
Perancangan Sistem Manufaktur
Process Design and Analysis
CHAPTER 8 Operations Scheduling
Lecture 15: Assembly Line Scheduling 3
Process Analysis.
Dr. Arslan Ornek IMPROVING SEARCH
FACILITY LAYOUT Facility layout means:
Chapter 5 Process Analysis.
Modeling Scheduling Problems
Swarm Intelligence: Bucket Brigade Assembly Lines
Chapter 7: Job shops Sections 7.1 and 7.2 (skip section 7.3)
Process Selection and Facility Layout Lecture 5. Forecasting Product and Service Design Technological Change Capacity Planning Process Selection Facilities.
Topic 15 Job Shop Scheduling.
Process Analysis “If you cannot describe what you are doing as a process, you do not know what you are doing.” W.E. Deming.
Flexible Assembly Systems
Presentation transcript:

Flexible Assembly line Minimum part set(MPS) Suppose there are l product types. Let N l denote the number of jobs for each product type l. If z is the greatest common divisor (GCD) of integers N 1 …N l then the vector (N 1 /z,…..N l /z) Is the smallest set having the same proportions of different product types. This set is called the minimum part set. It is used to determine the cyclic schedule and the cycle time for the schedule. Cycle time is determined after steady state conditions have been reached. See chapter 6 1

Unpaced Flexible Assembly line Consider a number of machines in series with a limited buffer between them The material handling system that moved the product from one to the next machine is unpaced Bypass is not allowed A machine can release its product to the next only if there is space in the buffer otherwise it is blocked Machines serve jobs in a first-in-first-out FIFO system. Ex: Assembly of televisions or copiers The buffer space is viewed as a machine with no processing time. – So a system with buffers is transformed into a system with no buffers, which make it easy to solve. 2

Profile fitting heuristics Select a job with the largest total processing time as the first job in the MPS For all the remaining jobs, consider each one of them- one at a time - and schedule it as the next job Calculate the total nonproductive time on all the machines Select the job with the lowest total nonproductive time as the next job in the partial sequence Stop when all the jobs in the MPS have been scheduled Weighted Profile fitting heuristics – A weight is given to the nonproductive time on each machine 3 Unpaced Flexible Assembly line

Jobs1234 P 1j 2423 P 2j 4402 P 3j 2020 Weights on nonproductive time machine 1 and 2 = 2 Machine 3 = 1 4

Paced Flexible Assembly line Paced lines have a conveyor to move the jobs. – Examples car assembly line Jobs maintain a fixed distance from one another. Cycle time is the reciprocal of production rate Stations are different segments of the assembly line Sometimes the workers walk along with the job as the conveyor moves. Bypass is not allowed 5

Scheduling of Flexible Flow systems with Bypass Ex. Printed Circuit Boards Assembly line with several stages. Some of the stages have parallel machines A job is a batch of identical items has to be processed only on any one machine if the stage has parallel machines Bypassing stages is allowed Limited buffer size at a stage. – If buffer is full, then the material handling stops or the jobs must bypass the stage and recirculate. Obj function: Maximize throughput while minimizing the cycle time of the MPS (make span). Flexible flow line loading algorithm is used (FFLL) 6

Scheduling of Flexible Flow systems with Bypass 7

The release timing phase The machine with the greatest MPS workload is the bottleneck, since MPS cycle time cannot be smaller than the workload of the bottleneck machine. – Consider one machine at a time and schedule jobs based on the sequence as and when they are available. – Delay jobs as much as possible that are upstream to the bottleneck machine without altering the sequence. Delays are calculated based on the starting point of the jobs on the bottleneck machine – Process all jobs as soon as possible on the machines that are downstream to the bottleneck machine See chapter 6 8