MYLAB MATH FOR EXCURSIONS IN MATHEMATIC
9th Edition
ISBN: 9780136415893
Author: Tannenbaum
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 8, Problem 63E
You have
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Scott and Associates, Inc., is an accounting firm that has three new clients. Project leaders will be assigned to the three clients.
Based on the different backgrounds and experiences of the leaders, the various leader-client assignments differ in terms of
projected completion times. The possible assignments and the estimated completion times in days are as follows.
Client
Project Leader
Jackson
Elis
Smith
22 24 24
(a) Develop a network representation of this problem. (Submit a file with a maximum size of 1 MB.)
This answer has not been graded yet
Min
(b) Formulate the problem as a linear program. (Express your answers in the form x, where x, represents the completion time
from leader / to client J.)
st.
Jackson
Elis
Smith
Client 1
Client 2
Client 3
x20 for all, J.
Solve
Relationship Assignment Time (days)
"11
*12
*13
*21
10 16 32
*22
*31
*32
711
What is the total time required (in days)?
days
In solving a problem where 100 different products (100 real variables) are produced using just two resources (2 slack variables), then the combination that will yield the optimal profis
A. to produce all 100 products if both resources are used to full capacity.
B. to produce, at most 2 products.
C. none of the choices are correct.
D. to produce only one product.
A service has five tasks, performed in sequence. In the instance when there is more than one worker assigned to a task, each worker performs the entire task and they both can be working on different “items” at the same time.
Task
Task time per worker
Number of workers
1
2 minutes
1
2
6 minutes
1
3
14 minutes
2
4
4 minutes
1
5
15 minutes
3
What is the capacity (hourly) of the process as a whole?
What is the bottleneck of the process?
What is the throughput time (assuming no wait time)?
Where would you expect customers to wait?
Chapter 8 Solutions
MYLAB MATH FOR EXCURSIONS IN MATHEMATIC
Ch. 8 - For the digraph shown in Fig. 8-25, find a.the...Ch. 8 - For the digraph shown in Fig. 8-26, find Figure...Ch. 8 - For the digraph in Fig. 8-25, find a.all path of...Ch. 8 - For the digraph in Fig. 8-26, find a.a path of...Ch. 8 - For the digraph in Fig. 8-25, find a.all cycles of...Ch. 8 - For the digraph in Fig. 8-26, find a.all cycles of...Ch. 8 - Prob. 7ECh. 8 - For the digraph in Fig.8-26, find a.all vertices...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...Ch. 8 - a.Draw a digraph with vertex-set V={A,B,C,D} and...
Ch. 8 - Prob. 11ECh. 8 - Consider the digraph with vertex-set V={V,W,X,Y,Z}...Ch. 8 - Prob. 13ECh. 8 - Prob. 14ECh. 8 - Prob. 15ECh. 8 - A mathematics textbook consists of 10 chapters....Ch. 8 - Prob. 17ECh. 8 - The digraph in Fig. 8-29 is an example of a...Ch. 8 - Prob. 19ECh. 8 - Wobble, a start-up company, is developing a search...Ch. 8 - A project consists of eight tasks labeled A...Ch. 8 - A project consists of eight tasks labeled A...Ch. 8 - Prob. 23ECh. 8 - Prob. 24ECh. 8 - Prob. 25ECh. 8 - A ballroom is to be set up for a large wedding...Ch. 8 - Prob. 27ECh. 8 - Prob. 28ECh. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Prob. 31ECh. 8 - Exercises 29 through 32 refer to a project...Ch. 8 - Prob. 33ECh. 8 - Exercises33 and 34 refer to the Martian Habitat...Ch. 8 - Prob. 35ECh. 8 - Prob. 36ECh. 8 - Prob. 37ECh. 8 - Using the priority list G,F,E,D,C,B,A, schedule...Ch. 8 - Prob. 39ECh. 8 - Using the priority list G,F,E,D,C,B,A, schedule...Ch. 8 - Prob. 41ECh. 8 - Prob. 42ECh. 8 - Prob. 43ECh. 8 - Use the decreasing-time algorithm to schedule the...Ch. 8 - Prob. 45ECh. 8 - Use the decreasing-time algorithm to schedule the...Ch. 8 - Prob. 47ECh. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project described by the digraph...Ch. 8 - Consider the project digraph shown in Fig.8-40....Ch. 8 - Consider the project digraph shown in Fig.8-40....Ch. 8 - Prob. 53ECh. 8 - Consider the project digraph shown in Fig.8-41....Ch. 8 - Schedule the Apartments Unlimited project given in...Ch. 8 - Schedule the project given in Exercise26 Table8-5...Ch. 8 - Consider the project described by the project...Ch. 8 - Consider the project digraph shown in Fig.8-43,...Ch. 8 - Prob. 59ECh. 8 - Symmetric and totally asymmetric digraphs. A...Ch. 8 - Prob. 61ECh. 8 - Let W represent the sum of the processing times of...Ch. 8 - You have N=2 processors to process M independent...Ch. 8 - You have N=3 processors to process M independent...Ch. 8 - You have N=2 processor to process M+1 independent...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Suppose the coal and steel industries form a closed economy. Every $1 produced by the coal industry requires $0.30 of coal and $0.70 of steel. Every $1 produced by steel requires $0.80 of coal and $0.20 of steel. Find the annual production (output) of coal and steel if the total annual production is $20 million.arrow_forward23. Consider a simple economy with just two industries: farming and manufacturing. Farming consumes 1/2 of the food and 1/3 of the manufactured goods. Manufacturing consumes 1/2 of the food and 2/3 of the manufactured goods. Assuming the economy is closed and in equilibrium, find the relative outputs of the farming and manufacturing industries.arrow_forward2. Suppose that in Example 2.27, 400 units of food A, 500 units of B, and 600 units of C are placed in the test tube each day and the data on daily food consumption by the bacteria (in units per day) are as shown in Table 2.7. How many bacteria of each strain can coexist in the test tube and consume all of the food? Table 2.7 Bacteria Strain I Bacteria Strain II Bacteria Strain III Food A 1 2 0 Food B 2 1 3 Food C 1 1 1arrow_forward
- If during the following year it is predicted that each comedy skit will generate 30 thousand and each musical number 20 thousand, find the maximum income for the year. A television program director must schedule comedy skits and musical numbers for prime-time variety shows. Each comedy skit requires 2 hours of rehearsal time, costs 3000, and brings in 20,000 from the shows sponsors. Each musical number requires 1 hour of rehearsal time, costs 6000, and generates 12,000. If 250 hours are available for rehearsal and 600,000 is budgeted for comedy and music, how many segments of each type should be produced to maximize income? Find the maximum income.arrow_forwardRoss White’s machine shop uses 2500 brackets during the course of a year, and this usage is relatively constant throughout the year. These brackets are purchased from a supplier 100 miles away for $15 each, and the lead time is 2 days. The holding cost per bracket per year is $1.50 (or 10% of the unit cost) and the ordering cost is $18.75. There are 250 working days per year. i) What is Ross White’s optimal order quantity? ii) What is the company’s total cost of inventory?arrow_forwardWhat is the value proposition of parallel processing in R?arrow_forward
- During each 6-hour period of the day, the Bloomington Police Department needs at least the number of policemen shown in the following table. Policemen can be hired to work either 12 consecutive hours or 18 consecutive hours. Policemen are paid $15 per hour for each of the first 12 hours a day they work and are paid $22.5 per hour for each of the next 6 hours they work in a day. Formulate an LP that can be used to minimize the cost of meeting Bloomington’s daily police requirements and solve it via Excel. Time Period Number of required policemen 12:00AM----6:00AM 12 6:00AM----12:00PM 8 12:00PM----6:00PM 6 6:00PM----12:00AM 15arrow_forwardthat the amounts of time (in minutes) required for assembling the frames, installing the wheels, and decorating for the Starstreak and Superstreak models are as given in the following table: Frame Wheels Decoration Starstreak 25 6. 16 Superstreak 14 9 12 Assume also that each day the company has available 135 hours of labor for assembling frames, 95 hours of labor for installing wheels, and 110 hours of labor for decoration. Assume also that the profit on each Starstreak bike is $22.00 and the profit on each Superstreak bike is $26.00. How many bikes of each type should the company make in order maximize its profit?arrow_forwardthankyouarrow_forward
- Five workers are available to perform four jobs. The time it takes each worker to perform each job is given in the following table. The goal is to assign workers to jobs so as to minimize the total time required to perform the five jobs: Time Worker Job 1 Job 2 Job 3 Job 4 Job 5 1 10 15 10 15 16 2 12 8 20 16 14 3 12 9 12 18 22 4 6 12 15 18 8 5 16 12 8 12 8 Which worker should be assigned to which job? What is the total time required? (Hint: Use the Assignment model). If there are only 4 jobs (assume that job 5 is not required), how would the workers be assigned to jobs? (Hint: Change the constraints in the Assignment model).arrow_forwardA service has five tasks, performed in sequence. In the instance when there is more than one worker assigned to a task, each worker performs the entire task and they both can be working on different “items” at the same time. Task Task time per worker Number of workers 1 2 minutes 1 2 6 minutes 1 3 14 minutes 2 4 4 minutes 1 5 15 minutes 3 What is the capacity (hourly) of the process as a whole? Capacity= Time available/ Task Timearrow_forwardSolve the following Integer Programming problem using the branch and bound algorithm. Choose x1 as branching variable in the first branching. n=5, s=13.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage LearningCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY
Optimization Problems in Calculus; Author: Professor Dave Explains;https://www.youtube.com/watch?v=q1U6AmIa_uQ;License: Standard YouTube License, CC-BY
Introduction to Optimization; Author: Math with Dr. Claire;https://www.youtube.com/watch?v=YLzgYm2tN8E;License: Standard YouTube License, CC-BY