Production Planning Solution Techniques Part 1 MRP, MRP-II
|
|
|
- Roderick Barton
- 8 years ago
- Views:
Transcription
1 Production Planning Solution Techniques Part 1 MRP, MRP-II Mads Kehlet Jepsen Production Planning Solution Techniques Part 1 MRP, MRP-II p.1/31
2 Overview Production Planning Solution Techniques Part 1 MRP, MRP-II p.2/31
3 Overview Material Requirement Planning(MRP) Production Planning Solution Techniques Part 1 MRP, MRP-II p.2/31
4 Overview Material Requirement Planning(MRP) MRP Procedure Production Planning Solution Techniques Part 1 MRP, MRP-II p.2/31
5 Overview Material Requirement Planning(MRP) MRP Procedure Issues with MRP Production Planning Solution Techniques Part 1 MRP, MRP-II p.2/31
6 Overview Material Requirement Planning(MRP) MRP Procedure Issues with MRP Manufacturing Resource Planning MRP II Production Planning Solution Techniques Part 1 MRP, MRP-II p.2/31
7 Overview Material Requirement Planning(MRP) MRP Procedure Issues with MRP Manufacturing Resource Planning MRP II Time driven Rough-Cut Capacity Planning Production Planning Solution Techniques Part 1 MRP, MRP-II p.2/31
8 Overview Material Requirement Planning(MRP) MRP Procedure Issues with MRP Manufacturing Resource Planning MRP II Time driven Rough-Cut Capacity Planning Heuristic for Time driven Rough-Cut Capacity Planning Production Planning Solution Techniques Part 1 MRP, MRP-II p.2/31
9 Overview Material Requirement Planning(MRP) MRP Procedure Issues with MRP Manufacturing Resource Planning MRP II Time driven Rough-Cut Capacity Planning Heuristic for Time driven Rough-Cut Capacity Planning Neighborhood for Time driven Rough-Cut Capacity Planning Production Planning Solution Techniques Part 1 MRP, MRP-II p.2/31
10 Material Requirement Planning(MRP) Production Planning Solution Techniques Part 1 MRP, MRP-II p.3/31
11 Material Requirement Planning(MRP) Originally system was based on reorder point. Production Planning Solution Techniques Part 1 MRP, MRP-II p.3/31
12 Material Requirement Planning(MRP) Originally system was based on reorder point. Reorder point is suited for independent demand. Production Planning Solution Techniques Part 1 MRP, MRP-II p.3/31
13 Material Requirement Planning(MRP) Originally system was based on reorder point. Reorder point is suited for independent demand. But not for dependent demand. Production Planning Solution Techniques Part 1 MRP, MRP-II p.3/31
14 Material Requirement Planning(MRP) Originally system was based on reorder point. Reorder point is suited for independent demand. But not for dependent demand. MRP works backwards from independent demand to derive a schedule. Production Planning Solution Techniques Part 1 MRP, MRP-II p.3/31
15 Material Requirement Planning(MRP) Originally system was based on reorder point. Reorder point is suited for independent demand. But not for dependent demand. MRP works backwards from independent demand to derive a schedule. MRP is called a push system since it pushes items in the production chain. Production Planning Solution Techniques Part 1 MRP, MRP-II p.3/31
16 Overview of MRP Production Planning Solution Techniques Part 1 MRP, MRP-II p.4/31
17 Overview of MRP External orders is called Purchase orders. Production Planning Solution Techniques Part 1 MRP, MRP-II p.4/31
18 Overview of MRP External orders is called Purchase orders. Internal orders is called Jobs. Production Planning Solution Techniques Part 1 MRP, MRP-II p.4/31
19 Overview of MRP External orders is called Purchase orders. Internal orders is called Jobs. Time is divided into buckets. Production Planning Solution Techniques Part 1 MRP, MRP-II p.4/31
20 Overview of MRP External orders is called Purchase orders. Internal orders is called Jobs. Time is divided into buckets. The bill of material(bom) describes relationship Production Planning Solution Techniques Part 1 MRP, MRP-II p.4/31
21 Overview of MRP External orders is called Purchase orders. Internal orders is called Jobs. Time is divided into buckets. The bill of material(bom) describes relationship The routing describes the work processes. Production Planning Solution Techniques Part 1 MRP, MRP-II p.4/31
22 Schematic of MRP Production Planning Solution Techniques Part 1 MRP, MRP-II p.5/31
23 MRP Inputs and Outputs Production Planning Solution Techniques Part 1 MRP, MRP-II p.6/31
24 MRP Inputs and Outputs Master Production Schedule: Production Planning Solution Techniques Part 1 MRP, MRP-II p.6/31
25 MRP Inputs and Outputs Master Production Schedule: Item, Quantity and due dates. Production Planning Solution Techniques Part 1 MRP, MRP-II p.6/31
26 MRP Inputs and Outputs Master Production Schedule: Item, Quantity and due dates. Erp Database: Production Planning Solution Techniques Part 1 MRP, MRP-II p.6/31
27 MRP Inputs and Outputs Master Production Schedule: Item, Quantity and due dates. Erp Database: BOM, Routing, lot-sizing rule(lsr), lead time(plt) and On-Hand Inventory. Production Planning Solution Techniques Part 1 MRP, MRP-II p.6/31
28 MRP Inputs and Outputs Master Production Schedule: Item, Quantity and due dates. Erp Database: BOM, Routing, lot-sizing rule(lsr), lead time(plt) and On-Hand Inventory. Scheduled Receipts: Out standing orders and Jobs. Work in process. Production Planning Solution Techniques Part 1 MRP, MRP-II p.6/31
29 MRP Inputs and Outputs Master Production Schedule: Item, Quantity and due dates. Erp Database: BOM, Routing, lot-sizing rule(lsr), lead time(plt) and On-Hand Inventory. Scheduled Receipts: Out standing orders and Jobs. Work in process. MRP outputs: Planned order release, Change notices and Exception reports. Production Planning Solution Techniques Part 1 MRP, MRP-II p.6/31
30 MRP Procedure Production Planning Solution Techniques Part 1 MRP, MRP-II p.7/31
31 MRP Procedure T is the number of time periods. Production Planning Solution Techniques Part 1 MRP, MRP-II p.7/31
32 MRP Procedure T is the number of time periods. D t gross requirements (demand) for period t Production Planning Solution Techniques Part 1 MRP, MRP-II p.7/31
33 MRP Procedure T is the number of time periods. D t gross requirements (demand) for period t S t quantity currently scheduled to complete in period t Production Planning Solution Techniques Part 1 MRP, MRP-II p.7/31
34 MRP Procedure T is the number of time periods. D t gross requirements (demand) for period t S t quantity currently scheduled to complete in period t I t Projected on-hand inventory in period t Production Planning Solution Techniques Part 1 MRP, MRP-II p.7/31
35 MRP Procedure T is the number of time periods. D t gross requirements (demand) for period t S t quantity currently scheduled to complete in period t I t Projected on-hand inventory in period t N t net requirements for period t Production Planning Solution Techniques Part 1 MRP, MRP-II p.7/31
36 MRP Procedure: Netting Production Planning Solution Techniques Part 1 MRP, MRP-II p.8/31
37 MRP Procedure: Netting 1. Compute I t = I t 1 D t t Production Planning Solution Techniques Part 1 MRP, MRP-II p.8/31
38 MRP Procedure: Netting 1. Compute I t = I t 1 D t t 2. Find t m = {min 1 t T : I t < 0} Production Planning Solution Techniques Part 1 MRP, MRP-II p.8/31
39 MRP Procedure: Netting 1. Compute I t = I t 1 D t t 2. Find t m = {min 1 t T : I t < 0} 3. If the first SR has t > t m. Generate Change Notice and adjust SR and S t. Production Planning Solution Techniques Part 1 MRP, MRP-II p.8/31
40 MRP Procedure: Netting 1. Compute I t = I t 1 D t t 2. Find t m = {min 1 t T : I t < 0} 3. If the first SR has t > t m. Generate Change Notice and adjust SR and S t. Continue until I m > 0 or no more SRs. Production Planning Solution Techniques Part 1 MRP, MRP-II p.8/31
41 MRP Procedure: Netting 1. Compute I t = I t 1 D t t 2. Find t m = {min 1 t T : I t < 0} 3. If the first SR has t > t m. Generate Change Notice and adjust SR and S t. Continue until I m > 0 or no more SRs. 4. Adjust projected on-hand inventory to I t = I t + S t Production Planning Solution Techniques Part 1 MRP, MRP-II p.8/31
42 MRP Procedure: Netting 1. Compute I t = I t 1 D t t 2. Find t m = {min 1 t T : I t < 0} 3. If the first SR has t > t m. Generate Change Notice and adjust SR and S t. Continue until I m > 0 or no more SRs. 4. Adjust projected on-hand inventory to I t = I t + S t 5. Find t = {t I t < 0} Production Planning Solution Techniques Part 1 MRP, MRP-II p.8/31
43 MRP Procedure: Netting 1. Compute I t = I t 1 D t t 2. Find t m = {min 1 t T : I t < 0} 3. If the first SR has t > t m. Generate Change Notice and adjust SR and S t. Continue until I m > 0 or no more SRs. 4. Adjust projected on-hand inventory to I t = I t + S t 5. Find t = {t I t < 0} Net requirement follows as: N t = 0 t < t I t t = t t > t D t Production Planning Solution Techniques Part 1 MRP, MRP-II p.8/31
44 Netting example Gross requierments Scheduled receipts Adjusted SRs Projected on-hand 20 Net requirements Production Planning Solution Techniques Part 1 MRP, MRP-II p.9/31
45 Netting example Gross requierments Scheduled receipts Adjusted SRs Projected on-hand 20 5 Net requirements I 1 = D 1 I 0 = 5 Production Planning Solution Techniques Part 1 MRP, MRP-II p.9/31
46 Netting example Gross requierments Scheduled receipts Adjusted SRs 20 Projected on-hand 20 5 Net requirements I 1 = D 1 I 0 = 5 I 1 > 0 Adjust S 1. S 2 = S 2 + S 1 = 20 Production Planning Solution Techniques Part 1 MRP, MRP-II p.9/31
47 Netting example Gross requierments Scheduled receipts Adjusted SRs 20 Projected on-hand Net requirements I 1 = D 1 I 0 = 5 I 1 > 0 Adjust S 1. S 2 = S 2 + S 1 = 20 I 2 = I 1 D 2 = 5 20 < 0 I 2 = I 2 + S 2 = = 5 Production Planning Solution Techniques Part 1 MRP, MRP-II p.9/31
48 Netting example Gross requierments Scheduled receipts Adjusted SRs 20 Projected on-hand Net requirements I 1 = D 1 I 0 = 5 I 1 > 0 Adjust S 1. S 2 = S 2 + S 1 = 20 I 2 = I 1 D 2 = 5 20 < 0 I 2 = I 2 + S 2 = = 5 I 3 = I 2 D 3 = 45 Production Planning Solution Techniques Part 1 MRP, MRP-II p.9/31
49 Netting example Gross requierments Scheduled receipts Adjusted SRs 20 Projected on-hand Net requirements 45 I 1 = D 1 I 0 = 5 I 1 > 0 Adjust S 1. S 2 = S 2 + S 1 = 20 I 2 = I 1 D 2 = 5 20 < 0 I 2 = I 2 + S 2 = = 5 I 3 = I 2 D 3 = 45 N 3 = I 3 = 45 Production Planning Solution Techniques Part 1 MRP, MRP-II p.9/31
50 Netting example Gross requierments Scheduled receipts Adjusted SRs 20 Projected on-hand Net requirements I 1 = D 1 I 0 = 5 I 1 > 0 Adjust S 1. S 2 = S 2 + S 1 = 20 I 2 = I 1 D 2 = 5 20 < 0 I 2 = I 2 + S 2 = = 5 I 3 = I 2 D 3 = 45 N 3 = I 3 = 45 N 4 = D 4 = 50 Production Planning Solution Techniques Part 1 MRP, MRP-II p.9/31
51 MRP Procedure continued Production Planning Solution Techniques Part 1 MRP, MRP-II p.10/31
52 MRP Procedure continued Lot sizing: Production Planning Solution Techniques Part 1 MRP, MRP-II p.10/31
53 MRP Procedure continued Lot sizing: Wagner Whitin Production Planning Solution Techniques Part 1 MRP, MRP-II p.10/31
54 MRP Procedure continued Lot sizing: Wagner Whitin lot for lot Production Planning Solution Techniques Part 1 MRP, MRP-II p.10/31
55 MRP Procedure continued Lot sizing: Wagner Whitin lot for lot fixed order period Production Planning Solution Techniques Part 1 MRP, MRP-II p.10/31
56 MRP Procedure continued Lot sizing: Wagner Whitin lot for lot fixed order period Fixed order Quantity and EOQ. Production Planning Solution Techniques Part 1 MRP, MRP-II p.10/31
57 MRP Procedure continued Lot sizing: Wagner Whitin lot for lot fixed order period Fixed order Quantity and EOQ. Part-Period Balancing. Balancing inventory cost and Setup Cost. Production Planning Solution Techniques Part 1 MRP, MRP-II p.10/31
58 MRP Procedure continued Lot sizing: Wagner Whitin lot for lot fixed order period Fixed order Quantity and EOQ. Part-Period Balancing. Balancing inventory cost and Setup Cost. Time fasing. All lead times are considered for items, not for status on floor Production Planning Solution Techniques Part 1 MRP, MRP-II p.10/31
59 MRP Procedure continued Lot sizing: Wagner Whitin lot for lot fixed order period Fixed order Quantity and EOQ. Part-Period Balancing. Balancing inventory cost and Setup Cost. Time fasing. All lead times are considered for items, not for status on floor Bom Explosion. Netting and lot sizing is done for each sub item. Production Planning Solution Techniques Part 1 MRP, MRP-II p.10/31
60 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
61 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
62 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Quantity 1 setup cost Part-Periods Inventory cost Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
63 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Quantity 1 setup cost Part-Periods Inventory cost Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
64 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Quantity 1 setup cost Part-Periods Inventory cost Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
65 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Quantity 1 setup cost Part-Periods Inventory cost Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
66 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Quantity 1 setup cost Part-Periods Inventory cost Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
67 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Quantity 1 setup cost Part-Periods Inventory cost Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
68 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Quantity 1 setup cost Part-Periods Inventory cost Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
69 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Quantity 1 setup cost Part-Periods Inventory cost Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
70 Part Period Balancing Number of items n Number of Periods p the item is carried in the inventory. Part Period cost is n p Example: Period Net Requirements Quantity 1 setup cost Part-Periods Inventory cost Production Planning Solution Techniques Part 1 MRP, MRP-II p.11/31
71 Issues with MRP Production Planning Solution Techniques Part 1 MRP, MRP-II p.12/31
72 Issues with MRP Assume constant lead times. To take care of variation Safety Stock and Safety Lead time is used. Production Planning Solution Techniques Part 1 MRP, MRP-II p.12/31
73 Issues with MRP Assume constant lead times. To take care of variation Safety Stock and Safety Lead time is used. Capacity Infeasibility, there is no capacity check. Production Planning Solution Techniques Part 1 MRP, MRP-II p.12/31
74 Issues with MRP Assume constant lead times. To take care of variation Safety Stock and Safety Lead time is used. Capacity Infeasibility, there is no capacity check. Long Planned Lead time due to variation in delivery time. Production Planning Solution Techniques Part 1 MRP, MRP-II p.12/31
75 Issues with MRP Assume constant lead times. To take care of variation Safety Stock and Safety Lead time is used. Capacity Infeasibility, there is no capacity check. Long Planned Lead time due to variation in delivery time. System Nervousness. Plans that are feasible can become infeasible. Production Planning Solution Techniques Part 1 MRP, MRP-II p.12/31
76 Questians or comments to MRP Are there any questians or comments? Production Planning Solution Techniques Part 1 MRP, MRP-II p.13/31
77 Manufacturing Resource Planning Production Planning Solution Techniques Part 1 MRP, MRP-II p.14/31
78 Manufacturing Resource Planning Address deficiencies in MRP Production Planning Solution Techniques Part 1 MRP, MRP-II p.14/31
79 Manufacturing Resource Planning Address deficiencies in MRP Brings in new functionalities including: Production Planning Solution Techniques Part 1 MRP, MRP-II p.14/31
80 Manufacturing Resource Planning Address deficiencies in MRP Brings in new functionalities including: Production Planning Solution Techniques Part 1 MRP, MRP-II p.14/31
81 Long-Range Planning Production Planning Solution Techniques Part 1 MRP, MRP-II p.15/31
82 Long-Range Planning Forecasting seeks to predict demands of the future. Production Planning Solution Techniques Part 1 MRP, MRP-II p.15/31
83 Long-Range Planning Forecasting seeks to predict demands of the future. Resource Planning. Determines long time capacity need. Is used to decide is knew facilities must be build or old facilities must be expanded. Production Planning Solution Techniques Part 1 MRP, MRP-II p.15/31
84 Long-Range Planning Forecasting seeks to predict demands of the future. Resource Planning. Determines long time capacity need. Is used to decide is knew facilities must be build or old facilities must be expanded. Aggregate Planning. Determines how inventory is build. Do we use overtime or do we carry inventory over a long period. Production Planning Solution Techniques Part 1 MRP, MRP-II p.15/31
85 Intermidiate Planning Production Planning Solution Techniques Part 1 MRP, MRP-II p.16/31
86 Intermidiate Planning Demand management Converts long-term forecast into actual customer orders and forecast of anticipated orders. Production Planning Solution Techniques Part 1 MRP, MRP-II p.16/31
87 Intermidiate Planning Demand management Converts long-term forecast into actual customer orders and forecast of anticipated orders. Available to promise Secures that an order can be meet at a given due date. This can be done by using forward loading. Production Planning Solution Techniques Part 1 MRP, MRP-II p.16/31
88 Intermidiate Planning Demand management Converts long-term forecast into actual customer orders and forecast of anticipated orders. Available to promise Secures that an order can be meet at a given due date. This can be done by using forward loading. Master Production Schedule Generates an anticipated production schedule. Production Planning Solution Techniques Part 1 MRP, MRP-II p.16/31
89 Intermidiate Planning Demand management Converts long-term forecast into actual customer orders and forecast of anticipated orders. Available to promise Secures that an order can be meet at a given due date. This can be done by using forward loading. Master Production Schedule Generates an anticipated production schedule. Rough-cut Planning Provides a schedule where the capacity on critical resources is meet. Production Planning Solution Techniques Part 1 MRP, MRP-II p.16/31
90 Intermidiate Planning Demand management Converts long-term forecast into actual customer orders and forecast of anticipated orders. Available to promise Secures that an order can be meet at a given due date. This can be done by using forward loading. Master Production Schedule Generates an anticipated production schedule. Rough-cut Planning Provides a schedule where the capacity on critical resources is meet. Capacity Requirements Planning Does not preform actual capacity check. CRP assumes infinite capacity on resources. Basically it just calculates finish dates based on fixed lead times. Production Planning Solution Techniques Part 1 MRP, MRP-II p.16/31
91 Short-term control Production Planning Solution Techniques Part 1 MRP, MRP-II p.17/31
92 Short-term control Job release Converts jobs to scheduled receipts. Resolves conflicts if several high-level items uses same low-level item. Production Planning Solution Techniques Part 1 MRP, MRP-II p.17/31
93 Short-term control Job release Converts jobs to scheduled receipts. Resolves conflicts if several high-level items uses same low-level item. Job dispatching Maintains queue in front of each workstation and try to maintain due date. Production Planning Solution Techniques Part 1 MRP, MRP-II p.17/31
94 Short-term control Job release Converts jobs to scheduled receipts. Resolves conflicts if several high-level items uses same low-level item. Job dispatching Maintains queue in front of each workstation and try to maintain due date. Shortest process time Chooses the shortest job Production Planning Solution Techniques Part 1 MRP, MRP-II p.17/31
95 Short-term control Job release Converts jobs to scheduled receipts. Resolves conflicts if several high-level items uses same low-level item. Job dispatching Maintains queue in front of each workstation and try to maintain due date. Shortest process time Chooses the shortest job Earliest due date dispatches job with nearest due date Production Planning Solution Techniques Part 1 MRP, MRP-II p.17/31
96 Short-term control Job release Converts jobs to scheduled receipts. Resolves conflicts if several high-level items uses same low-level item. Job dispatching Maintains queue in front of each workstation and try to maintain due date. Shortest process time Chooses the shortest job Earliest due date dispatches job with nearest due date Least slack Choose job where, the due date minus remaining process time is lowest. Production Planning Solution Techniques Part 1 MRP, MRP-II p.17/31
97 Short-term control Job release Converts jobs to scheduled receipts. Resolves conflicts if several high-level items uses same low-level item. Job dispatching Maintains queue in front of each workstation and try to maintain due date. Shortest process time Chooses the shortest job Earliest due date dispatches job with nearest due date Least slack Choose job where, the due date minus remaining process time is lowest. Least slack per remaining operation Divide slack with number of operation remaining on routing. Production Planning Solution Techniques Part 1 MRP, MRP-II p.17/31
98 Questians or comments to MRP II Are there any questians or comments? Production Planning Solution Techniques Part 1 MRP, MRP-II p.18/31
99 Rough-Cut Capacity Planning(RCCP) Production Planning Solution Techniques Part 1 MRP, MRP-II p.19/31
100 Rough-Cut Capacity Planning(RCCP) Considers aggregated work Production Planning Solution Techniques Part 1 MRP, MRP-II p.19/31
101 Rough-Cut Capacity Planning(RCCP) Considers aggregated work Allocates work in time buckets Production Planning Solution Techniques Part 1 MRP, MRP-II p.19/31
102 Rough-Cut Capacity Planning(RCCP) Considers aggregated work Allocates work in time buckets Determines resources in order to reach due dates Production Planning Solution Techniques Part 1 MRP, MRP-II p.19/31
103 Rough-Cut Capacity Planning(RCCP) Considers aggregated work Allocates work in time buckets Determines resources in order to reach due dates Both regular and nonregular (outsourcing over time etc.) is considered Production Planning Solution Techniques Part 1 MRP, MRP-II p.19/31
104 Rough-Cut Capacity Planning(RCCP) Considers aggregated work Allocates work in time buckets Determines resources in order to reach due dates Both regular and nonregular (outsourcing over time etc.) is considered Time driven RCCP is when project dates must be meet. Production Planning Solution Techniques Part 1 MRP, MRP-II p.19/31
105 Rough-Cut Capacity Planning(RCCP) Considers aggregated work Allocates work in time buckets Determines resources in order to reach due dates Both regular and nonregular (outsourcing over time etc.) is considered Time driven RCCP is when project dates must be meet. In resource-driven RCCP only regular capacity can be used Production Planning Solution Techniques Part 1 MRP, MRP-II p.19/31
106 Rough-Cut Capacity Planning(RCCP) Considers aggregated work Allocates work in time buckets Determines resources in order to reach due dates Both regular and nonregular (outsourcing over time etc.) is considered Time driven RCCP is when project dates must be meet. In resource-driven RCCP only regular capacity can be used This session will consider the time driven Production Planning Solution Techniques Part 1 MRP, MRP-II p.19/31
107 Some notation Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
108 Some notation n jobs J 1,J 2,,J n Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
109 Some notation n jobs J 1,J 2,,J n k resources R 1,,R n Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
110 Some notation n jobs J 1,J 2,,J n k resources R 1,,R n T time buckets Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
111 Some notation n jobs J 1,J 2,,J n k resources R 1,,R n T time buckets Q kt is the regular capacity for resource k in period t Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
112 Some notation n jobs J 1,J 2,,J n k resources R 1,,R n T time buckets Q kt is the regular capacity for resource k in period t Job J j requires q jk units of resource k Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
113 Some notation n jobs J 1,J 2,,J n k resources R 1,,R n T time buckets Q kt is the regular capacity for resource k in period t Job J j requires q jk units of resource k x kt denotes the fraction of job J j performed in period t Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
114 Some notation n jobs J 1,J 2,,J n k resources R 1,,R n T time buckets Q kt is the regular capacity for resource k in period t Job J j requires q jk units of resource k x kt denotes the fraction of job J j performed in period t J j must be performed in time window [r j,d j ] Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
115 Some notation n jobs J 1,J 2,,J n k resources R 1,,R n T time buckets Q kt is the regular capacity for resource k in period t Job J j requires q jk units of resource k x kt denotes the fraction of job J j performed in period t J j must be performed in time window [r j,d j ] p j is the minimum number of periods job J j can use. Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
116 Some notation n jobs J 1,J 2,,J n k resources R 1,,R n T time buckets Q kt is the regular capacity for resource k in period t Job J j requires q jk units of resource k x kt denotes the fraction of job J j performed in period t J j must be performed in time window [r j,d j ] p j is the minimum number of periods job J j can use. 1 p j is the maximum fraction of a job that can be completed in a week. Production Planning Solution Techniques Part 1 MRP, MRP-II p.20/31
117 Precedence constraints If job J i must finish before J j there is a precedence relation. For a period τ this can be modelled as: Production Planning Solution Techniques Part 1 MRP, MRP-II p.21/31
118 Precedence constraints If job J i must finish before J j there is a precedence relation. For a period τ this can be modelled as: x jτ > 0 τ 1 t=d t x it = 1 Production Planning Solution Techniques Part 1 MRP, MRP-II p.21/31
119 Precedence constraints If job J i must finish before J j there is a precedence relation. For a period τ this can be modelled as: x jτ > 0 τ 1 t=d t x it = 1 There will be d j r j constraints per precedence relation. Production Planning Solution Techniques Part 1 MRP, MRP-II p.21/31
120 Precedence constraints If job J i must finish before J j there is a precedence relation. For a period τ this can be modelled as: x jτ > 0 τ 1 t=d t x it = 1 There will be d j r j constraints per precedence relation. Time windows can in some cases be tightened, due to precedence constraints. Production Planning Solution Techniques Part 1 MRP, MRP-II p.21/31
121 Nonregular capacity Let Q kt denote the nonregular capacity for resource k in period t. Then for each resource and time period: Production Planning Solution Techniques Part 1 MRP, MRP-II p.22/31
122 Nonregular capacity Let Q kt denote the nonregular capacity for resource k in period t. Then for each resource and time period: U kt = max{0, n j=1 q jk x jt Q kt Production Planning Solution Techniques Part 1 MRP, MRP-II p.22/31
123 Nonregular capacity Let Q kt denote the nonregular capacity for resource k in period t. Then for each resource and time period: U kt = max{0, n j=1 q jk x jt Q kt The cost of using nonregular capacity for resource k in time period t is c kt Production Planning Solution Techniques Part 1 MRP, MRP-II p.22/31
124 Nonregular capacity Let Q kt denote the nonregular capacity for resource k in period t. Then for each resource and time period: U kt = max{0, n j=1 q jk x jt Q kt The cost of using nonregular capacity for resource k in time period t is c kt It is assumed that there is no limit on the nonregular resources. Production Planning Solution Techniques Part 1 MRP, MRP-II p.22/31
125 Mathematical Model min T t=1 K k=1 c ktu kt subject to dj t=r j x jt = 1 1 j n x jt 1 p j 1 j n, 1 t T n j=1 q jkx jt U kt 0 1 j n, 1 t T x jt,u kt 0 1 j n, 1 t T Production Planning Solution Techniques Part 1 MRP, MRP-II p.23/31
126 Controlling feasibility Allowed To Work window for job J j is defined as [S j,c j ]. Production Planning Solution Techniques Part 1 MRP, MRP-II p.24/31
127 Controlling feasibility Allowed To Work window for job J j is defined as [S j,c j ]. Job J j cannot start before S j or after C j Production Planning Solution Techniques Part 1 MRP, MRP-II p.24/31
128 Controlling feasibility Allowed To Work window for job J j is defined as [S j,c j ]. Job J j cannot start before S j or after C j A ATW for job J j is feasible if: Production Planning Solution Techniques Part 1 MRP, MRP-II p.24/31
129 Controlling feasibility Allowed To Work window for job J j is defined as [S j,c j ]. Job J j cannot start before S j or after C j A ATW for job J j is feasible if: 1. S j r j and C j d j 2. C j S j p j 1 Production Planning Solution Techniques Part 1 MRP, MRP-II p.24/31
130 Controlling feasibility Allowed To Work window for job J j is defined as [S j,c j ]. Job J j cannot start before S j or after C j A ATW for job J j is feasible if: 1. S j r j and C j d j 2. C j S j p j 1 A set S of ATW windows is feasible if: Production Planning Solution Techniques Part 1 MRP, MRP-II p.24/31
131 Controlling feasibility Allowed To Work window for job J j is defined as [S j,c j ]. Job J j cannot start before S j or after C j A ATW for job J j is feasible if: 1. S j r j and C j d j 2. C j S j p j 1 A set S of ATW windows is feasible if: 1. Every ATW window is feasible 2. S j > C j if J i J j Production Planning Solution Techniques Part 1 MRP, MRP-II p.24/31
132 Mathematical Model ATW windows s jt = { 1 S j t C j 0 otherwise (P S ) min T t=1 K k=1 c ktu kt subjectto dj t=r j x jt = 1 1 j n x jt s j p j 1 j n, 1 t T n j=1 q jkx jt U kt 0 1 j n, 1 t T x jt,u kt 0 1 j n, 1 t T Production Planning Solution Techniques Part 1 MRP, MRP-II p.25/31
133 Constructive heuristics (H BASIC ) Construct a feasible set S of ATW windows. Production Planning Solution Techniques Part 1 MRP, MRP-II p.26/31
134 Constructive heuristics (H BASIC ) Construct a feasible set S of ATW windows. Solve problem P S Production Planning Solution Techniques Part 1 MRP, MRP-II p.26/31
135 Constructive heuristics (H BASIC ) Construct a feasible set S of ATW windows. Solve problem P S To obtain a feasible set of ATW windows construct them as follows: Production Planning Solution Techniques Part 1 MRP, MRP-II p.26/31
136 Constructive heuristics (H BASIC ) Construct a feasible set S of ATW windows. Solve problem P S To obtain a feasible set of ATW windows construct them as follows: Set S j = r j Production Planning Solution Techniques Part 1 MRP, MRP-II p.26/31
137 Constructive heuristics (H BASIC ) Construct a feasible set S of ATW windows. Solve problem P S To obtain a feasible set of ATW windows construct them as follows: Set S j = r j Set C j = min{d j, min k ji J k r k 1} Production Planning Solution Techniques Part 1 MRP, MRP-II p.26/31
138 Constructive heuristics (H BASIC ) Construct a feasible set S of ATW windows. Solve problem P S To obtain a feasible set of ATW windows construct them as follows: Set S j = r j Set C j = min{d j, min k ji J k r k 1} Have I forgotten an important assumption? Production Planning Solution Techniques Part 1 MRP, MRP-II p.26/31
139 Constructive heuristics (H CPM ) Define the slack of job J j as L j = C j (S j + p j ) Production Planning Solution Techniques Part 1 MRP, MRP-II p.27/31
140 Constructive heuristics (H CPM ) Define the slack of job J j as L j = C j (S j + p j ) {J i1,j i2,,j ik } is a ordered set if: Production Planning Solution Techniques Part 1 MRP, MRP-II p.27/31
141 Constructive heuristics (H CPM ) Define the slack of job J j as L j = C j (S j + p j ) {J i1,j i2,,j ik } is a ordered set if: J i1 J i2,j i3 J i4,,j ik 1 J ik Production Planning Solution Techniques Part 1 MRP, MRP-II p.27/31
142 Constructive heuristics (H CPM ) Define the slack of job J j as L j = C j (S j + p j ) {J i1,j i2,,j ik } is a ordered set if: J i1 J i2,j i3 J i4,,j ik 1 J ik A critical path is a path where: Production Planning Solution Techniques Part 1 MRP, MRP-II p.27/31
143 Constructive heuristics (H CPM ) Define the slack of job J j as L j = C j (S j + p j ) {J i1,j i2,,j ik } is a ordered set if: J i1 J i2,j i3 J i4,,j ik 1 J ik A critical path is a path where: L j1 = L j2 = = min 1 n L j Production Planning Solution Techniques Part 1 MRP, MRP-II p.27/31
144 Constructive heuristics (H CPM ) Define the slack of job J j as L j = C j (S j + p j ) {J i1,j i2,,j ik } is a ordered set if: J i1 J i2,j i3 J i4,,j ik 1 J ik A critical path is a path where: L j1 = L j2 = = min 1 n L j S ji = S ji 1 + p i 1 for2 i R Production Planning Solution Techniques Part 1 MRP, MRP-II p.27/31
145 Constructive heuristics (H CPM ) Define the slack of job J j as L j = C j (S j + p j ) {J i1,j i2,,j ik } is a ordered set if: J i1 J i2,j i3 J i4,,j ik 1 J ik A critical path is a path where: L j1 = L j2 = = min 1 n L j S ji = S ji 1 + p i 1 for2 i R C ji = C ji+1 p ji+1 for1 i R Production Planning Solution Techniques Part 1 MRP, MRP-II p.27/31
146 Constructive heuristics (H CPM ) Define the slack of job J j as L j = C j (S j + p j ) {J i1,j i2,,j ik } is a ordered set if: J i1 J i2,j i3 J i4,,j ik 1 J ik A critical path is a path where: L j1 = L j2 = = min 1 n L j S ji = S ji 1 + p i 1 for2 i R C ji = C ji+1 p ji+1 for1 i R A critical path is maximal if for all J l : Production Planning Solution Techniques Part 1 MRP, MRP-II p.27/31
147 Constructive heuristics (H CPM ) Define the slack of job J j as L j = C j (S j + p j ) {J i1,j i2,,j ik } is a ordered set if: J i1 J i2,j i3 J i4,,j ik 1 J ik A critical path is a path where: L j1 = L j2 = = min 1 n L j S ji = S ji 1 + p i 1 for2 i R C ji = C ji+1 p ji+1 for1 i R A critical path is maximal if for all J l : {J i1,j i2,,j ik,j il } is critical {J il,j i1,j i2,,j ik } is critical Production Planning Solution Techniques Part 1 MRP, MRP-II p.27/31
148 (H CPM ) continued Initialize S j = r j and C j = d j for all J j Production Planning Solution Techniques Part 1 MRP, MRP-II p.28/31
149 (H CPM ) continued Initialize S j = r j and C j = d j for all J j Compute the slack for all jobs Production Planning Solution Techniques Part 1 MRP, MRP-II p.28/31
150 (H CPM ) continued Initialize S j = r j and C j = d j for all J j Compute the slack for all jobs Find a maximal critical path {J i1,j i2,,j ik } Production Planning Solution Techniques Part 1 MRP, MRP-II p.28/31
151 (H CPM ) continued Initialize S j = r j and C j = d j for all J j Compute the slack for all jobs Find a maximal critical path {J i1,j i2,,j ik } Compute the total slack L = C jr (S j1 + R i=1 p j i Production Planning Solution Techniques Part 1 MRP, MRP-II p.28/31
152 (H CPM ) continued Initialize S j = r j and C j = d j for all J j Compute the slack for all jobs Find a maximal critical path {J i1,j i2,,j ik } Compute the total slack L = C jr (S j1 + R i=1 p j i Set S ji = S j1 + i 1 k=1 p i k + L i 1 k=1 p i k / R k=1 p i k Production Planning Solution Techniques Part 1 MRP, MRP-II p.28/31
153 (H CPM ) continued Initialize S j = r j and C j = d j for all J j Compute the slack for all jobs Find a maximal critical path {J i1,j i2,,j ik } Compute the total slack L = C jr (S j1 + R i=1 p j i Set S ji = S j1 + i 1 k=1 p i k + L i 1 k=1 p i k / R k=1 p i k Change to C ik = S ik+1 1 Production Planning Solution Techniques Part 1 MRP, MRP-II p.28/31
154 H CPM example S C p Production Planning Solution Techniques Part 1 MRP, MRP-II p.29/31
155 H CPM example S C p L = C 4 (0 + 20) = 5 Production Planning Solution Techniques Part 1 MRP, MRP-II p.29/31
156 H CPM example S C p L = C 4 (0 + 20) = 5 Recall ˆ Sji = S ji + i 1 k=1 p j k + L i 1 k=1 / R k=1 p jk Production Planning Solution Techniques Part 1 MRP, MRP-II p.29/31
157 H CPM example S C p L = C 4 (0 + 20) = 5 Recall ˆ Sji = S ji + i 1 k=1 p j k + L i 1 k=1 / R k=1 p jk S 2 = = 6 Production Planning Solution Techniques Part 1 MRP, MRP-II p.29/31
158 H CPM example S C p L = C 4 (0 + 20) = 5 Recall ˆ Sji = S ji + i 1 k=1 p j k + L i 1 k=1 / R k=1 p jk S 2 = = 6 S 3 = = 12 Production Planning Solution Techniques Part 1 MRP, MRP-II p.29/31
159 H CPM example S C p L = C 4 (0 + 20) = 5 Recall ˆ Sji = S ji + i 1 k=1 p j k + L i 1 k=1 / R k=1 p jk S 2 = = 6 S 3 = = 12 S 4 = = 24 Production Planning Solution Techniques Part 1 MRP, MRP-II p.29/31
160 H CPM example S C p L = C 4 (0 + 20) = 5 Recall ˆ Sji = S ji + i 1 k=1 p j k + L i 1 k=1 / R k=1 p jk S 2 = = 6 S 3 = = 12 S 4 = = 24 C 1 = S 2 1 = 5, C 2 = 11, C 3 = 23 Production Planning Solution Techniques Part 1 MRP, MRP-II p.29/31
161 Neighbourhoods Production Planning Solution Techniques Part 1 MRP, MRP-II p.30/31
162 Neighbourhoods For job J j increase S j or decrease C j Production Planning Solution Techniques Part 1 MRP, MRP-II p.30/31
163 Neighbourhoods For job J j increase S j or decrease C j Decrease S j implies S j > r j, C k = S j 1 for any preceding job J k and C k S k p k Production Planning Solution Techniques Part 1 MRP, MRP-II p.30/31
164 Neighbourhoods For job J j increase S j or decrease C j Decrease S j implies S j > r j, C k = S j 1 for any preceding job J k and C k S k p k Neighbourhood can be ordered after the greedy choice or the steepest edge rule. Production Planning Solution Techniques Part 1 MRP, MRP-II p.30/31
165 Exercises Ex 1 Suggest some improvements for 2-3 of the modules in the MRP II model. You should describe what additional data the system and need and what value it would add for the users. Production Planning Solution Techniques Part 1 MRP, MRP-II p.31/31
166 Exercises Ex 1 Suggest some improvements for 2-3 of the modules in the MRP II model. You should describe what additional data the system and need and what value it would add for the users. Ex 2 For RCCP we have focused on the time driven case in this exercise we consider the resource driven case: Production Planning Solution Techniques Part 1 MRP, MRP-II p.31/31
167 Exercises Ex 1 Suggest some improvements for 2-3 of the modules in the MRP II model. You should describe what additional data the system and need and what value it would add for the users. Ex 2 For RCCP we have focused on the time driven case in this exercise we consider the resource driven case: Ex 2.1 Give a mathematical model for the Resource driven RCCP without precedence constraints. Production Planning Solution Techniques Part 1 MRP, MRP-II p.31/31
168 Exercises Ex 1 Suggest some improvements for 2-3 of the modules in the MRP II model. You should describe what additional data the system and need and what value it would add for the users. Ex 2 For RCCP we have focused on the time driven case in this exercise we consider the resource driven case: Ex 2.1 Give a mathematical model for the Resource driven RCCP without precedence constraints. Ex 2.2 If we use H BASIC to solve the resource driven RCCP will it result in a feasible solution? Justify you answer Production Planning Solution Techniques Part 1 MRP, MRP-II p.31/31
169 Exercises Ex 1 Suggest some improvements for 2-3 of the modules in the MRP II model. You should describe what additional data the system and need and what value it would add for the users. Ex 2 For RCCP we have focused on the time driven case in this exercise we consider the resource driven case: Ex 2.1 Give a mathematical model for the Resource driven RCCP without precedence constraints. Ex 2.2 If we use H BASIC to solve the resource driven RCCP will it result in a feasible solution? Justify you answer Ex 2.3 Describe a heuristic for the resource driven RCCP. The heuristic should include a constructive heuristic and a improvement heuristic. Production Planning Solution Techniques Part 1 MRP, MRP-II p.31/31
OR topics in MRP-II. Mads Jepsens. OR topics in MRP-II p.1/25
OR topics in MRP-II Mads Jepsens OR topics in MRP-II p.1/25 Overview Why bother? OR topics in MRP-II p.2/25 Why bother? Push and Pull systems Overview OR topics in MRP-II p.2/25 Overview Why bother? Push
Material Requirements Planning (MRP)
Material Requirements Planning (MRP) Unlike many other approaches and techniques, material requirements planning works which is its best recommendation. Joseph Orlicky, 1974 1 History Begun around 1960
Material Requirements Planning. Lecturer: Stanley B. Gershwin
Material Requirements Planning Lecturer: Stanley B. Gershwin MRP Overview Primary source: Factory Physics by Hopp and Spearman. Basic idea: Once the final due date for a product is known, and the time
ISE 421 QUANTATIVE PRODUCTION PLANNING
ISE 421 QUANTATIVE PRODUCTION PLANNING LECTURE III MRP, MRPII, ERP, APS Dr. Arslan ÖRNEK 2013 2014 Fall Term PRODUCTION PLANNING & SCHEDULING (PP&S) PP&S is one of the most critical activities in a manufacturing
Chapter 7. Production, Capacity and Material Planning
Chapter 7 Production, Capacity and Material Planning Production, Capacity and Material Planning Production plan quantities of final product, subassemblies, parts needed at distinct points in time To generate
1 Material Requirements Planning (MRP)
IEOR 4000: Production Management page 1 Professor Guillermo Gallego 1 Material Requirements Planning (MRP) Material Requirements Planning (MRP) is a computer-based production planning and inventory control
CHAPTER 6 AGGREGATE PLANNING AND INVENTORY MANAGEMENT 명지대학교 산업시스템공학부
CHAPTER 6 AGGREGATE PLANNING AND INVENTORY MANAGEMENT 명지대학교 산업시스템공학부 Learning Objectives You should be able to: Describe the hierarchical operations planning process in terms of materials planning & capacity
Material Requirements Planning MRP
Material Requirements Planning MRP ENM308 Planning and Control I Spring 2013 Haluk Yapıcıoğlu, PhD Hierarchy of Decisions Forecast of Demand Aggregate Planning Master Schedule Inventory Control Operations
APICS acknowledges the Basics of Supply Chain Management Committee for its contributions in the development of this resource.
APICS acknowledges the Basics of Supply Chain Management Committee for its contributions in the development of this resource. Jim Caruso, CPIM, CSCP (chair) Carol Bulfer, CPIM James F. Cox, Ph.D., CFPIM,
MASTER PRODUCTION SCHEDULE
6 MASTER PRODUCTION SCHEDULE MGT2405, University of Toronto, Denny Hong-Mo Yeh So far, in discussing material requirement planning (MRP), we have assumed that master production schedule (MPS) is ready
INDEPENDENT STUDY PAILIN UDOMSANTI
1 INDEPENDENT STUDY ERP Comparison : Production Planning and Control Module PAILIN UDOMSANTI An Independent Study submitted in Partial Fulfillment of the requirements For the Degree of Master of Engineering
How To Learn How To Manage A Business
Course Objectives Upon course completion, the participants will be able to: 1) To gain an understanding and appreciation of the principles and applications relevant to the planning, design, and operations
Issues in Information Systems Volume 14, Issue 2, pp.353-358, 2013
A MODEL FOR SIMULTANEOUS DECISIONS ON MASTER PRODUCTION SCHEDULING, LOT SIZING, AND CAPACITY REQUIREMENTS PLANNING Harish C. Bahl, California State University-Chico, hbahl@csuchico.edu Neelam Bahl, California
Universidad del Turabo MANA 705 DL Workshop Eight W8_8_3 Aggregate Planning, Material Requirement Planning, and Capacity Planning
Aggregate, Material Requirement, and Capacity Topic: Aggregate, Material Requirement, and Capacity Slide 1 Welcome to Workshop Eight presentation: Aggregate planning, material requirement planning, and
BILL OF RESOURCES AND PRIORITY-CAPACITY BALANCING
Bill of Resources and PriorityCapacity Balancing 5 BILL OF RESOURCES AND PRIORITYCAPACITY BALANCING MGT2405, University of Toronto, Denny HongMo Yeh Load and capacity are terms that are often used interchangeably.
BSCM Sample TEST. CPIM(Certified In Production & Inventory Management) - 1 -
BSCM Sample TEST. 1. Which of the following demand fulfillment approaches typically provides the longest delivery time? A) Engineer-to-order. B) Make-to-order. C) Assemble-to-order. D) Make-to-stock. 2.
Basics of Supply Chain Management (BSCM) Curriculum
Basics of Supply Chain Management (BSCM) Curriculum Version 4.0 Session 1 to Supply Chain Management to Manufacturing Role of Manufacturing Global Citizenship Manufacturing Business Model Business Environment
MATERIAL REQUIREMENTS PLANNING
MATERIAL REQUIREMENTS PLANNING A basic tool for performing the detailed material planning function in the manufacture of component parts and their assembly into finished items. MRP s Managerial objective
12 MRP and ERP. Dr. Ron Lembke
12 MRP and ERP Dr. Ron Lembke Historical Perspective MRP II Manufacturing Resource Planning ERP- Enterprise Resource Planning mrp material requirements planning MRP Crusade (1975) Material Requirements
1 2 3 4 5 Demand 150 170 180 160 160
MGT 3110: Exam 2 Study Guide 1. What is aggregate planning? What is its purpose? 2. What are demand options for aggregate planning? Give examples and discuss the effects of each. 3. Why is there a need
A New Approach for Finite Capacity Planning in MRP Environment
A New Approach for Finite Capacity Planning in MRP Environment Hong-bum Na 1, Hyoung-Gon Lee 1, and Jinwoo Park 1 1 Dept. of Industrial Engeering / Automation & Systems Research Inst. Seoul National University
ERP(Enterprise Resource Planning) & MRP
ERP(Enterprise Resource Planning) & MRP Mr.Vijayakumar S 1 Session Objectives At the end of this session the delegate would have understood ERP ERP example SAP MRP and structure MRP1 & MRPII difference
Short-term Planning. How to start the right operation at the right shop at the right time? Just in Time (JIT) How to avoid waste?
Short-term Planning Material Requirements Planning (MRP) How to get the right material in the right quantity at the right time? Manufacturing Resource Planning (MRP2) How to start the right operation at
Agenda. Real System, Transactional IT, Analytic IT. What s the Supply Chain. Levels of Decision Making. Supply Chain Optimization
Agenda Supply Chain Optimization KUBO Mikio Definition of the Supply Chain (SC) and Logistics Decision Levels of the SC Classification of Basic Models in the SC Logistics Network Design Production Planning
An investigation into production scheduling systems
Computer Science Kjell Olofsson An investigation into production scheduling systems D-dissertation (10 p) 2004:06 This report is submitted in partial fulfillment of the requirements for the Master s degree
TU-E2020 ADVANCED OPERATIONS MANAGEMENT. Demand management Sales & Operations Planning Master Production Scheduling
TU-E2020 ADVANCED OPERATIONS MANAGEMENT Demand management Sales & Operations Planning Master Production Scheduling 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999
INVENTORY MANAGEMENT
7 INVENTORY MANAGEMENT MGT2405, University of Toronto, Denny Hong-Mo Yeh Inventory management is the branch of business management that covers the planning and control of the inventory. In the previous
Supply Chain Leaders Understanding and Improving Supply Chain Performance Where It Counts
Leaders Understanding and Improving Performance Where It Counts What is the Leaders Programme? Leaders is an action-oriented, practical programme which identifies the most vital supply chain improvements
The Trip Scheduling Problem
The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems
Manufacturing. Manufacturing challenges of today and how. Navision Axapta solves them- In the current explosive economy, many
Manufacturing challenges of today and how Navision Axapta solves them- the solution for change; controlled by you. Manufacturing In the current explosive economy, many manufacturers are struggling to keep
Planning and scheduling in the 21st century
Infor ERP Planning and scheduling in the 21st century How Infor Advanced Planning and Scheduling systems deliver a lean and agile environment for today s manufacturers. Table of contents Executive summary...
1.3 ERP System Evolution
1.3 ERP System Evolution Learning Objectives State the purpose of enterprise resource planning (ERP) systems List the challenges facing the industry List the development stages of the manufacturing planning
APS1028 Operations and Production Management - Fall 2014 (Monday Noon-2 PM starting 8 th September 2014: BA B025 (the basement classroom)
- Fall 2014 (Monday Noon-2 PM starting 8 th September 2014: BA B025 (the basement classroom) Course Outline Operations Management is the systematic approach and control of the processes that transform
Motivated by a problem faced by a large manufacturer of a consumer product, we
A Coordinated Production Planning Model with Capacity Expansion and Inventory Management Sampath Rajagopalan Jayashankar M. Swaminathan Marshall School of Business, University of Southern California, Los
Real Time Scheduling Basic Concepts. Radek Pelánek
Real Time Scheduling Basic Concepts Radek Pelánek Basic Elements Model of RT System abstraction focus only on timing constraints idealization (e.g., zero switching time) Basic Elements Basic Notions task
Material Requirements Planning (MRP)
The Priority Enterprise Management System Material Requirements Planning (MRP) Contents MRP - Introduction...2 Calculating Demand for Top-Level Parts...2 Calculating Demand for Sub-assemblies and Raw Materials...3
GESTION DE LA PRODUCTION ET DES OPERATIONS PICASSO EXERCICE INTEGRE
ECAP 21 / PROD2100 GESTION DE LA PRODUCTION ET DES OPERATIONS PICASSO EXERCICE INTEGRE 2004-2005 Prof : Pierre Semal : semal@poms.ucl.ac.be Assistants : Eléonore de le Court : delecourt@poms.ucl.ac.be
E217 Inventory Management (4 Modular Credits)
E17 Inventory Management ( Modular Credits) This document addresses the content related abilities, with reference to the module. Abilities of learning, thinking, problem solving, teamwork, communication,
Dependent vs Independent Demand. The Evolution of MRP II. MRP II:Manufacturing Resource Planning Systems. The Modules In MRP II System
MRP II:Manufacturing Resource Planning Systems IE 505: Production Planning Control Lecture Notes* Rakesh Nagi University at Buffalo * Adapted in part from Lecture Notes of Dr. George Harhalakis, University
Visual Planning and Scheduling Systems. A White Paper. Gregory Quinn President Quinn & Associates Inc September 2006 Updated October 2006
Visual Planning and Scheduling Systems A White Paper By Gregory Quinn President Quinn & Associates Inc September 2006 Updated October 2006 Visual Planning and Visual Scheduling Systems Introduction The
IM 322 Inventory Management
IM 322 Inventory Management Chapter 9: Material Requirement Planning -1- Textbook: Donald Waters, Inventory Control and Management, 2 nd ed Chapter Outline Master Scheduling The use of MRP (Material Requirement
Key Benefits: Minimize lead times and maximize on-time deliveries to customers. Respond quickly to changes in demand for materials and capacity
Microsoft Business Solutions Axapta Master Planning streamlines your manufacturing processes and supply chain to help you reduce costs and satisfy customer demands. Key Benefits: Minimize lead times and
2.4 Capacity Planning
2.4 Capacity Planning Learning Objectives Explain functions & importance of capacity planning State four techniques for capacity planning Explain capacity planning factor and bill of capacity techniques
TU-E2020. Capacity Planning and Management, and Production Activity Control
TU-E2020 Capacity Planning and Management, and Production Activity Control Copyright Jari Laine 11/23/2015 Copyright Jari Laine 11/23/2015 Different capacity planning options 1 4 7 10 13 16 19 22 25 28
15. How would you show your understanding of the term system perspective? BTL 3
Year and Semester FIRST YEAR II SEMESTER (EVEN) Subject Code and Name BA7201 OPERATIONS MANAGEMENT Faculty Name 1) Mrs.L.SUJATHA ASST.PROF (S.G) 2) Mr. K.GURU ASST.PROF (OG) Q.No Unit I Part A BT Level
Functional Area Systems Production / Operation Systems
ACS-1803 Introduction to Information Systems Instructor: Kerry Augustine Functional Area Systems Production / Operation Systems Lecture Outline 5, Part 2 ACS-1803 Introduction to Information Systems Examples:
26/10/2015. Functional Area Systems Production / Operation Systems. Examples: Functional Area Info Systems. Functional Area Information Systems
ACS-1803 Introduction to Information Systems Instructor: Kerry Augustine Functional Area Systems Production / Operation Systems Lecture Outline 5, Part 2 ACS-1803 Introduction to Information Systems Examples:
Scheduling Single Machine Scheduling. Tim Nieberg
Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for non-preemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe
A DECISION SUPPORT SYSTEM FOR CAPACITY MANAGEMENT. A Senior Project. presented to
A DECISION SUPPORT SYSTEM FOR CAPACITY MANAGEMENT A Senior Project presented to the Faculty of the Industrial and Manufacturing Engineering Department California Polytechnic State University, San Luis
PRODUCTION PLANNING AND SCHEDULING Part 1
PRODUCTION PLANNING AND SCHEDULING Part Andrew Kusiak 9 Seamans Center Iowa City, Iowa - 7 Tel: 9-9 Fax: 9-669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Forecasting Planning Hierarchy
Introduction to production scheduling. Industrial Management Group School of Engineering University of Seville
Introduction to production scheduling Industrial Management Group School of Engineering University of Seville 1 Introduction to production scheduling Scheduling Production scheduling Gantt Chart Scheduling
Fundamentals of Materials and Operations Management
Fundamentals of Materials and Operations Management Program Overview Program Overview Introduction Fundamentals of Materials and Operations Management Fundamentals of Materials and Operations Management
Logistics Management Inventory Cycle Inventory. Özgür Kabak, Ph.D.
Logistics Management Inventory Cycle Inventory Özgür Kabak, Ph.D. Role of Inventory in the Supply Chain Improve Matching of Supply and Demand Improved Forecasting Reduce Material Flow Time Reduce Waiting
Manufacturing Planning and Control for Supp Chain Management
Manufacturing Planning and Control for Supp Chain Management Sixth Edition F. Robert Jacobs Indiana University William L. Berry The Ohio State University (Emeritus) D. Clay Whybark University of North
Cadena de suministro. Mtro. William H. Delano Frier
Cadena de suministro Mtro. William H. Delano Frier Module 2 Operations and Productivity What is Operations Management? Production Is the creation of goods and services. Operations Management Is the series
Inventory Management, Just-in-Time, and Backflush Costing
Inventory Management, Just-in-Time, and Backflush Costing Inventory Management in Retail Organizations Inventory Management is planning coordinating controlling activities related to the flow of inventory
PRINCIPLES OF INVENTORY AND MATERIALS MANAGEMENT
PRINCIPLES OF INVENTORY AND MATERIALS MANAGEMENT Fourth Edition Richard J. Tersine The University of Oklahoma TEGHNISCHE HOCHSCHULE DARMSTADT Fochbereich 1 Gesonr> 11-. ib I iothek Betiier >wi rtschottsiehre
PARADIGMS THAT DRIVE COSTS IN MANUFACTURING. The whole purpose of a business enterprise is pretty simple to make a profit by selling
PARADIGMS THAT DRIVE COSTS IN MANUFACTURING The whole purpose of a business enterprise is pretty simple to make a profit by selling products or services to persons who desire those particular goods or
Principles of Inventory and Materials Management
Principles of Inventory and Materials Management Second Edition Richard J. Tersine The University of Oklahoma m North Holland New York Amsterdam Oxford TECHNISCHE HOCHSCHULE DARMSTADT Fochbereich 1 Gesamthiblio-thek
Operations Management
13-1 MRP and ERP Operations Management William J. Stevenson 8 th edition 13-2 MRP and ERP CHAPTER 13 MRP and ERP McGraw-Hill/Irwin Operations Management, Eighth Edition, by William J. Stevenson Copyright
Operations Research in Production Planning, Scheduling, and Inventory Control
TECHNISCHE HOCHSCHULE DARMSTADT Fachbereich 1 Ges am t b i bj_[o_t he_k Bet ri eb? wi rtscha\ \ si eh re Inventar-Nr. : Abstell-Nr. : Sachgebiete:.^~ Operations Research in Production Planning, Scheduling,
CHAPTER 1. Basic Concepts on Planning and Scheduling
CHAPTER 1 Basic Concepts on Planning and Scheduling Scheduling, FEUP/PRODEI /MIEIC 1 Planning and Scheduling: Processes of Decision Making regarding the selection and ordering of activities as well as
Materials Management and Inventory Systems
Materials Management and Inventory Systems Richard J.Tersine Old Dominion University 'C & North-Holland PUBLISHING COMPANY NEW YORK AMSTERDAM Contents Preface Chapter 1 INTRODUCTION 1 Inventory 4 Types
IT-375 using the 6 th Edition PRODUCTION AND INVENTORY CONTROL CHAPTER 1: INTRODUCTION TO MATERIALS MANAGEMENT
IT-375 using the 6 th Edition PRODUCTION AND INVENTORY CONTROL CHAPTER 1: INTRODUCTION TO MATERIALS MANAGEMENT What is wealth? GDP = production = profits What is the source of wealth? The conversion process
SAP APO SNP (Supply Network Planning) Sample training content and overview
SAP APO SNP (Supply Network Planning) Sample training content and overview Course Objectives At the completion of this course, you will be able to: Understand the concepts of SNP and supply chain network
Manufacturing Applications in Microsoft Dynamics GP 10.0
Manufacturing Applications in Microsoft Dynamics GP 10.0 8817: Manufacturing Applications in Microsoft Dynamics GP 10.0 (4 Days) About this Course This four-day instructor-led course provides students
A Programme Implementation of Several Inventory Control Algorithms
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume, No Sofia 20 A Programme Implementation of Several Inventory Control Algorithms Vladimir Monov, Tasho Tashev Institute of Information
TRAVERSE Manufacturing
Manufacturing TRAVERSE Manufacturing from Open Systems, Inc. is the perfect solution for smaller growing to larger progressive manufacturers Managing profitability, cost control, inventory control, purchasing
Single item inventory control under periodic review and a minimum order quantity
Single item inventory control under periodic review and a minimum order quantity G. P. Kiesmüller, A.G. de Kok, S. Dabia Faculty of Technology Management, Technische Universiteit Eindhoven, P.O. Box 513,
Expert s Guide to Successful MRP Projects. September 2012
September 2012 Ziff Davis Research All Rights Reserved 2012 White Paper Executive Summary For most manufacturers, the planning department performs business critical functions. It is responsible for balancing
VEHICLE ROUTING PROBLEM
VEHICLE ROUTING PROBLEM Readings: E&M 0 Topics: versus TSP Solution methods Decision support systems for Relationship between TSP and Vehicle routing problem () is similar to the Traveling salesman problem
LOGISTIQUE ET PRODUCTION SUPPLY CHAIN & OPERATIONS MANAGEMENT
LOGISTIQUE ET PRODUCTION SUPPLY CHAIN & OPERATIONS MANAGEMENT CURSUS CONTENTS 1) Introduction 2) Human resources functions 3) A new factory 4) Products 5) Services management 6) The processes 7) Planning
Production Management
Production Management Chwen-Tzeng Su, PhD Professor, Department of Industrial Management National Yunlin University of Science & Technology Touliu, Yunlin, Taiwan 640, R.O.C. E-mail: suct@yuntech.edu.tw
Master planning in Dynamics AX
12/10/2015 Master planning in Dynamics AX JACOB RODER SR. SOLUTION CONSULTANT DYNAMIC CONSULTING JACOB.RODER@DYNAMICCONSULTING.COM 1 Agenda Morning Short Intro Master planning basics Master plan settings
Table of Contents. Planning the ERP System...1
Table of Contents Planning the ERP System...1 Core Group Basic Training...1 Define Current Business Processes...1 Define Future Business Processes...2 Documenting the ERP Blueprint...2 ERP System Budget
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1
5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition
Contents. The Planning Hierarchy. Capacity / Load. TPPE37 Manufacturing Control
TPPE37 Manufacturing Control Contents Lecture 6 Capacity Planning Capacity theory RoughCut Capacity Planning Three different techniques Comparison of of the the techniques Capacity Requeriments Planning
Supply Chain Inventory Management Chapter 9. Copyright 2013 Pearson Education, Inc. publishing as Prentice Hall 09-01
Supply Chain Inventory Management Chapter 9 09-01 What is a Inventory Management? Inventory Management The planning and controlling of inventories in order to meet the competitive priorities of the organization.
From the Aggregate Plan to Lot-Sizing in Multi-level Production Planning
From the Aggregate Plan to Lot-Sizing in Multi-level Production Planning Jean-Claude Hennet LAAS-CNRS, 7 Ave. Colonel Roche, 31077 Toulouse FRANCE 1 INTRODUCTION The hierarchical approach to production
A Cross-Functional View of Inventory Management, Why Collaboration among Marketing, Finance/Accounting and Operations Management is Necessary
A Cross-Functional View of Inventory Management, Why Collaboration among Marketing, Finance/Accounting and Operations Management is Necessary Richard E. Crandall, Appalachian State University, John A.
Linear Programming Based Heuristics for Multi-Project Capacity Planning
Linear Programming Based Heuristics for Multi-Project Capacity Planning Noud Gademann & Marco Schutten WP-79 BETA-publicatie: WP-79 ISSN: 1386-9213 NUGI: 684 Enschede:June2002 Linear Programming Based
Alessandro Anzalone, Ph.D. Hillsborough Community College, Brandon Campus
Alessandro Anzalone, Ph.D. Hillsborough Community College, Brandon Campus 1. Introduction 2. Background and Fundamental Concepts 3. Bills of Material 4. The MRP Explosion 5. Other MRP Issues 6. Potential
MGT 3110 - Exam 2 Formulas. Item $ Usage % of $ usage Cumulative % of $ Cumulative % of no. of items Class
Chapter 12 Inventory Management MGT 3110 - Exam 2 Formulas ABC Classification rule: Class A: ~15% of items, 70-80% annual $ usage Class B: ~30% of items, 15-25% annual $ usage Class C: ~55% of items, 5%
ORACLE CONFIGURE TO ORDER SOLUTION
ORACLE CONFIGURE TO ORDER SOLUTION KEY FEATURES ORACLE CONFIGURE TO ORDER SOLUTION PROVIDES SUITE LEVEL SUPPORT FOR YOUR CONFIGURED BUISNESS. KEY FEATURES INCLUDE: Create and maintain assemble to order
COMPUTATIONAL METHODS FOR BIG BUCKET PRODUCTION PLANNING PROBLEMS: FEASIBLE SOLUTIONS AND STRONG FORMULATIONS
COMPUTATIONAL METHODS FOR BIG BUCKET PRODUCTION PLANNING PROBLEMS: FEASIBLE SOLUTIONS AND STRONG FORMULATIONS By Kerem Akartunalı A Dissertation submitted in partial fulfillment of the requirements for
Classification - Examples
Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
Supply Chain Management with SAP APO
Jörg Thomas Dickersbach Supply Chain Management with SAP APO Structures, Modelling Approaches and Implementation of SAP SCM 2008 3rd edition Springer Contents PART I - OVERVIEW 1 SCM Projects with SAP
Master Planning The Forgotten, But Vital, Manufacturing Supply Chain Planning Process
Master Planning The Forgotten, But Vital, Manufacturing Supply Chain Planning Process KEN TITMUSS, CFPIM INTRODUCTION Over the last twelve years the author has presented numerous APICS and SAPICS educational
Rough Cut Capacity Planning-(RCCP)-(Case Study)
Advances in Theoretical and Applied Mechanics, Vol. 7, 2014, no. 2, 53-66 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/atam.2014.4612 Rough Cut Capacity Planning-(RCCP)-(Case Study) Raqeyah
SAP Sales and Operations Planning Compare & Contrast with SAP APO. Phil Gwynne SAP UKI 2013
SAP Sales and Operations Planning Compare & Contrast with SAP APO Phil Gwynne SAP UKI 2013 But the King is still reported alive regularly Disclaimer The information in this document is confidential and
Operations Management. 3.3 Justify the need for Operational Planning and Control in a selected Production Process
Operations Management 3.3 Justify the need for Operational Planning and Control in a selected Production Process Key Topics LO3 Understand how to organise a typical production process 3.3 justify the need
Strategic Framework to Analyze Supply Chains
Strategic Framework to Analyze Supply Chains 1 Andy Guo A Strategic Framework for Supply Chain Design, Planning, and Operation Part I: Understand the supply chain Part II: Supply chain performance Part
SUPPLY CHAIN MISSION STATEMENT
SUPPLY CHAIN MISSION STATEMENT To create a competitive advantage for Welch s through purchasing, manufacturing and distributing products and services which provide superior value to our customers. SOME
Teaching Manual-Operation Management. Gunadarma University. Week : 9 Subject : INVENTORY MANAGEMENT Content :
Week : 9 Subject : INVENTORY MANAGEMENT Content : WHY INVENTORY a. One of the most expensive assets of many companies representing as much as 50% of total invested capital b. Operations managers must balance
Antti Salonen KPP227 - HT 2015 KPP227
- HT 2015 1 Inventory management Inventory management concerns short-range decisions about supplies, inventories, production levels, staffing patterns, schedules and distribution. The decisions are often
SPREADSHEET SIMULATOR FOR INVENTORY MANAGEMENT IN A SUPPLY CHAIN
SPREADSHEET SIMULATOR FOR INVENTORY MANAGEMENT IN A SUPPLY CHAIN ABSTRACT Sakir Esnaf Istanbul University, Faculty of Business Administration Department of Production Management Avcilar,Istanbul 34850
What is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
Consumption-Driven Finite Capacity Inventory Planning and Production Control. A thesis presented to. the faculty of
Consumption-Driven Finite Capacity Inventory Planning and Production Control A thesis presented to the faculty of the Russ College of Engineering and Technology of Ohio University In partial fulfillment
CISCM STUDY GUIDE. International Purchasing and Supply Chain Management Institute, 2006 1
CISCM STUDY GUIDE International Purchasing and Supply Chain Management Institute, 2006 1 TABLE OF CONTENTS PART PAGE PART I Materials, Production, Inventory, Logistics, and Supply Chain Management 3 PART
Demand forecasting & Aggregate planning in a Supply chain. Session Speaker Prof.P.S.Satish
Demand forecasting & Aggregate planning in a Supply chain Session Speaker Prof.P.S.Satish 1 Introduction PEMP-EMM2506 Forecasting provides an estimate of future demand Factors that influence demand and