Develop a material requirements plan, Data Structure & Algorithms

The below figure illustrates the BOM (Bill of Materials) for product A. The MPS (Material requirements Planning) start row in the master production schedule for product A calls for 50 units in week 2, 65 units in week 5, and 80 units in week 8. Item C is produced to make A and to meet the forecasted demand for replacement parts.  Past replacement part demand has been 20 units per week (add 20 units to C's gross requirements). The lead times for items F and C are 1 week, and for the other items the lead time is 2 weeks. No safety stock is required for items B, C, D, E, and F. The L4L lot-sizing rule is used for items B and F; the POQ (Periodic Order Quantity) lot-sizing rule (P = 3) is used for C. Item E has an FOQ (Fixed Order Quantity) of 600 units, and D has an FOQ of 250 units. On-hand inventories are 50 units of B, 50 units of C, 120 units of D, 70 units of E, and 250 units of F. Item B has a scheduled receipt of 50 units in week 2. Develop a material requirements plan for the next 8 weeks for items B, C, D, E, and F.

 

 

 

Posted Date: 3/30/2013 7:09:34 AM | Location : United States







Related Discussions:- Develop a material requirements plan, Assignment Help, Ask Question on Develop a material requirements plan, Get Answer, Expert's Help, Develop a material requirements plan Discussions

Write discussion on Develop a material requirements plan
Your posts are moderated
Related Questions
Merging two sequence using CREW merge

What are the expression trees? Represent the below written expression using a tree. Give a relevant comment on the result that you get when this tree is traversed in Preorder,

Optimal solution to the problem given below. Obtain the initial solution by VAM Ware houses Stores Availibility I II III IV A 5 1 3 3 34 B 3 3 5 4 15 C 6 4 4 3 12 D 4 –1 4 2 19 Re

Searching is the procedure of looking for something. Searching a list containing 100000 elements is not the similar as searching a list containing 10 elements. We discussed two sea

Preconditions assertion A precondition is an assertion which should be true at the initiation of an operation. For instance, a square root operation can't accept a negative a

Q. Explain the complexity of an algorithm?  What are the worst case analysis and best case analysis explain with an example.

Define Big Omega notation Big Omega notation (?) : The lower bound for the function 'f' is given by the big omega notation (?). Considering 'g' to be a function from the non-n

algorithm for insertion in a queue using pointers

Which sorting algorithm is easily adaptable to singly linked lists? Simple Insertion sor t is easily adabtable to singly linked list.

Explain an efficient way of storing a sparse matrix in memory.   A matrix in which number of zero entries are much higher than the number of non zero entries is called sparse mat