0% found this document useful (0 votes)
101 views9 pages

Final LCSM

Here are the key steps to solve this problem: 1) Calculate the minimum number of workstations needed using the formula: Total Task Time / Cycle Time - Total task time is 18 minutes - Desired output is 180 units/day - Operating time is 450 minutes/day - So minimum workstations is 18/x = 180 * (x/450) - x = 9 minutes 2) To get an output of 125 units/day, use the formula: Total Task Time / Cycle Time - Set it equal to the desired output: 18/x = 125 * (x/450) - Solve for x to get a cycle time of 12 minutes 3) Calculate the output with the given

Uploaded by

David Babaganov
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
0% found this document useful (0 votes)
101 views9 pages

Final LCSM

Here are the key steps to solve this problem: 1) Calculate the minimum number of workstations needed using the formula: Total Task Time / Cycle Time - Total task time is 18 minutes - Desired output is 180 units/day - Operating time is 450 minutes/day - So minimum workstations is 18/x = 180 * (x/450) - x = 9 minutes 2) To get an output of 125 units/day, use the formula: Total Task Time / Cycle Time - Set it equal to the desired output: 18/x = 125 * (x/450) - Solve for x to get a cycle time of 12 minutes 3) Calculate the output with the given

Uploaded by

David Babaganov
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 9

FINAL CLASS LCSM OPERATIONS MANAGEMENT

APRIL 12/2017

1 PAGE DOUBLE SIDED CHEAT SHEETBRING


CALCULATOR
SECTION 4

7 CHAPTERS
7 SECTIONS
28 SUB QUESTIONS

CHPT 8- 4 QUESTIONS 15 MARKS

CHAPTER 16- 4 QUESTIONS- 15 MARKS

CHAPT 17- 4 Q-- 20 MARKS

CHAPTER 9- 4 Q-- 12 MARKS

CHAPTER 15 JIT- 4 QUESTIONS -12 MARKS

CHAPTER 6- 3 QUESTIONS - 12 MARKS


CHAPTER 6 PROCESS DESIGN AND FACILITY
LAYOUT
MAKE OR BUY (PIZZA )
PROCESS TYPES (JOB, SHOP, BATCH ) DEFINE

BASIC LAYOUT TYPES (PRODUCT/PROCESS

PRODUCT (LINE) LAYOUT

PROCESS (FUNCTIONAL) LAYOUT 4 BOXES

ASSEMBLY LINE BALANCING (NUMBERS BIG CRUNCH)

CYCLE TIMEDEFINE AND

LINE BALANCING FORMULAS (****NUMBERS)


FORMULA SHEET

PRECEDENCE NETWORK (TAKE SERIES OF DATA AND


CONSTRUCT DIAGRAM)

LINE BALANCING PROCEDURE


1)DRAW AND LABAL > DESIRED

EXAMPLE 1: LINE BALANCING

EXAMPL 1 :SOLUTION******** (CHART


WORKSTATION/TIME REMAINING/)
AN ITEM CAN ONLY BE ELIGIBLE IF NO
EFFICIENCY OF THE THREE MINUTES AVAILABLE

LINE BALANCING RULES


RUN SCENARIO A USING HEURISTIC
B
CHOSE IFLEAST AMNT IDLE

