Develop a material requirements plan, Data Structure & Algorithms

Assignment Help:

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.

 

 

 


Related Discussions:- Develop a material requirements plan

Algorithmic implementation of multiple stacks, So far, we now have been con...

So far, we now have been concerned only with the representation of single stack. What happens while a data representation is required for several stacks? Let us consider an array X

Determine about the unreachable code assertion, Determine about the unreach...

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

General, whats the definition of ADT and data type?

whats the definition of ADT and data type?

The complexity ladder, The complexity Ladder: T(n) = O(1). It is ca...

The complexity Ladder: T(n) = O(1). It is called constant growth. T(n) does not raise at all as a function of n, it is a constant. For illustration, array access has this c

Compare and contrast various sorting techniques, Q. Compare and contrast va...

Q. Compare and contrast various sorting techniques or methods with respect to the memory space and the computing time.

Which sorting methods sorting a list which is almost sorted, Which sorting ...

Which sorting methods would be most suitable for sorting a list which is almost sorted  Bubble Sorting method.

Explain arrays, Arrays :- To execute a stack we need a variable called top,...

Arrays :- To execute a stack we need a variable called top, that holds the index of the top element of stack and an array to hold the part of the stack.

Creation of a linked list, Program: Creation of a linked list In the ne...

Program: Creation of a linked list In the next example, wewill look to the process of addition of new nodes to the list with the function create_list(). #include #includ

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd