ORI 390Q Models and Analysis of Manufacturing Systems First Exam, fall 1994

Similar documents
Deterministic Operations Research, ME 366Q and ORI 391 Chapter 2: Homework #2 Solutions

Study Unit 3 : Linear algebra

Exam of Discrete Event Systems

ST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1

2. Linear Programming Problem

SYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: production and operations management

School of Business. Blank Page

A Semiconductor Wafer

56:171 Operations Research Fall 1998

COMP9334: Capacity Planning of Computer Systems and Networks

56:171 Operations Research Midterm Exam - October 26, 1989 Instructor: D.L. Bricker

Practice Questions for Math 131 Exam # 1

LP Definition and Introduction to Graphical Solution Active Learning Module 2

Systems Optimization and Analysis Optimization Project. Labor Planning for a Manufacturing Line

Practice A Exam 3. November 14, 2018

Introduction to Operations Research Economics 172A Winter 2007 Some ground rules for home works and exams:

The Transportation Problem

Linear Programming CHAPTER 11 BASIC CONCEPTS AND FORMULA. Basic Concepts 1. Linear Programming

LINEAR PROGRAMMING BASIC CONCEPTS AND FORMULA

FURTHER MATHEMATICS Units 3 & 4 - Written Examination 2

Optimisation. 3/10/2010 Tibor Illés Optimisation

Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.)

Math 1325 Final Exam Review

Introduction to Operations Research. Linear Programming

Programmers A B C D Solution:

A Markov chain analysis of the effectiveness of drum-buffer-rope material flow management in job shop environment

LINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.

Introduction to Operations Research

CLASS NOTES: BUSINESS CALCULUS

Program Name: PGDBA Production and Operations Management Assessment Name: POM - Exam Weightage: 70 Total Marks: 70

DEPARTMENT OF MATHEMATICS

1 Reminders. In-class exam in two weeks (Sept 28/29) Assignments are posted after every class. Lecture is for big picture

Lecture Notes. Applied Mathematics for Business, Economics, and the Social Sciences (4th Edition); by Frank S. Budnick

Math 141:512. Practice Exam 1 (extra credit) Due: February 6, 2019

Manufacturing System Flow Analysis

MA 162: Finite Mathematics - Section 3.3/4.1

Linear programming: introduction and examples

CHAPTER 16: SCHEDULING

Linear Systems and Matrices. Copyright Cengage Learning. All rights reserved.

Industrial Processes I Manufacturing Economics

7.1Solvingsys2015.notebook. November 05, Warm up. Partial fraction decompostion

Final exam.

Bike Plast DD some remarks

Online Appendix for Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs

Math 1314 Final Exam Review. Year Profits (in millions of dollars)

Lecture 6: Sections 2.2 and 2.3 Polynomial Functions, Quadratic Models

April 2003 Mathematics 340 Name Page 2 of 12 pages

ANALYSIS OF AUTOMATED FLOW LINE & LINE BALANCING

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

1.4 Linear Functions of Several Variables

The Assignment Problem

MACHINE DEDICATION UNDER PRODUCT AND PROCESS DIVERSITY. Darius Rohan. IBM Microelectonics Division East Fishkill, NY 12533, U.S.A.

Math 116: Business Calculus Chapter 4 - Calculating Derivatives

Econ 172A, Fall 2012: Final Examination (I) 1. The examination has seven questions. Answer them all.

NON-CALCULATOR: I. Decide whether or not the following information defines a function. Explain/support your answer x y

Calculus in Business. By Frederic A. Palmliden December 7, 1999

12-1. Example 1: Which relations below represent functions? State the domains and ranges. a) {(9,81), (4,16), (5,25), ( 2,4), ( 6,36)} Function?

Exam 3 Review Math 118 Sections 1 and 2

How to handle and solve a linear equation (what s a linear equation?) How to draw the solution set for a linear inequality

1.4 CONCEPT QUESTIONS, page 49

MAT 111 Final Exam Fall 2013 Name: If solving graphically, sketch a graph and label the solution.

