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
N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)

Count Scorecards(30 points) In a tournament, N players play against each other exactly once. Each game results in either of the player winning. There are no ties. You have given a

B-trees are special m-ary balanced trees utilized in databases since their structure allows records to be added, deleted & retrieved with guaranteed worst case performance. A B-

Implementation of queue using a singly linked list: While implementing a queue as a single liked list, a queue q consists of a list and two pointers, q.front and q.rear.

Phong Shading Phong shading too is based on interpolation, but instead of interpolating the colour value, it is the normal vector, which is interpolated for each point and a co

For preorder traversal, in the worst case, the stack will rise to size n/2, where n refer to number of nodes in the tree. Another method of traversing binary tree non-recursively t

Determine about the unreachable code assertion An unreachable code assertion is an assertion that is placed at a point in a program that shouldn't be executed under any circum

The Euclidean algorithm is an algorithm to decide the greatest common divisor of two positive integers. The greatest common divisor of N and M, in short GCD(M,N), is the largest in

Create main method or a test class that creates 2 Element objects that are neighbours of each other, the first element temperature set at 100, the 2nd at 0 and use an appropriate h

how to reduce the number of passes in selection sort