I need detailed answer with appendice A1, thanks a lot QUESTION 2 [45 pts]You are scheduling production of your popular Rustic Coffee Table. The table requires a top, fourlegs, 1/8 gallon of stain, 1/16 gallon of glue, 2 short braces between the legs and 2 long bracesbetween the legs, and a brass cap that goes on the bottom of each leg. You have 100 gallons ofglue in inventory, but none of the other components. All items except the brass caps, stain, andglue are ordered on a lot-for-lot basis. The caps are purchased in quantities of 1,000, stain and glueby the gallon. Lead time is 1 day for ach item.COFFEE TABLETopGlueBase AssemblyShortbracesLong LøgsbracesBrass Capsa) Schedule the order releases necessary to produce 640 coffee tables on days 5 and 6, and128 on days 7 and 8. (See Appendix A1.)Stain APPENDICESA1. Example MRP FormLeadLow-LotOn Safety Allo-LevelSizeTime(ofperiods)Hand Stock cated CodeItemIDGross Requirements.Scheduled ReceiptsProjected On Hand.Net RequirementsPlanned Order ReceiptsPlanned Order ReleasesGross RequirementsScheduled ReceiptsProjected On HandNet RequirementsPlanned Order ReceiptsPlanned Order Releases iGross RequirementsScheduled Receipts.Projected On HandNet RequirementsPlanned Order ReceiptsPlanned Order ReleasesGross RequirementsScheduled Receipts.Projected On Hand.Net RequirementsPlanned Order ReceiptsPlanned Order ReleasesGross RequirementsScheduled ReceiptsProjected On HandNet RequirementsPlanned Order ReceiptsPlanned Order Releases23Period (week, day)45678

Answered: Image /qna-images/answer/2d1dd387-a8d2-4120-9002-fa8978df18e9.jpg

You are scheduling production of your popular Rustic Coffee Table. The table requires a top, four legs, 1/8 gallon of stain, 1/16 gallon of glue, 2 short braces between the legs and 2 long braces between the legs, and a brass cap that goes on the bottom of each leg. You have 100 gallons of glue in inventory, but none of the other components. All items except the brass caps, stain, and glue are ordered on a lot-for-lot basis. The caps are purchased in quantities of 1,000, stain and glue by the gallon. Lead time is 1 day for ach item. COFFEE TABLE Top Glue Base Assembly Short Logs Long braces braces Brass Caps a) Schedule the order releases necessary to produce 640 coffee tables on days 5 and 6, and 128 on days 7 and 8. (See Appendix A1.) Stain

You are scheduling production of your popular Rustic Coffee Table. The table requires a top, four legs, 1/8 gallon of stain, 1/16 gallon of glue, 2 short braces between the legs and 2 long braces between the legs, and a brass cap that goes on the bottom of each leg. You have 100 gallons of glue in inventory, but none of the other components. All items except the brass caps, stain, and glue are ordered on a lot-for-lot basis. The caps are purchased in quantities of 1,000, stain and glue by the gallon. Lead time is 1 day for ach item. COFFEE TABLE Top Glue Base Assembly Short Logs Long braces braces Brass Caps a) Schedule the order releases necessary to produce 640 coffee tables on days 5 and 6, and 128 on days 7 and 8. (See Appendix A1.) Stain

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter9: Integer Programming

Section9.2: Formulating Integer Programming Problems

Problem 24P

See similar textbooks

Similar questions

