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
Red-Black trees have introduced a new property in the binary search tree that means an extra property of color (red, black). However, as these trees grow, in their operations such

CIRCULARLY LINKED LISTS IMPLEMENTATION A linked list wherein the last element points to the first element is called as CIRCULAR linked list. The chains do not specified first o

Differentiate between Nonpersistent and 1-persistent Nonpersistent: If the medium is idle, transmit; if the medium is busy, wait an amount of time drawn from a probability dist

The minimum cost spanning tree has broad applications in distinct fields. It represents several complicated real world problems such as: 1. Minimum distance for travelling all o

Binary tree creation struct NODE { struct NODE *left; int value; struct NODE *right; }; create_tree( struct NODE *curr, struct NODE *new ) { if(new->val


A shop sells books, maps and magazines. Every item is identified by a unique 4 - digit code. All books have a code starting with a 1, all maps have a code which starts with a 2 and

There are ten stations on a railway line: Train travels in both directions (i.e. from 1 to 10 and then from 10 to 1).  Fare between each station is $2. A passenger input

how to write a function of area of a circle using python

We have discussed that the above Dijkstra's single source shortest-path algorithm works for graphs along with non-negative edges (like road networks). Given two scenarios can emerg