CHAPTER 8
LOCATION DECISION FACTORS (COUNTY REGIONAL

LOCATIONAL BREAK EVEN ANALYSIS


MAP, GRAPH, AND SEE WHICH LINE IS BEST

TRANSPORTATION MODEL

FACTOR RATING EXAMPLE (WEIGHTING OF


ACTIVITIES, (DRIVE BY, COST, BLDG, COST) SITE A1
VS A2 GET RESULTS
GIVEN THIS WEIGHTING AND FACTORS WHICH DO
YOU RECOMMEND COPY CHART

CENTER OF GRAVITY METHOD


SIMPLE AND WEIGHTED

SIMPLE
EXAMPLE 3-PAGE 327

WIEGHTED (BRING IN ANOTHER FACET) IE SALES,


RECEIPT SHIP

QUALITY CHAPTER
DIMENSIONS OF QUALITY

BASIC QUALITY TOOLS


EACH OF THE 7 TOOLS WHAT THEY MEAN AND HOW
THEY FUNCTION PIE CHART *******

METHODS FOR GENERATING IDEAS

CHAPTER 12
INVENTORY FIRST QUESTION ON EXAM
CHAPTER 12- INVENTORY 5 QUESTIONS ---20
MARKS

WHAT IS INVENTORY

FUNCTIONS OF INVENTORY

INVENTORY REPLENISHMENT

ABC CLASSIFICATION SYSTEM (WHAT IS THE


DEMAND AND WHAT DOES IT COST)

FIXED ORDER QUANTITY


EOQ, EPQ, AND DISCOUNTS

****BASIC ECONOMIC ORDER QUANTITY (EOQ)


FORMULA PAGE
TOTAL ANNUAL COST= ANNUAL HOLDING COST
+ANNUAL ORDERING COST TC=
YOU WANT ANNUAL CARRYING TO EQUAL ANNUAL
HOLDING
MAKE SURE PER YEAR
HOLDING COST=I(18%)XC(

EOQ WITH QUANTITY DISCOUNTS


RXD****** LOWER COST PURCHASE VOLUME WINS
MOST OF THE TIME EOQ=180
PRICE RANGE: 1-100 $300
101-1999 $275
200+ $250
AND WHAT WOULD POSSIBLY CAUSE U NOT TO TAKE
SHELF LIFE, PRODUCT HOLDING, COULD THROW END
UP IT OUT,

WHATS NEXT? (ROP=dxLT)

THE STATISTIC CHART


SS= SERVICE FACTOR * STANDARD DEVIATION
(GIVEN)
MNGMNT WILL ONLY TOLETATE 4% SERVICE ..
100-4= 96
THEN FIND IT IN Z CHART
FIND SAFTEY STOCK AND REORDER POINT
ROP=(DXLT)+SS

JIT LEAN 15

JIT/LEAN PRODUCTION

SOURCES OF WASTE (ASPECTS OF WASTE THAT CAN


OCCUR) (OVERPRODUCTION, OVERPROCESS,
UNNECESSARY TRANSPORT)

BENEFITS OF SMALL LOTS SIZESS


PROCESS QUALITY IMPROVEMENT (TERMS VOCAB)

LEVEL LOADING

PAGE 617 LEVEL MIX MODEL SEQUENCE


DAILY DEMAND
KANNBAN CARD

KANBAN FORMULA *** CHEAT SHEET


( N=DT(1+X))/C)

CHAPTER 17

PERFORMANCE GOALS

PEERT AND CPM

NETWORK CONVENTIONS (HAS TO HAVE BEGINNING


END)

EXAMPLE PRECEDENCE NETWORK

SOLUTION TECHNIQUE (ES, EF, LS, LF) SLACK TIMES


LONGESTPATH=CRITICAL PATH
WHAT IS LENGTH OF PROJECT AND CRITICAL PATH
THEY HAVE TO EQUAL
MAY BE MORE THAN ONE CRITICAL

CRASHING: PROCEDURE
LEAST EXPENSIVE ACTIITY
RANK CRASHING OPTIONS
(LOWEST TO HIGHEST)

CRASHING SEQUENCE ******* PUT ON CHEAT SHEET


THE BIG CHART + ANOTHER CHART
IDENTIFY EACH PATH ON NETWORK
ONLY WANT TO CRASH THE CRITICAL PATH
LOWEST $ BUT HAS TO BE ON CRITICAL PATH SO
ELMINATE ACTIVITY 5&6
Big part on test

Chapter 16
COMMON PRIORITY RULES
CRITICAL RATIO MOST IMPORTANT ****** TABLE AND
CALCULATE
SCFS VS CR

PERFORMANCE MEASURES

TWO WORK CENTER SEQUENCING

SEQUENCNIG EXAMPLE JOHNSON RULE *********


NORTH SOUTH OR EAST AND WEST
WORK CENTER 2 = RIGHT SIDE WORK CENTER 1=
LEFT SIDE AND THEN SCHEDULE IT IN
WHAT IS THE MAKE SPAN, AND WHAT IS THE IDLE
TIME?
MAKE SURE WC2 STARTS AT 5(CANNOT START ITEM
IN WORK CENTER TWO BEFORE ITS DONE IN THE
PRECEEDING WORK CENTER)
PAGE 229

Q1
An assembly line with 17 tasks is to be balanced. The longest task is 2.4 minutes,
and the total time for all tasks is 18 minutes. The line will operate for 450 minutes
per day.
a. What is the minimum number of work stations required if the output rate is to
be 180 units per day?
b. What cycle time will provide an output rate of 125 units per day?
c. What output will result with cycle times of i) 9 minutes? ii) 15 minutes?

Q6
Twelve tasks with times and precedence requirements as shown in the following
table, are to be assigned to workstations using a cycle time of 1.5 minutes. Heuristic
rule Assign the task with the most followers will be tried. The tie breaker will be
heuristic rule Assign the task with the longest time.
Task Duration Follows Task
(Minutes)
A .1 --
B .2 A
C .9 B
D .6 C
E .1 --
F .2 D,E
G .4 F
H .1 G
I .2 H
J .7 I
K .3 J
L .2 5

You might also like