Understanding the Simplex algorithm. Standard Optimization Problems.

Introduction to Operations Research Prof G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Systems of Linear Equations in Two Variables. Break Even. Example. 240x x This is when total cost equals total revenue.

MAC 2233, Survey of Calculus, Exam 3 Review This exam covers lectures 21 29,

MODELING (Integer Programming Examples)

Extrema and the First-Derivative Test

MATH150-E01 Test #2 Summer 2016 Show all work. Name 1. Find an equation in slope-intercept form for the line through (4, 2) and (1, 3).

Social Science/Commerce Calculus I: Assignment #10 - Solutions Page 1/15

Solution Cases: 1. Unique Optimal Solution Reddy Mikks Example Diet Problem

Multicriteria Decision Making

Review Assignment II

Unit 4: Inequalities. Inequality Symbols. Algebraic Inequality. Compound Inequality. Interval Notation

Syllabus, Question Paper, Programs of BCA, BBA

...(iii), x 2 Example 7: Geetha Perfume Company produces both perfumes and body spray from two flower extracts F 1. The following data is provided:

Units and Dimensional Analysis

CONTINUOUS FLOW CHEMISTRY (PROCESSING) FOR INTERMEDIATES AND APIs

Math Want to have fun with chapter 4? Find the derivative. 1) y = 5x2e3x. 2) y = 2xex - 2ex. 3) y = (x2-2x + 3) ex. 9ex 4) y = 2ex + 1

CORE. Chapter 3: Interacting Linear Functions, Linear Systems. Algebra Assessments

Chapter 2: Introduction to Linear Programming

Chapter 2 Introduction to Optimization and Linear Programming

Study Guide - Part 2

Exercises - Linear Programming

Online Math 1314 Final Exam Review

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

Optimization Prof. A. Goswami Department of Mathematics Indian Institute of Technology, Kharagpur. Lecture - 20 Travelling Salesman Problem

Test 2 VERSION A STAT 3090 Fall 2017

COT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748

Concept and Definition. Characteristics of OR (Features) Phases of OR

MA 181 Lecture Chapter 7 College Algebra and Calculus by Larson/Hodgkins Limits and Derivatives

The Graphical Method & Algebraic Technique for Solving LP s. Métodos Cuantitativos M. En C. Eduardo Bustos Farías 1

56:171 Operations Research Final Exam December 12, 1994

EC611--Managerial Economics

Final Exam Aug. 29th Mathematical Foundations in Finance (FIN 500J) Summer, Sample Final Exam

Page Points Score Total: 100

CHAPTER 11 Integer Programming, Goal Programming, and Nonlinear Programming

VCE Further Mathematics Units 3&4

Maximums and Minimums

Econ 8208 Homework 2 Due Date: May 7

Applications of Systems of Linear Inequalities

Transcription:

ORI 90Q Models and Analysis of Manufacturing Systems First Exam, fall 1994 (time, defect rate) (12,0.05) 5 6 V A (16,0.07) (15,0.07) (5,0) M 1 1 2 M1 M2 O A (10,0.1) 7 8 V B (8,0.2) M4 2 4 M5 The figure shows the processes for two products. The operation times and defect rates are shown on the figure. s are in minutes. Inspections are perfect. Machine assignments are shown adjacent to the operations. Note that machines M1 and M2 are used for both products. Product A is made from a single raw material 1. Product B is made from two raw materials, 1 and 2. The table below gives the maximum sales and revenues for the products, and the unit costs for the raw materials. Assume 0 hours per week and 60 minutes per hour. The information on this page is used for several problems in the exam. You may use the results of one problem to aid in the analyses of the others. Finished Goods Max. Sales per week Revenue per unit of finished good Raw materials A 100/week $58 1 $0 B 100/week $95 2 $20 Cost per unit of raw material 1

