Answered: 2. Solve this resource scheduling…

Name: I can complete the network diagrams but once I get to the 2nd part of
Uploaded: 2024-03-20T06:57:05.000Z
Channel: Bartleby
Description: I can complete the network diagrams but once I get to the 2nd part of this problem I get very confused. I'm not sure how you know which activites go first before other with resources and some of my numbers do not add up. 2. Solve this resource schedu

Business

Operations Management

2. Solve this resource scheduling problem with the series method. The resource limits are as follows: 4C and 3L. 画画國睡種 10

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter5: Network Models

Section: Chapter Questions

Problem 67P

See similar textbooks

Similar questions

A toy manufacturer preparing a production schedule for two new toys, trucks spinning tops,must use the information concerning their construction times below.Machine A Machine B FinishTruck 2hr 3hr 5hrSpinning Top 1hr 1hr 1hrFor example, each truck requires 2 hours on machine A. The available employee hours per weekare as follows: For operating machine A; 80 hours; for B, 50 hours; for finishing 70 hours. If theprofits on each truck and spinning top are R7 and R2, respectively, how many of each toyshould be made per week to maximize profit? What is the maximum profit?
what is the dual equivalent and the final tableau of the given primal linear programming model?Min Y₀ = 10Y₁ + 8Y₂s.t.Y₁ + 2Y₂ ≥ 52Y₁ - Y₂ ≥ 12Y₁ + 3Y₂ ≥ 4Y₁ ≥ 0, Y₂ is unrestrictedprove or disprove the complementary slackness theorem.
An XYZ company has a W, H, O plant with a monthly production capacity of 60 tons, 50 tons, and 42 tons, respectively; and has 3 sales warehouses in cities A, B, C, D Where each warehouse has a monthly requirement of 30 tons, 34 tons, 44 tons and 25 tons. With shipping cost W to ABCD = IDR 12,000,-, IDR. 8.000,-, Rp. 12.000,-, Rp. 14,000,-; H to A B C D = Rp. 8.000,-, Rp. 18.000,-, Rp. 10,000,-, Rp. 6.000,-; and O to ABCD = Rp. 16.000,-, Rp. 16.000,-, Rp. 2,000, Rp. 10,000,-. Please calculate using Vogel's Approximation Method or VAM Question a. What is the best transportation model in your opinion to solve the above problems? b. What is the minimum transportation cost to solve the shipping transportation problem! c. Based on these calculations, give suggestions regarding the transportation model and the amount of costs incurred by the company!
Please note that this question is different from what you have in your library. This question has 3 variables ie 3 departments. Please help solve the problem. A co markets 2 products which are produced in 3 successive departments. The contribution per unit of the 2 products and the production capacity of the 3 departments are X. Y Contribution. 10. 15 Machining dept (hrs) 3. 4 Foundry dept (hrs) 4 2 Painting dept (hrs) 4 5 A constraint on production is that each dept has a limited number of hours available for the forthcoming plan period as shown below: Department. Available hours Machining. 1'200 Foundry. 1000 Painting. 1300 Required- 1. Formulate the linearr programming problem for the above information. 2. Solve them graphically
At a machine tool plant, five jobs must be completedeach day. The time it takes to do each job depends on themachine used to do the job. If a machine is used at all, thereis a setup time required. The relevant times are given inTable 20. The company’s goal is to minimize the sum of thesetup and machine operation times needed to complete alljobs. Formulate and solve (with LINDO, LINGO, or ExcelSolver) an IP whose solution will do this. Machine 1 2 3 4 5 Time (Minutes)1 42 70 93 X X 302 X 85 45 X X 403 58 X X 37 X 504 58 X 55 X 38 605 X 60 X 54 X 20
ou are given a linear programming problem. Maximize P = 3x + 3y subject to 5x + 3y ≤ 30 Resource 1 2x + 3y ≤ 21 Resource 2 x ≤ 4 Resource 3 y ≥ 0 x ≥ 0 (a) Use the method of corners to solve the problem. The maximum is P = at (x, y) = . (b) Suppose P = cx + 3y. Find the range of values that the coefficient c of x can assume without changing the optimal solution. ≤ c ≤ (c) Find the range of values that Resource 1 can assume. ≤ (Resource 1) ≤ (d) Find the shadow price for Resource 1.
Explain all the steps when implementing the Branch and Bound method for the following optimization problem: Max 15*x1+12*x2+4*x3+2*x4 s.t. 8*x1+5*x2+3*x3+2*x4 <=10 3*x1+2*x3<=4 x1, x2, x3, x4 binary
Max 30x1 x2 s.t. 2x1 x2 ≤ 4 2x1 2x2 ≤ 6 x1, x2 ≥ 0 (a) Solve graphically and state the optimal solution. (b) Keeping all the other data as is, what per unit profitability should the product, whose current optimal value is zero, have in order that this product enter the optimal solution at a positive level? (c) How many optimal corner solutions exist after making the change described in part (b)? What are they? (d) In the original problem, how much can the right-hand side (RHS) of the second constraint be increased (or decreased) before the optimal solution is changed? (e) Answer part (d) for the RHS of the first constraint. (f) How do you explain the difference between parts (d) and (e)? (g) What will be the impact of adding the constraint 4x1 x2 = 4 to the original model? (h) What is the impact (on the optimal solution) of adding the constraint 3x1 3x2 ≤ 15 to the original model? (i) Fill in the blanks: The difference between parts (g) and (h) is that the original optimal solution…
Barb’s Beach Bar operates seven days per week. Barb usesonly full-time employees and wants each employee to have twoconsecutive days off each week. She believes that she needs aminimum of three employees on Monday, Tuesday, Wednesday,Th ursday, and Sunday. On Friday and Saturday, she believes thatshe needs six employees. Develop a workforce schedule for Barb.
The following information relates to Questions 10-11: The production planner for Rienzo, Inc. produces two chemicals: Alpha (A) and Delta (D). Two of his resources are constrained: Jaya, of which he can get at most 8,400 litres per week; and Sanga, of which he can get at most 4,600 litres per week. Each unit of Alpha chemical requires 16 litres of Jaya and 7 litres of Sanga, while a unit of Delta chemical uses 8 litres of each type of raw material. Profits for the Alpha blend are £3.00 per unit, and profits for the Delta blend are £5.00 per unit. Question 10 What is the objective function? A £1 A + £5 D = Z B £8 A + £16 D = Z C I do not wish to answer this question. D £3 A + £5 D = Z E £16 A + £8 D = Z F £7 A + £8 D = Z
The Swift Corporation wants to schedule the following seven-job problem to be processedon two machines A and B. Each job must be processed by two machines A and B, firston machine A and then machine B. The operation processing times at machine A and Bare as follows: Jobi 1 2 3 4 5 6 7 Processing time on machine A (ai) 9 8 7 12 6 8 15 Processing time on machine B (bi) 6 5 7 19 12 11 7 Suppose jobs arrived in their natural order (i.e., job l before job 2, etc.), and FIFOsystems of scheduling and processing the jobs is used. What is the completion timeof each job and what is the total throughput time (makespan) of all jobs?
An electronics firm has a contract to deliver thefollowing number of radios during the next three months;month 1, 200 radios; month 2, 300 radios; month 3, 300radios. For each radio produced during months 1 and 2, a$10 variable cost is incurred; for each radio produced duringmonth 3, a $12 variable cost is incurred. The inventory costis $1.50 for each radio in stock at the end of a month. Thecost of setting up for production during a month is $250. Radios made during a month may be used to meet demandfor that month or any future month. Assume that productionduring each month must be a multiple of 100. Given thatthe initial inventory level is 0 units, use dynamicprogramming to determine an optimal production schedule.