Johnson Cogs wants to set up a line to serve 100 customers per hour. The work elements and their precedence relationships are shown in the following table. What is the theoretical minimum number of workstations to meet the demand? (Enter your response as an integer.) Work Element A BCDEFGHI с J Total Time (sec) 21 20 30 20 4 15 10 8 12 20 160 Immediate Predecessor(s) None A A B B C C D, E F, G H, I

Johnson Cogs wants to set up a line to serve 100 customers per hour. The work elements and their precedence relationships are shown in the following table. What is the theoretical minimum number of workstations to meet the demand? (Enter your response as an integer.) Work Element A BCDEFGHI с J Total Time (sec) 21 20 30 20 4 15 10 8 12 20 160 Immediate Predecessor(s) None A A B B C C D, E F, G H, I

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

A college provides free tutoring services for its students 7 days a week, and the daily requirements for tutors are: Day M T W Th F S Su Requirements 5 4 7 3 6 3 4 Find the minimum number of tutors required if each tutor works 4 days a week and has 3 consecutive days off. Give preference to Saturday and Sunday off in case of a tie. (Hint: Look for group of 3 days with the lowest requirements). Specify the work schedule for each tutor. How much slack does your schedule generate for each day?
Supertronics, Inc., would like to know how the firm’s profit-ability is altered by product mix. Currently, product mix isdetermined by giving priority to the product with the highestper-unit contribution margin (defined as the difference be-tween price and material cost). Details on the Supertronicsproduct line, including processing time at each workstation,follow:a. Assume that Supertronics has 5,500 minutes of capacityavailable at each workstation each week. Develop a linearprogram to define the production mix that maximizescontribution margin.b. Solve your formulation using a computer package such asPOM for Windows. c. Given your solution for part (b), which machine is thebottleneck?d. How would your formulation and solution in part(b) change if 50 units of each product were alreadycommitted to customers and thereby had to beproduced?
Johnson Cogs wants to set up a line to serve 60 customers perhour. The work elements and their precedence relationshipsare shown in the following table.a. What is the theoretical minimum number of stations?b. How many stations are required using the longest workelement decision rule?c. Suppose that a solution requiring five stations is obtained.What is its efficiency?
The Johnny Ho Manufacturing Company inColumbus, Ohio, is putting out four new electronic components. Each of Ho’s four plants has the capacity to add one more prod-uct to its current line of electronic parts. The unit-manufacturing costs for producing the different parts at the four plants areshown in the accompanying table. How should Ho assign the newproducts to the plants to minimize manufacturing costs?ELECTRONICCOMPONENT PLANT123 4C53 $0.10 $0.12 $0.13 $0.11C81 0.05 0.06 0.04 0.08D5 0.32 0.40 0.31 0.30D44 0.17 0.14 0.19 0.15
Maximize profit = 4X + 4Y Subject to: 3X +5Y ≤ 150 X – 2Y ≤ 10 5X + 3Y ≤ 150 X, Y ≥ 0 Required: a- The corner point method to obtain the optimal point. b- Specify the profit value. c- Calculate the Slack for each constraint and state its formula.
Consider the network in the following figure. Edges that are not pictured have a length of ∞. Image attatched (a) What is the optimal TSP tour on this network, and what is its total length, z*? What is the optimal 1-tree Tˆ* on this network (“rooted” at node 1), and what is its total length, z(Tˆ*)? (b) Find the best Held-Karp lower bound you can. That is, find weights to add to one or more nodes so that z* and the right-hand side of the following formula are as close as possible. z* ≥ z(Tˆ*) + SUM{i∈N} λi(di(Tˆ*) − 2) Image attatched Here Tˆ* is the optimal 1-tree under the revised distance matrix, z(Tˆ*) is its cost and di(Tˆ*) is the degree of node i in 1-tree Tˆ*.
1. Transportation costs per ton of product vary with distance. For trucks the function is: TCt = 3+1.25d For rail it is: TCr = 5+d For barge it is: TCb = 6 + 1.1d where d is the distance in hundreds of miles and TC is dollars per ton. Make a table showing the least cost mode of transport for distances d = 1, 2, ...,10. Graph the problem and label the modal break points clearly. No graph paper, max 50% points on assignment.
. David’s Sport Supplies is a store that sells sports equipmentand gear for teenagers and young adults. David’s is in the processof assigning the location of storage areas in its warehouse (Figure10-16) to minimize the number of trips made to retrieve neededitems. Given here in Table 10-14 are the departments that needto be located, the number of trips made per week for eachdepartment, and the area needed by each department.
1. What’s the cycle time for this production line?2. What’s the theoretical minimum number of workstations that should be set up?3. List the paths for this problem.4. Draw the precedence diagram for this problem.5. How many workstations should be set up in this production line?6. Which tasks should be performed in each workstation?7. Draw the diagram of the production line.8. Calculate the efficiency of the production line.
The Doan Modianos Manufacturing Company isputting out seven new electronic components. Each ofModianos'eight plants has the capacity to add one more product to its currentline of electronic parts. The unit manufacturing costs forproducing the different parts at the eight plants are shown in theaccompanying table. How should Modianos assign the new productsto the plants in order to minimize manufacturing costs?
Formulate the following as a linear programmingproblem: A greenhouse operator plans to bid for the job ofproviding flowers for city parks. He will use tulips, daffodils,and flowering shrubs in three types of layouts. A Type 1layout uses 30 tulips, 20 daffodils, and 4 flowering shrubs.A Type 2 layout uses 10 tulips, 40 daffodils, and 3 floweringshrubs. A Type 3 layout uses 20 tulips, 50 daffodils, and 2flowering shrubs. The net profit is $50 for each Type 1layout, $30 for each Type 2 layout, and $60 for each Type 3layout. He has 1,000 tulips, 800 daffodils, and 100 floweringshrubs. How many layouts of each type should be used toyield maximum profit?
Formulate the following as a linear programmingproblem: A greenhouse operator plans to bid for the job ofproviding flowers for city parks. He will use tulips, daffodils,and flowering shrubs in three types of layouts. A Type 1layout uses 30 tulips, 20 daffodils, and 4 flowering shrubs.A Type 2 layout uses 10 tulips, 40 daffodils, and 3 floweringshrubs. A Type 3 layout uses 20 tulips, 50 daffodils, and 2flowering shrubs. The net profit is $50 for each Type 1layout, $30 for each Type 2 layout, and $60 for each Type 3layout. He has 1,000 tulips, 800 daffodils, and 100 floweringshrubs. How many layouts of each type should be used toyield maximum profit?36 Explain how your formulation in Problem 35 changesif both of the following conditions are added:a The number of Type 1 layouts cannot exceed thenumber of Type 2 layouts.b There must be at least five layouts of each type.