Question 2: A television director has to schedule commercials during 6 time slots allocated to commercials during the national telecast of the first period of a Seattle Kraken hockey game (Canucks Sucks). (a) In how many ordered ways can the television director schedule 6 different commercials during the 6 time slots? (b) In how many ways can the television director fill the 6 time slots allocated to commercials, if there are 4 different commercials, of which a given one is to be shown 3 times while each of the others is to be shown once? (c) As in (b) except the commercial shown three times can’t be shown before or after itself (i.e., not consecutively). How many ways can the television director fill the 6 time slots?
I'm having a difficult time with this problem. Could you lend me a hand in understanding it? I'd appreciate a step-by-step explanation, along with insights into how you arrived at the solution. here is the question I need help with:4.3 Let ALLDFA = {<A> | A is a DFA and L(A) = Σ∗ }. Show that ALLDFA is decidable
79. One way to ensure that the circular wait condition never holds is to : a. impose a total ordering of all resource types and to determine whether one precedes another in the ordering b. to never let a process acquire resources that are held by other processes c. to let a process wait for only one resource at a time d. all of the mentioned
I don't need a code for these questions. I just need them answered Nine steel specimens were submerged in seawater at various temperatures, and the corrosion rates were measured. The results are presented in the following table:Temperature (OC)Corrosion(mm/yr.)26.6 1.5826 1.4527.4 1.1321.7 0.9614.9 0.9911.3 1.0515 0.828.7 0.688.2 0.59a. Construct a scatterplot of corrosion (y) vs. temperature (x). Verify that a linear model is appropriate.b. What is the least-square line (trendline/regression line) for predicting corrosion from temperature?c. Two steel specimens whose temperatures differ by 10OC are submerged in seawater. By how much would you predict their corrosion rates differ?d. Predict the corrosion rate for steel submerged in seawater at a temperature of 20OC.e. Construct a table with predicted values from the original dataset.f. Compute the residuals. Which point has the residual with the largest magnitude?g. What is the correlation between temperature and corrosion rate? What…
Fill the plank
a) A material recovery facility was designed to process 100 ton/day recyclable materials. 4 % of recyclable materials are presorted and bulky items are removed. Manual sorting rate is given as 2 tons/sorter.h. If the manual sorting unit is operated for 6 hours per day, how many sorters (worker) will be needed for the manual sorting processes?b) List the alternative manual sorting techniques. If there are stations on both side of the belt, which technique can be used for sorting? Explain your reasoning.
Following on your job in modelling the employee assignments from the previous practical, you’ve now obtained the following business rules: One Employee supervises Many Employees, and possibly none, and a max of 20. One Employee is supervised by One Employee, and not none. One Employee takes on Many Assignments, and possibly none. One Assignment is taken on by One Employee, and not none. One Assignment takes place in One Section, and not none. One Section appears in Many Assignments, and possibly none. One Section belongs to One Building, and not none. One Building has Many Sections, and possibly none, and a max of 20. You have also been given a small sample of their records, in case this may prove useful. It is below. Assignment No Date Employee No Employee Section Section N Building Start End Supervisor No Building N 8 22/08/2013 2111 B. Johns G1 Canteen G Willis 12h00 19h00 2321 2 9 23/08/2013 2111 B. Johns F3…
2. A certain company gives commission to each of their salesmen based from the type of appliance sold andthe price of the appliance. Below are the given rates that will be used in computing for the salesman’scommission:If type is Commission is2, 5, 6 15% of the price4, 8, 10 20% of the price3, 1, 9,7 25% of the priceInput salesman’s name, type of appliance sold, and price of the appliance. Compute and print thesalesman’s commission.
(a) Suppose there are seven finals to be scheduled. Suppose that the following pairs of courses have common students: 1 and 2, 1 and 3, 2 and 3, 2 and 4, 2 and 5, 2 and 7, 3 and 4, 3 and 6, 3 and 7, 4 and 5, 4 and 6, 5 and 6, 5 and 7, and 6 and 7. How the final exams can be scheduled so that no student has two exams at the same time?
Explain how to solve the {0, 1}-knapsack problem using dynamic programming. You are given n objects which cannot be broken into smaller pieces. Moreover, you have only one copy of each object. Each object i (where 1 ≤ i ≤ n) has an integer weight wi > 0 and a value vi > 0. You have a knapsack that can carry a total weight not exceeding W. Your goal is to fill the knapsack in a way that maximizes the total value of the included objects, while respecting the capacity constraint. For each object i (where 1 ≤ i ≤ n), either you bring it or not. 1. Write a recursion for the optimal solution and explain why it is correct. Make sure you define the notation you are using. 2. Consider the following input and fill the table corresponding to the recursion you found in #1: n = 6, w1 = 2, w2 = 2, w3 = 3, w4 = 2, w5 = 5, w6 = 4, v1 = 17, v2 = 2, v3 = 1, v4 = 1, v5 = 18, v6 = 11 and W = 12. Moreover, give all optimal solutions.
5. Use the following bill-of-materials (BOM) to answer the questions(LT means lead time). A LT = 2 (20 points) D (2) LT=3 K (3) LT = 2 1) How many units of E are required to produce 10 units of Product A? 2) How many units of K are required to produce 10 units of Product A? 3) Suppose we have 10 units A. 30 units D in warehouse, to produce 50 units A, how many units K required? E (1) LT=4 F (3) LT=2 i s
41. Which of the following statements is not true for the deadlock prevention and deadlock avoidance schemes? a. Deadlock avoidance is less restrictive than deadlock prevention. b. In deadlock prevention, the request for resources is always granted, if the resulting state is safe. c. It is the priority to have the knowledge of resource requirements for deadlock avoidance. d. In deadlock avoidance, the request for resources is always granted, if the resulting state is safe.