Process A Name Index Next Oper. Defect Rate Defects Out Remove d A Start Op5 Op 1 2 12 5.0% M 1 1 5.0% 0.0% 1.0526 12.62 In6 In 2 7 0.0% Insp 1 1 0.0% 5.0% 1.0526 7.684 A End 0 0 0.0% 1 1 0.0% 0.0% 1 0 Ratio Unit Process B Name Index Next B Start Oper. Defect Rate Defects Out Remove d Op4 Op 1 2 8 20.0% M5 1 2 1 20.0% 0.0% 1.889 11.111 Op7 Op 2 10 10.0% M4 1 1 28.0% 0.0% 1.889 1.889 Op8 In 4 7 0.0% Insp 1 1 0.0% 28.0% 1.889 9.7222 B End 4 0 0 0.0% 1 1 0.0% 0.0% 1 0 Ratio Unit Process C Name Index Next Oper. Defect Rate Defects Out Remove d C Start Op1 Op 1 2 16 7.0% M1 1 1 1 7.0% 0.0% 1.1562 18.499 Op2 Op 2 15 7.0% M2 1 1 1.5% 0.0% 1.1562 17.4 In In 4 5 0.0% Insp 1 1 0.0% 1.5% 1.1562 5.781 C End 4 0 0 0.0% 1 1 0.0% 0.0% 1 0 Ratio Unit 2

1. (20 Points) The number of machines available for each type is shown in the table below. M1 M2 M M4 M5 Number 2 1 1 1 Unlimited We identify three modules in the problem: Module A: operations 5 and 6, Module B: operations 4, 7, and 8, Module C: operations 1, 2 and. Write the linear programming model that will determine the optimum product mix. Include variables for the three modules and the raw material amounts. Total 4997.4 Name: A B C 1 2 Values: 94.4 100 194.4 240 18.89 Linear Obj. Coef.: 58 95 0-0 -20 Lower Bounds: 0 0 0 0 0 Upper Bounds: 100 100 999999 1E+07 1E+07 Constraints Name Constraint Coefficients M1 0 0 18.499 0 0 5400 M2 0 0 17.4 0 0 600 M 12.62 0 0 0 0 1800 M4 0 1.889 0 0 0 1800 M5 0 11.111 0 0 0 1800 1 0 0 1.1562-1 0 = 0 2 0 1.889 0 0-1 = 0 Con 9 1.0526 1.889-1 0 0 = 0 Max 58A + 95B + 9C -01-202 subject to: M1: 18.5C 5400 M2: 17.C 600 M: 12.62A 1800 M4: 1.889B 1800 M5: 11.111A 1800 1: 1.1562C -1 = 0 2: 1.889B -2 = 0 Conservation: 1.0526A + 1.889B - C = 0 0 A 100, 0 B 100, C 0, 1 0, 2 0

