Sept. 27, 2002RCL - Fab starts scheduling 1 Scheduling Dedicated Lithography Equipment Dr. Robert C. Leachman Dept. of Indus Eng & Oper Res U C Berkeley.

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

Strategic Decisions (Part II)
Introduction to Mathematical Programming
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Planning with Linear Programming
Linear Programming Problem
BA 452 Lesson B.3 Integer Programming 11ReadingsReadings Chapter 7 Integer Linear Programming.
Logistics Network Configuration
6 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Capacity Planning 6 For Operations Management, 9e by Krajewski/Ritzman/Malhotra.
Linear Programming Problem Formulation.
1 Dynamic portfolio optimization with stochastic programming TIØ4317, H2009.
Process Control in Semiconductors March 28, 2006.
Module 20 Pricing and Related Decisions. The Value Chain The set of value-producing activities that stretches from basic raw materials to the final consumer.
Accelerating Productization. Functional Metrology TM Challenges of Semiconductor Productization Leading IDM’s Solution Novel Solution -> In-product Functional.
Kenneth J. Andrews EMP Gen-X: Manufacturing Analysis What is the process?Build & test of AXIS machine for a specific Customer Who is the customer?MegaPower-
Oliver Rose Dresden University of Technology Department of Computer Science Chair for Modeling and Simulation Benefits and Drawbacks of Simple Models for.
T h e Y i e l d M a n a g e m e n t C o m p a n y Service Business Rich Ruiz Director, Global Provisioning GSS Service Supply Chain Mgmt.
Linear Goal Programming
Operations Research I Lecture 1-3 Chapter 1
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Scheduling for Dedicated Machine Constraint Using Integer Programming Huy Nguyen Anh Pham, Arthur Shr, and Peter P. Chen Louisiana State University, Baton.
Operations Planning Horizons
Elements of the Heuristic Approach
1/33 Team NCKU lead by I-Lin Wang INFORMS RAS 2014 Problem Solving Competition Team NCKU (National Cheng Kung  I-Lin Wang (Associate.
© OpStat Group Inc. All rights reserved. 1 A Lean Analysis Methodology Using.
Operational Research & ManagementOperations Scheduling Flow Shop Scheduling 1.Flexible Flow Shop 2.Flexible Assembly Systems (unpaced) 3.Paced Assembly.
Roman Keeney AGEC  In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation.
Scheduling.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 16 Scheduling.
Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.
A Parallel Integer Programming Approach to Global Routing Tai-Hsuan Wu, Azadeh Davoodi Department of Electrical and Computer Engineering Jeffrey Linderoth.
Ardavan Asef-Vaziri Systems and Operations Management
Introduction to Business 3e 9 Part III: Management Copyright © 2004 South-Western. All rights reserved. Improving Productivity and Quality.
Planning Production of a Set of Semiconductor Components with Uncertain Wafer and Component Yield Frank W. Ciarallo Assistant Professor Biomedical, Industrial.
Sourcing Decisions.
ITRS Factory Integration Difficult Challenges Last Updated: 30 May 2003.
Strategic Production Planning Now showing at your local university.
Section 10: Advanced Topics 1 M. Balakrishnan Dept. of Comp. Sci. & Engg. I.I.T. Delhi.
1 1 Practice Final John H. Vande Vate Fall, 2002.
Chapter 19 Business Dynamics by John D. Sterman Labor Supply Chains and the Origin of Business Cycles.
Criticisms of Absorption Cost Systems: Inaccurate Product Costs Chapter Eleven Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved.
Criticisms of Absorption Cost Systems: Inaccurate Product Costs Chapter Eleven.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
Capacity Planning. Capacity Capacity (I): is the upper limit on the load that an operating unit can handle. Capacity (I): is the upper limit on the load.
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
Target Costing and Cost Analysis for Pricing Decisions
LINEAR PROGRAMMING.
3-1 Chapter 3: Network Planning CMB 8050 Matthew J. Liberatore.
Xilinx Confidential Oracle APS Mark Hopkins Manager, Operations Systems Xilinx, Inc.
Review Test 2 BSAD 30 Dave Novak Source: Anderson et al., 2015 Quantitative Methods for Business 13 th edition – some slides are directly from J. Loucks.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
July 11, 2016 Run-to-Run Control of Linewidth and Overlay in Semiconductor Manufacturing Christopher Allen Bode Dr. Thomas F. Edgar, Advisor University.
Chapter 7: Manufacturing Processes
Supplementary Chapter B Optimization Models with Uncertainty
Chapter 3: Cost Estimation Techniques
Analytical Tools for Process Analysis and Improvement
Pricing and Related Decisions
Cost Concepts and Design Economics
Graphical Analysis – the Feasible Region
TYPES OF INFORMATION SYSTEMS
A Procedure and Program to Optimize Shuttle Mask Cost Advantage
SE503 Advanced Project Management
Scheduling Scheduling is an important tool for manufacturing and service industries, where it can have a major impact on the productivity of a process.
TCM TOOLS & TECHNIQUES.
Facilities Planning and Design Course code:
Capacity Planning For Products and Services
Flexible Assembly Systems
Real Time Engineering Slab & Coil Yard Management and Plate Stock Report , Planning, Production, Reporting & Data Base Management Solution for Metal Industry.
Presentation transcript:

Sept. 27, 2002RCL - Fab starts scheduling 1 Scheduling Dedicated Lithography Equipment Dr. Robert C. Leachman Dept. of Indus Eng & Oper Res U C Berkeley Dr. Vincent Lin Leachman & Associates LLC Dr. Paolo Palezzato Cypress Semiconductor, Inc.

Sept. 27, 2002RCL - Fab starts scheduling 2 What’s happening in semiconductors Moore’s Law: the number of transistors quadruples every four years Rock’s Law: the cost of a fab doubles every four years Result 1: equipment pushed to technological limits, more process instability, more scheduling complexity Result 2: fewer advanced fabs and fewer fab operators, fabless/foundry partnerships Result 3: fabless firms do naïve planning, foundry must do real planning and scheduling and do it fast

Sept. 27, 2002RCL - Fab starts scheduling 3 Semiconductor supply chain (Develop process technology – 1 year) Wafer fabrication – 6 weeks Test chips on wafer – 1 week (Ship overseas – 0.5 week) Packaging and final test – 1 week (Ship overseas – 0.5 week)

Sept. 27, 2002RCL - Fab starts scheduling 4 “Time is money”

Sept. 27, 2002RCL - Fab starts scheduling 5 “Time is money”

Sept. 27, 2002RCL - Fab starts scheduling 6 “Time is money”

Sept. 27, 2002RCL - Fab starts scheduling 7 The economic value of cycle time in the supply chain Let P i (t) denote the sales price of device i at time t. P i (t) = P 0i exp(-  t), where P 0i is the current price. Let W i (t) denote the wafer starts, Y i (t) the yield, CT i (t) the manufacturing cycle time, and H i the remaining product life. Then the remaining lifetime revenue is

Sept. 27, 2002RCL - Fab starts scheduling 8 Lithography Lithography represents the greatest capital expense in an advanced fab Strategies to stretch machine capabilities: – each manufacturing lot must be processed using the same lens (machine) at 3-10 “critical layers” – at other layers, the lot may only be processed by one or several machines that have been “matched” to the critical machine Lithography accounts for ~25-40% of the wait-time portion of fab cycle time – e.g., 20 mask layers, 6-8 hours avg. wait time per layer

Sept. 27, 2002RCL - Fab starts scheduling 9 Lithography Example small litho dept: 3 scanners (S1, S2, S3), 3 DUV steppers (D1, D2, D3), 5 I Line steppers (I1, I2, I3, I4, I5) Example alternative photo routes for a high-volume device: LayersRoute 1Route 2Route 3 1 and 3 I1I3I4 4, 5 and 7 I1 or I2I3 or I4I4 or I5 2, 6, 8-12 and 13 S1S2S3 14, 15 and 16 D1D2S2 17I1 – I5I1 – I5I1 – I5

Sept. 27, 2002RCL - Fab starts scheduling 10 Lithography Despite the matching restrictions, the photo process occasionally fails and requires engineering effort to restore stability As a risk-mitigation strategy, it is desirable to spread the production of a given device across several photo routes

Sept. 27, 2002RCL - Fab starts scheduling 11 Lithography capacity Capacity for new starts depends on the device mix Capacity for new starts each week depends on the WIP status Photo wait times are sensitive to the allocation of the planned weekly starts to photo routes and to days of week

Sept. 27, 2002RCL - Fab starts scheduling 12 Rest of fab In contrast, capacity of the other process areas in the the fab is expressable by technology (i.e., all lots of all devices in same technology have same set of qualified machines, same process times, etc.) To control wait times in the rest of the fab, linear production rates by technology are desired

Sept. 27, 2002RCL - Fab starts scheduling 13 Planning and scheduling architecture – fabless firm Use commercial LP-based tools such as i2, Adexa, MIMI, Avere, etc. Plan starts requests - Obtain estimates of cycle times and yields from foundry periodically, obtain WIP snapshot on-line Incorporate start commits from foundry as if it is additional WIP Quote delivery dates based on WIP-out projections

Sept. 27, 2002RCL - Fab starts scheduling 14 Sophisticated planning and scheduling architecture - foundry LP-based planning system to analyze weekly wafer start requests and/or die out requests – Dynamic capacity analysis of workloads from WIP and new production – Rigorously analyze lithography and other capacities IP-based fab starts scheduling system to allocate the accepted starts to machines and to days of week

Sept. 27, 2002RCL - Fab starts scheduling 15 Fab starts scheduling problem Given: time-varying machine capacities, qualified photo routes, process times, total manufacturing lots to be started this week, WIP snapshot, estimated cycle times and yields Variables: what day of week and what photo route on which to start each manufacturing lot Multiple objectives: balance workloads of photo machines, linearize starts rates by technology, spread out device starts across photo routes

Sept. 27, 2002RCL - Fab starts scheduling 16 Integer programming model Constraints: Workload on machine i on day t = workload from WIP arriving on day t and workload from allocated starts arriving on day t Overload of (i,t-1) + workload of (i,t) <= capacity(i,t) + overload(i,t) Other accounting constraints and variables (e.g., define total overload by machine type)

Sept. 27, 2002RCL - Fab starts scheduling 17 Goal programming approach First, we minimize 10 different objectives independently: – Max overload of any photo machine on any day – Total of daily overloads on scanners – Total of daily overloads on DUV steppers – Total of daily overloads on I Line steppers – Max total workload on any scanner – Max total workload on any DUV stepper – Max total workload on any I Line stepper – Max starts on any day of technology 1 – Max starts on any day of technology 2 – Sum over devices of max starts of device i on a single route

Sept. 27, 2002RCL - Fab starts scheduling 18 Goal programming approach Afterwards, we solve for an objective to minimize the weighted deviation from optimality of each of the 10 goals – Try to simultaneously minimize overloads, equalize workloads, linearize starts by technology, and minimize risk of too many lots of same device assigned to same route

Sept. 27, 2002RCL - Fab starts scheduling 19 Implementation and results Fab switched from manual scheduling of fab starts to the IP-based fab starts scheduler Application is fully automated, takes about 40 mins to run using CPLEX (5K constraints, 1.5K integer vars, 11 IPs) – IP’s are solved to first integer solution within 1-2% of optimality Six weeks later, the average photo wait time per lot at the fab had declined by 1.5 days for both major technologies in production, while fab start volume was slightly increased

Sept. 27, 2002RCL - Fab starts scheduling 20 What is 1.5 days reduction worth? For the case-study fab’s current technology and product portfolio, The revenue gains will be even larger for future technologies

Sept. 27, 2002RCL - Fab starts scheduling 21 Summary Industry trends have increased the value of cycle time compression in the supply chain Optimization in the semiconductor industry is now being employed at the supply chain level, at the foundry planning level, and, starting with this application, at the scheduling level