Beruflich Dokumente
Kultur Dokumente
Outline Hierarchy of Production Decisions MRP and its importance Input and Output of an MRP system MRP Calculation Lot Sizing Lot Sizing with Capacity Constraint 1
550
790
Back slats
Seat cushion
Leg supports
Seat-frame boards
Back legs
Front legs
10
11
12
Orders
Forecasts
Inventory file
To Production
Reports
To Purchasing 14
15
16
Level 1
Level 2
Level 3
17
Bill of Materials
Item B C D E
BILL OF MATERIALS Product Description: Ladder-back chair Item: A Component Quantity Source Required Description Ladder-back 1 Manufacturing Front legs 2 Purchase Leg supports 4 Purchase Seat 1 Manufacturing
18
Bill of Materials
Item H I
BILL OF MATERIALS Product Description: Seat Item: E Component Quantity Required Description Seat frame 1 Seat cushion 1
19
25 50
2 3
75
20
MRP Calculation
Now, the MRP calculation will be demonstrated with an example. Suppose that 150 units of ladder-back chair is required. The previous slide shows a product structure tree with seat subassembly, seat frames, and seat frame boards. For each of the above components, the previous slide also shows the number of units on hand. The net requirement is computed from top to bottom. Since 150 units of ladder-back chair is required, and since 1 unit of seat subassembly is required for each unit of ladder-back chair, the gross requirement of seatsubassembly is 1501 =150 units. Since there are 25 units of seat-subassembly in the inventory, the net requirement of the seat-subassembly is 150-25 = 125 21
MRP Calculation
units. Since 1 unit of seat frames is required for each unit of seat subassembly, the gross requirement of the seat frames is 1251 = 125 units. (Note that although it follows from the product structure tree that 1 unit of seat frames is required for each unit of ladder-back chair, the gross requirement of seat frames is not 150 units because each of the 25 units of seat-subassembly also contains 1 unit of seat frames.) Since there are 50 units of seat frames in the inventory, the net requirement of the seat frames is 125-50 = 75 units. The detail computation is shown in the next two slides. A similar logic is used to compute the time of order placement. 22
MRP Calculation
Units 150 25
Quantity of ladder-back chairs to be produced Gross requirement, seat subassembly Less seat subassembly in inventory Net requirement, seat subassembly Gross requirement, seat frames Less seat frames in inventory Net requirement, seat frames Gross requirement, seat frame boards Less seat frame boards in inventory Net requirement, seat frame boards
50
75
Assume that 150 units of ladder-back chairs are to be produced at the end of week 15 23
Assume that 150 units of ladder-back chairs are to be produced at the end of week 15 and that there is a one-week lead time for ladder-back chair assembly 24
25
MRP Calculation
Example 1: Each unit of A is composed of one unit of B, two units of C, and one unit of D. C is composed of two units of D and three units of E. Items A, C, D, and E have on-hand inventories of 20, 10, 20, and 10 units, respectively. Item B has a scheduled receipt of 10 units in period 1, and C has a scheduled receipt of 50 units in Period 1. Lot-for-lot (L4L) is used for Items A and B. Item C requires a minimum lot size of 50 units. D and E are required to be purchased in multiples of 100 and 50, respectively. Lead times are one period for Items A, B, and C, and two periods for Items D and E. The gross requirements for A are 30 in Period 2, 30 in Period 5, and 40 in Period 8. Find the planned order releases for all items. 26
MRP Calculation
Level 0
Level 1
Level 2
27
MRP Calculation
Period 1 Item Gross Requirements A Scheduled receipts LT= On hand from prior period Net requirements Q= Time-phased Net Requirements Planned order releases Planned order delivery 2 3 4 5 6 7 8 9 10
28
MRP Calculation
Period 1 2 3 Item Gross 30 Requirements A Scheduled receipts LT= On hand from 20 prior period 1 Net WK requirements Q= Time-phased Net Requirements L4L Planned order releases Planned order delivery All the information above are given. 4 5
30
8
40
10
29
MRP Calculation
Period 1 2 3 4 5 6 Item Gross 30 30 Requirements A Scheduled receipts LT= On hand from 20 20 prior period 1 Net WK requirements -Q= Time-phased Net Requirements L4L Planned order releases Planned order delivery 20 units are just transferred from Period 1 to 2. 7 8
40
10
30
MRP Calculation
Period 1 2 3 4 5 6 7 8 9 10 Item Gross 30 30 40 Requirements A Scheduled receipts LT= On hand from 20 20 prior period 1 Net WK requirements -- 10 Q= Time-phased Net 10 Requirements L4L Planned order 10 releases Planned order 10 delivery 31 in week 1. The net requirement of 30-20=10 units must be ordered
MRP Calculation
Period 1 2 3 4 5 6 Item Gross 30 30 Requirements A Scheduled receipts LT= On hand from 20 20 0 0 0 prior period 1 Net WK requirements -- 10 Q= Time-phased Net 10 Requirements L4L Planned order 10 releases Planned order 10 delivery On hand in week 3 is (20+10)-30=0 unit. 7 8
40
10
32
MRP Calculation
Period 1 2 3 4 5 6 7 8 9 10 Item Gross 30 30 40 Requirements A Scheduled receipts LT= On hand from 20 20 0 0 0 prior period 1 Net 30 WK requirements -- 10 Q= Time-phased Net 30 10 Requirements L4L Planned order 30 10 releases Planned order 10 30 delivery 33in week 4. The net requirement of 30-0=30 units must be ordered
MRP Calculation
Period 1 2 3 4 5 6 7 8 9 10 Item Gross 30 30 40 Requirements A Scheduled receipts LT= On hand from 20 20 0 0 0 0 0 0 prior period 1 Net 30 40 WK requirements -- 10 Q= Time-phased Net 30 40 10 Requirements L4L Planned order 30 40 10 releases Planned order 10 30 40 delivery 34in week 7. The net requirement of 40-0=30 units must be ordered
MRP Calculation
Period 1 2 3 4 5 6 7 8 9 10 Item Gross 30 30 40 Requirements A Scheduled receipts LT= On hand from 20 20 0 0 0 0 0 0 0 0 prior period 1 Net 30 40 WK requirements -- 10 Q= Time-phased Net 30 40 10 Requirements L4L Planned order 30 40 10 releases Planned order 10 30 40 delivery 35in week 7. The net requirement of 40-0=30 units must be ordered
MRP Calculation
Period 1 Item Gross Requirements B Scheduled receipts LT= On hand from prior period Net requirements Q= Time-phased Net Requirements Planned order releases Planned order delivery 2 3 4 5 6 7
Exercise
8 9 10
36
MRP Calculation
Period 1 Item Gross Requirements C Scheduled receipts LT= On hand from prior period Net requirements Q= Time-phased Net Requirements Planned order releases Planned order delivery 2 3 4 5 6 7
Exercise
8 9 10
37
MRP Calculation
Period 1 Item Gross Requirements D Scheduled receipts LT= On hand from prior period Net requirements Q= Time-phased Net Requirements Planned order releases Planned order delivery 2 3 4 5 6 7
Exercise
8 9 10
38
MRP Calculation
Period 1 Item Gross Requirements E Scheduled receipts LT= On hand from prior period Net requirements Q= Time-phased Net Requirements Planned order releases Planned order delivery 2 3 4 5 6 7
Exercise
8 9 10
39
40
Lot-Sizing
In Lesson 21 We employ lot for lot ordering policy and order production as much as it is needed. Exception are only the cases in which there are constraints on the order quantity. For example, in one case we assume that at least 50 units must be ordered. In another case we assume that the order quantity must be a multiple of 50. The motivation behind using lot for lot policy is minimizing inventory. If we order as much as it is needed, there will be no ending inventory at all!
42
Lot-Sizing
However, lot for lot policy requires that an order be placed each period. So, the number of orders and ordering cost are maximum. So, if the ordering cost is significant, one may naturally try to combine some lots into one in order to reduce the ordering cost. But then, inventory holding cost increases. Therefore, a question is what is the optimal size of the lot? How many periods will be covered by the first order, the second order, and so on until all the periods in the planning horizon are covered. This is the question of lot sizing. The next slide contains the statement of the lot sizing problem.
43
Lot-Sizing
The lot sizing problem is as follows: Given net requirements of an item over the next T periods, T >0, find order quantities that minimize the total holding and ordering costs over T periods. Note that this is a case of deterministic demand. However, the methods learnt in Lessons 11-15 are not appropriate because the demand is not necessarily the same over all periods and the inventory holding cost is only charged on ending inventory of each period
44
Lot-Sizing
Although we consider a deterministic model, keep in mind that in reality the demand is uncertain and subject to change. It has been observed that an optimal solution to the deterministic model may actually yield higher cost because of the changes in the demand. Some heuristic methods give lower cost in the long run. If the demand and/or costs change, the optimal solution may change significantly causing some managerial problems. The heuristic methods may not require such changes in the production plan. The heuristic methods require fewer computation steps and are easier to understand. In this lesson we shall discuss some heuristic methods. The optimization method is discussed in the text, Appendix 7-A, pp 406-410 (not included in the course). 45
Lot-Sizing
Some heuristic methods: Lot-for-Lot (L4L): Order as much as it is needed. L4Lminimizes inventory holding cost, but maximizes ordering cost. EOQ: Every time it is required to place an order, lot size equals EOQ. EOQ method may choose an order size that covers partial demand of a period. For example, suppose that EOQ is 15 units. If the demand is 12 units in period 1 and 10 units in period 2, then a lot size of 15 units covers all of period 1 and only (15-12)=3 units of period 2. So, one does not save the ordering cost of period 2, but carries some 3 units in 46
Lot-Sizing
Some heuristic methods: the inventory when that 3 units are required in period 2. This is not a good idea because if an order size of 12 units is chosen, one saves on the holding cost without increasing the ordering cost! So, whats the mistake? Generally, if the order quantity covers a period partially, one can save on the holding cost without increasing the ordering cost. The next three methods, SilverMeal heuristic, least unit cost and part period balancing avoid order quantities that cover a period partially. These methods always choose an order quantity that covers some K periods, K >0. Be careful when you compute EOQ. Express both holding cost and demand over the same period. If the holding cost is annual, use annual demand. If the holding cost is weekly, use weekly demand.
47
Lot-Sizing
Some heuristic methods: Silver-Meal Heuristic As it is discussed in the previous slide, Silver-Meal heuristic chooses a lot size that equals the demand of some K periods in future, where K>0. If K =1, the lot size equals the demand of the next period. If K =2, the lot size equals the demand of the next 2 periods. If K =3, the lot size equals the demand of the next 3 periods, and so on. The average holding and ordering cost per period is computed for each K=1, 2, 3, etc. starting from K=1 and increasing K by 1 until the average cost per period starts increasing. The best K is the last one up to which the average cost per period decreases.
48
Lot-Sizing
Some heuristic methods: Least Unit Cost (LUC) As it is discussed before, least unit cost heuristic chooses a lot size that equals the demand of some K periods in future, where K>0. The average holding and ordering cost per unit is computed for each K=1, 2, 3, etc. starting from K=1 and increasing K by 1 until the average cost per unit starts increasing. The best K is the last one up to which the average cost per unit decreases. Observe how similar is Silver-Meal heuristic and least unit cost heuristic. The only difference is that Silver-Meal heuristic chooses K on the basis of average cost per period and least unit cost on average cost per unit. 49
Lot-Sizing
Some heuristic methods: Part Period Balancing As it is discussed before, part period balancing heuristic chooses a lot size that equals the demand of some K periods in future, where K>0. Holding and ordering costs are computed for each K=1, 2, 3, etc. starting from K=1 and increasing K by 1 until the holding cost exceeds the ordering cost. The best K is the one that minimizes the (absolute) difference between the holding and ordering costs. Note the similarity of this method with the SilverMeal heuristic and least unit cost heuristic. Part period balancing heuristic chooses K on the basis of the (absolute) difference between the holding and ordering costs. 50
Lot-Sizing
Some important notes Inventory costs are computed on the ending inventory. L4L minimizes carrying cost Silver-Meal Heuristic, LUC and Part Period Balancing are similar Silver-Meal Heuristic and LUC perform best if the costs change over time Part Period Balancing perform best if the costs do not change over time The problem extended to all items is difficult to solve
51
Lot-Sizing
Example 2: The MRP gross requirements for Item A are shown here for the next 10 weeks. Lead time for A is three weeks and setup cost is $10. There is a carrying cost of $0.01 per unit per week. Beginning inventory is 90 units. Week 1 2 3 4 5 Gross requirements Week 30 6 50 7 10 8 20 9 70 10 Gross requirements 80 20 60 200 50
52
Lot-Sizing: Lot-for-Lot
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 Inventory Net 0 0 0 20 Requirements Time-phased Net Requirements Planned order Release Planned Deliveries Ending 60 10 0 Inventory Use the above table to compute ending inventory of53 various periods.
Lot-Sizing: Lot-for-Lot
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 Inventory Net 0 0 0 20 Requirements Time-phased Net 20 Requirements Planned order Release Planned Deliveries Ending 60 10 0 Inventory Week 4 net requirement = 20 > 0. So, an order is required. 54
Lot-Sizing: Lot-for-Lot
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 Inventory Net 0 0 0 20 Requirements Time-phased Net 20 Requirements Planned order 20 Release Planned 20 Deliveries Ending 60 10 0 Inventory A delivery of 20 units is planned for the 4th period.. 55
Lot-Sizing: Lot-for-Lot
Exercise
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 0 Inventory Net 0 0 0 20 70 Requirements Time-phased Net 20 Requirements Planned order 20 Release Planned 20 Deliveries Ending 60 10 0 0 Inventory The net requirement of the 5th period is 70 periods. 56
Lot-Sizing: EOQ
First, compute EOQ Annual demand is not given. Annual demand is estimated from the known demand of 10 weeks. Estimated annual demand, Total demand over 10 weeks = 52 weeks/yea r 10 30 + 50 + 10 + 20 + 70 + 80 + 20 + 60 + 200 + 50 = 52 10 590 = 52 10 = 3,068 units/year Compute annual holding cost per unit h = $0.01/unit/week = $0.52/unit /year
57
Lot-Sizing: EOQ
First, compute EOQ = 3,068 units/year K = $10 /order h = $0.52 /unit/year 2 K 2 10 3,068 EOQ = = = 343.51 344 units h 0.52 Therefore, whenever it will be necessary to place an order, the order size will be 344 units. This will now be shown in more detail.
58
Lot-Sizing: EOQ
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 Inventory Net 0 0 0 20 Requirements Time-phased Net Requirements Planned order Release Planned Deliveries Ending 60 10 0 Inventory Use the above table to compute ending inventory of59 various periods.
Lot-Sizing: EOQ
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 Inventory Net 0 0 0 20 Requirements Time-phased Net 20 Requirements Planned order Release Planned Deliveries Ending 60 10 0 Inventory Week 4 net requirement = 20 > 0. So, an order is required. 60
Lot-Sizing: EOQ
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 Inventory Net 0 0 0 20 Requirements Time-phased Net 20 Requirements Planned order 344 Release Planned 344 Deliveries Ending 60 10 0 Inventory Order size = EOQ = 344, whenever it is required to61 place an order.
Lot-Sizing: EOQ
Exercise
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 324 Inventory Net 0 0 0 20 Requirements Time-phased Net 20 Requirements Planned order 344 Release Planned 344 Deliveries Ending 60 10 0 324 Inventory Week 5 b. inv=344-20=324>70= gross req. So, no order 62 is required.
Lot-Sizing: Silver-Meal-Heuristic
j rj Order for weeks 1 week, week 4 2 weeks, weeks 4 to 5 3 weeks, weeks 4 to 6 4 weeks, weeks 4 to 7 5 weeks, weeks 4 to 8 6 weeks, weeks 4 to 9 7 weeks, weeks 4 to 10 1 2 3 4 5 6 7 20 70 80 20 60 200 50 Units in the inventory at the end of Week Q 4 5 6 7 8 9 10
The order is placed for K periods, for some K>0. Use the above table to find K. 63
Lot-Sizing: Silver-Meal-Heuristic
j rj Order for weeks 1 week, week 4 2 weeks, weeks 4 to 5 3 weeks, weeks 4 to 6 4 weeks, weeks 4 to 7 5 weeks, weeks 4 to 8 6 weeks, weeks 4 to 9 7 weeks, weeks 4 to 10 1 2 3 4 5 6 7 20 70 80 20 60 200 50 Units in the inventory at the end of Week Q 4 5 6 7 8 9 10
20
0.00 10 10.0
If K=1, order is placed for 1 week and the order size = 20. Then, the ending inventory = inventory holding cost =0. The order cost = $10. 64 Average cost per period = (0+10)/1=$10.
20 90 70
If K=2, order is placed for 2 weeks and the order size = 20+70=90. Then, inventory at the end of week 4 = 90-20=70 and holding cost 65 =70 0.01. = 0.70. Average cost per period = (0.70+10)/2=$5.35.
Lot-Sizing: Silver-Meal-Heuristic
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 Inventory Net 0 0 0 20 Requirements Time-phased Net Requirements Planned order Release Planned Deliveries Ending 60 10 0 Inventory Use the above table to compute ending inventory of66 various periods.
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 Inventory Net 0 0 0 20 Requirements Time-phased Net 20 Requirements Planned order Release Planned Deliveries Ending 60 10 0 Inventory Week 4 net requirement = 20 > 0. So, an order is required. 67
The order is placed for K periods, for some K>0. Use the above table to find K. 68
20
0.00 10 .500
If K=1, order is placed for 1 week and the order size = 20. Then, the ending inventory = inventory holding cost =0. The order cost = $10. 69 Average cost per unit = (0+10)/20=$0.50
20 90 70
If K=2, order is placed for 2 weeks and the order size = 20+70=90. Then, inventory at the end of week 4 = 90-20=70 and holding cost 70 =70 0.01. = 0.70. Average cost per unit = (0.70+10)/90=$0.119.
Period 1 2 3 4 5 6 7 8 9 10 Gross 30 50 10 20 70 80 20 60 200 50 Requirements Beginning 90 60 10 0 Inventory Net 0 0 0 20 Requirements Time-phased Net 20 Requirements Planned order Release Planned Deliveries Ending 60 10 0 Inventory Week 4 net requirement = 20 > 0. So, an order is required. 72
Exercise
j rj Order for weeks 1 week, week 4 2 weeks, weeks 4 to 5 3 weeks, weeks 4 to 6 4 weeks, weeks 4 to 7 5 weeks, weeks 4 to 8 6 weeks, weeks 4 to 9 7 weeks, weeks 4 to 10
Diff
The order is placed for K periods, for some K>0. Use the above table to find K. 73
j rj Order for weeks 1 week, week 4 2 weeks, weeks 4 to 5 3 weeks, weeks 4 to 6 4 weeks, weeks 4 to 7 5 weeks, weeks 4 to 8 6 weeks, weeks 4 to 9 7 weeks, weeks 4 to 10
200 250
70 150 80 170 100 20 230 160 80 60 430 360 280 260 200 NOT COMPUTED 50
Diff
10 10 10 10 10 10
The above computation is similar to that of the Silver-Meal heuristic. The primary difference is that the (absolute) difference between 74 holding and ordering cost is shown in the last column.
Cost Comparison
Lot-for-Lot See the last slide entitled lot-sizing: lot-for-lot Number of orders: 7 Ordering cost = 7 $10/order = $70 Holding cost = (60+10) $0.01/unit/week = $0.70 Total cost = 70+0.70 =$70.70 EOQ See the last slide entitled lot-sizing: EOQ Number of orders: 2 Ordering cost = 2 $10/order = $20 Holding cost = (60 +10 +324 +254 +174 +154 +94 +237 +187) $0.01/unit/week = $14.94 Total cost = 20+14.94 =$34.94 77
Cost Comparison
Silver-Meal Heuristic See the last slide entitled lot-sizing: Silver-Meal heuristic Number of orders: 2 Ordering cost = 2 $10/order = $20 Holding cost = (60 +10 +230 +160 +80 +60 +50) $0.01/unit/week = $6.50 Total cost = 20+6.50 =$26.50 Least Unit Cost See the last slide entitled lot-sizing: least unit cost Number of orders: 2 Ordering cost = 2 $10/order = $20 Holding cost = (60 +10 +430 +360 +280 +260 +200) $0.01/unit/week = $16.00 Total cost = 20+16.00 =$36.00 78
Cost Comparison
Part-Period Balancing See the last slide entitled lot-sizing: part-period balancing Number of orders: 2 Ordering cost = 2 $10/order = $20 Holding cost = (60 +10 +230 +160 +80 +60 +50) $0.01/unit/week = $6.50 Total cost = 20+6.50 =$26.50 Conclusion: In this particular case, Silver-Meal heuristic and part period balancing yield the least total holding and ordering cost of $26.50 over the planning period of 10 weeks. 79
80
LESSON 10: MATERIAL REQUIREMENTS PLANNING: LOT SIZING WITH CAPACITY CONSTRAINTS
Outline Lot Sizing with Capacity Constraints Order Partial Requirements Checking Feasibility Lot Shifting Technique An Improvement Procedure
81
83
84
86
Checking Feasibility
As it was discussed before, sometimes capacity may be so low that it may not be possible to meet the demand of all periods. So, given demand over the planning horizon and the corresponding capacity constraints, we ask if there exists a feasible solution that meets all the demand. This is the feasibility problem. The procedure is stated in the next slide and then the procedure is illustrated with an example.
87
Checking Feasibility
Procedure to check feasibility: For every period, compute the cumulative requirement and the cumulative capacity. If for every period, the cumulative capacity is larger than (or equal to) the cumulative requirement, then there exists a feasible solution. Else, if there is a period in which cumulative capacity is smaller than the cumulative requirement, then there will be a shortage in that period, and, therefore, there is no feasible solution. 88
Checking Feasibility
Example 4 Production Requirement June 10 July 14 August 15 September 16
Production Capacity 15 11 12 17
Checking Feasibility
Production Production Requirement Cumulative Capacity Cumulative June 10 10 15 15 July 14 24 11 26 August 15 39 12 38 September 16 55 17 55 Answer: The August requirement cannot be met even after full production in June, July and August. Hence, it is not possible to meet the production requirements of all the months. 90
91
92
Production Capacity 30 13 13 17
93
Rule: Find the first period with less capacity. The first period with shortage is July when the capacity = 13 < 14 = production requirement.
94
July production requirement is 14 units which is 1 unit more than the capacity of 13 unit. So, this 1 unit must be produced in some earlier month. There is only one month before July. 95
Rule: Back-shift the excess requirement to prior periods. One unit excess demand of July is back-shifted to June. So, the June production is 10+1=11 units. 96
97
98
An Improvement Procedure
Now, a procedure will be discussed that can sometimes find an alternative production plan that may reduce the total holding and ordering cost over the planning horizon. Keep in mind that it is guaranteed that whenever, there is an improved plan, the procedure will be able to identify that plan. Sometimes, the procedure may fail to identify an improved plan, although there may actually exist one.
99
An Improvement Procedure
Example 6 Production Requirement June 13 July 13 August 13 September 16
Production Capacity 30 13 13 17
An Improvement Procedure
Production Capacity 30 13 13 17
Improvement procedure: Start from the last period and work backwards. In each iteration, back-shift all units of the period under consideration to one or more previous periods if additional holding cost is less than the ordering cost saved.
101
An Improvement Procedure
Improvement procedure: Start from the last period and work backwards. In each iteration, back-shift all units of the period under consideration to one or more previous periods if additional holding cost is less than the ordering cost saved.
102
An Improvement Procedure
Back-shift September production to June? Additional holding cost = (16)(2)(3) =$96 > 50 = K So, do not back-shift September production to June. 103
An Improvement Procedure
Back-shift August production to June? Additional holding cost = (13)(2)(2) =$52 > 50 = K So, do not back-shift August production to June. 104
An Improvement Procedure
Back-shift July production to June? Additional holding cost = (13)(2)(1) =$26 < 50 = K So, yes, back-shift July production to June. 105
An Improvement Procedure
Final Plan The above is the result of the improvement procedure. 106
107
108
Just-in-time
Producing only what is needed and when it is needed A philosophy An integrated management system
109
Just-in-time
Theme: eliminate all waste including the ones caused by: inventory management supplier selection defective parts scheduling of production and delivery information system
110
Examples Of Waste
Watching a machine run Waiting for parts Counting parts Overproduction Moving parts over long distances Storing inventory Looking for tools Machine breakdown Rework 111
1. 2. 3. 4. 5. 6. 7. 8. 9.
Focused factory networks Grouped Technology: Cellular layouts Quality at the source Flexible resources Pull production system Kanban production control Small-lot production and purchase Quick setups Supplier networks
112
Cellular Layouts
Group dissimilar machines in a cell to produce a family of parts Reduce setup time and transit time Send work in one direction through the cell (resembling a small assembly line) Adjust cycle time by changing worker paths
113
Cellular Layouts
Machines Enter Worker 2 Worker 1 Exit Key: Product route Worker route 114
Worker 3
Parts A B C D E F G H
1 2 3 4 x x x x x x x x x x
Machines 5 6 7 8 9 10 11 12 x x x x x x x x x x x x x x x x x x x x
116
Machines Parts 1 2 4 3 5 6 7 8 9 10 11 12 A x x x x x B x x x x C x x x D x x x x x E x x x F x x x G x x x x H x x x
117
Machines Parts 1 2 4 3 5 6 7 8 9 10 11 12 A x x x x x D x x x x x B x x x x C x x x E x x x F x x x G x x x x H x x x
118
Parts A D B C E F G H
1 x x
Machines 2 4 8 3 5 6 7 9 10 11 12 x x x x x x x x x x x x x x x x x x x x x x x x x x x
119
Parts A D F B C E G H
1 2 4 8 x x x x x x x x x x x
Machines 3 5 6 7 9 10 11 12 x x x x x x x x x x
120
x x x
x x x x
Parts A D F B C E G H
1 x x x
Machines 2 4 8 10 3 5 6 7 9 11 12 x x x x x x x x x x x x x x x x x x x x x x x x x x x
121
Parts A D F C G B E H
1 x x x
Machines 2 4 8 10 3 6 9 5 7 11 12 x x x x x x x x x x x x x x x x x x x x x x x x x x x
122
Raw materials
124
125
126
Kaizen
Continuous improvement Requires total employment involvement The essence of JIT is the willingness of workers to spot quality problems, halt production when necessary, generate ideas for improvement, analyze problems, and perform different functions
127
Flexible Resources
Multifunctional workers General purpose machines Study operators & improve operations
128
Flexible Resources
129
Flexible Resources
Cell 1 Worker 1
Cell 2 Worker 2
131
A kanban is a card that indicates quantity of production Kanbans maintain the discipline of pull production - A production kanban authorizes production - A withdrawal kanban authorizes the movement of goods
132
133
A Single-Kanban System
134
135
136
A Two-Card System
1. When the number of tickets on the withdrawal kanban reaches a predetermined level, a worker takes these tickets to the store location. 2. The workers compares the part number on the production ordering kanban at the store with the part number on the withdrawal kanban. 3. The worker removes the production ordering kanban from the containers, places them on the production ordering kanban post, and places the withdrawal kanbans in the containers. 4. When a specified number of production ordering kanbans have accumulated, work center 1 proceeds with production. 137
5. The worker transports parts picked up at the store to work center 2 and places them in a holding area until they are required for production. 6. When the parts enter production at work center 2, the worker removes the withdrawal kanbans and places them on the withdrawal kanban post.
138
Kanban Squares
X X X
Kanban Racks
407 409 410 412
408 411
Signal Kanban
407 408 409
407
408
409
72
73
74
75
76
77
78
79 86
80
81
82
83
84
85
87
88
89
90 97
91
92
93
94
95
96
98
99
100
101
102
103
104
105
106
Types Of Kanbans
Kanban Square marked area designed to hold items Signal Kanban triangular kanban used to signal production at the previous workstation Material Kanban used to order material in advance of a process Supplier Kanban rotates between the factory and supplier
Small-Lot Production
Requires less space & capital investment Moves processes closer together Makes quality problems easier to detect Makes processes more dependent on each other
146
147
148
149
Benefits Of JIT
1. 2. 3. 4. Reduced inventory Improved quality Lower costs Reduced space requirements 5. Shorter lead time 6. Increased productivity 7. 8. Greater flexibility Better relations with suppliers 9. Simplified scheduling and control activities 10. Increased capacity 11. Better use of human resources 12. More product variety 150
151