(10 Points) For the situation in the figure, what is the throughput dollars per unit for each product? The throughput dollars per unit is the revenue raw material cost. For A: 58 u 1 *u 5 *0 (we must multiply the two flow ratios together to find the amount of 1 per unit of A. TP$ A = 58* - (1.24)*(1.056)*0 = 50 0*1.299 = 19.01 For B: 95 u 1 *u 7 *0 u 4 *20 TP$ B = : 95 (1. 24)(1.89) *0 1.89 *20 = 15.78 2. (10 Points) After the linear programming model is solved, we discover the following information from the sensitivity analysis. The reduced cost for product B is 9.22, and all the other reduced costs are zero. The dual variable for the constraint for machine M2 is 1.1. What do these two numbers tell you? The value of 9.22 indicates the value of increasing the market for product B by 1 unit. The value of 1.1 is the increase in the objective by increasing the availability of machine 2 by 1-minute. 4

. (20 Points) It turns out that the market demand for product B is a bottleneck and the time available on machine M2 is a bottleneck. We would like to get more profit from the business. Evaluate the following changes as to whether or not the throughput will increase after the change. Explain your reasoning briefly. Action Invest in a marketing strategy that will increase the maximum sales of product A. Improve the Throughput? Why or Why not? This will not help. Product B is not a bottleneck. You might have a greater demand, but you won t sell any more. The throughput will stay the same. Outsource some of the production of module C. The cost per unit of the product from the outside supplier is $40. This material has no defects. This might help because it will take some load off the M2 machine and allow more production of product B. The raw material cost for module C per unit out of C is 0*u 1 = 0*1.246.= 7.0. Although the outsourceing cost is greater, the TP will be increased. Add an inspection station after operation 4. This change will reduce the flow ratio for operation 7 and thus the amount of time per unit of B on the bottleneck machine. Thus change will allow more production of B. It also will reduce the cost of 1 for product B. Add an inspection operation after operation 1. This change will have the effect of reducing the flow ratio for operation 2. Thus more product will be able to be manufactured on machine 2. The throughput will increase. 5

4. (20 Points) You decide to manufacture the products on two separate lines. The processes now appear as in the figure below. (time, defect rate) (16,0.07) (15,0.07) (5,0) (12,0.05) 1 1 2 5 6 V A M1 M2 M (16,0.07) (15,0.07) (5,0) (10,0.1) 1 1 2 A 7 8 V B M1 M2 (8,0.2) M4 2 4 M5 The allocation of machines to the two lines is indicated in the table below. Machines now produce only one product. How does this change the product mix? Is separating the lines a good idea? Machine Assignment for Process A M1 M2 M M4 M5 Number 1 1 1 0 0 Unlimited Machine Assignment for Process B M1 M2 M M4 M5 Number 2 1 0 1 1 Unlimited With this information each product has its own bottleneck. Based on the unit times, the bottleneck for product A is machine 1. The maximum production is 1800/2.7 = 92 units The bottleneck for product B is M2 with the maximum production allowed of 74 units. This is not a good idea, since the throughput of both products is reduced. 6

6. (10 Points) Now consider only the system for product B. We decide to manufacture 150 units per week of product B. We will provide as many machines of each type as necessary. (16,0.07) (15,0.07) (5,0) (10,0.1) 1 1 2 A 7 8 V B M1 M2 (8,0.2) M4 2 4 M5 In addition to the information in the figure, we discover an unexplained delay of 0 minutes in front of each inspection operation. a. What is the value of WIP for this production rate? We must compute the WIP for three separate parts since the flow the parts is different and the Raw material contents is different. For operations 1, 2 and, the flow is 1.6058*150 = 241. The residence time is 16 + 15 + 0 + 5 = 66 min or 0.0667 weeks The WIP is 241*0.0667 = 8.82 units The value of the WIP is 8.82*0 = 264.9 For operation 4, the flow is 1.889*150 = 208. The residence time is 8 min or 0.00444 weeks The WIP is 208*0. 00444 = 0.926 units The value of the WIP is 0.926 *20 = $18.51 For operations 7 and 8, the flow is 1.889*150 = 208. The residence time is 10 + 7 +0 = 47 min or 0.0261 weeks The WIP is 208*0.0261 = 5.44 units The value of the WIP is 5.44 *50 = $271.99 Total WIP is 15.19 Total Value of WIP is $555 b. What is the throughput time for a unit of product? The throughput time is the time for the longest path (1. 2., 7, 8). Add 1 hour for the inspection delays. The time is 16 + 15 + 5 + 10 + 7 + 60 = 11 minutes. c. How much raw material of 1 must be supplied for this production rate? The amount of 1 is 150 u 1 = 150*1.6058 = 240.88 7

7. (6 Points) In the book The Goal, the heat-treat process is discovered as a bottleneck. Give three specific examples of steps taken to exploit the heat-treat process. I'm particularly interested in exploiting rather than elevating or subordinating. Exploiting the heat-treat is getting as much out of the current capacity as possible. Some steps taken in the book are: Station a worker at the heat-treat machine so that it is never idle after it finishes the job. Try to make larger batches by adding parts with similar processing times. Improve the setup process so that the heat-treat machine is not delayed because of setup. 8 (4 Points) Give one example of steps taken to elevate, rather than exploit the heattreat process. An example of elevating was to outsource the heat-treat process. Another is to re-engineer the products so as not to require heat-treat. 8