Student's Solutions Manual For Excursions In Modern Mathematics Format: Paperback
9th Edition
ISBN: 9780134469133
Author: Tannenbaum, Peter
Publisher: Prentice Hall
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 8, Problem 50E
Consider the project described by the digraph shown in Fig. 8-39, and assume that you are to schedule this project using
a. Use the decreasing-time algorithm to schedule the project. Show the timeline for the project and finishing time
b. Find an optimal schedule. (Hint:
c. Use the relative error formula
Figure 8-39
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
find the mximum possible order of S5
Solve the following linear program graphically:Maximize P = 4X1 + 6X2Subject to X1+ X2 < 6 ---------- (1) (labor)3X1 + 2X2 < 15 --------- (2) (machine time)X1 < 4 ---------- (3) (finishing time)X2 < 5 ---------- (4) (assembly time)Where X1, X2 > 0
Use the Runge-Kutta Fehlberg Algorithm to approximate the solution to
the following initial-value problems.
This is a numerical analysis problem
Chapter 8 Solutions
Student's Solutions Manual For Excursions In Modern Mathematics Format: Paperback
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
- Mo. For each of the following shaded region in Figure 1, can it be the feasible region of a linear program? arrow_forwardIn a lumberjack competition, a contestant is blindfolded and spun around 9 times. The blindfolded contestant then tries to hit the target point in the middle of a horizontal log with an axe. The contestant receives 15 points if his hit is within 3 cm of the target, 10 points if his hit is between 3 cm and 10 cm of the target, 5 points if his hit is between 10 cm and 20 cm of the target, and Zero points if his hit is 20 cm or more away from the target. Let Y record the position of the hit, so that Y=y>0 corresponds to missing the target point to the right by y cm Y=-y<0 corresponds to missing the target to the left by y cm. Assume that Y is normally distributed with mean mu=0 and variance 100 cm2. Find the expected number of points that the contestant wins.arrow_forwardSolve the following linear program graphically:Maximize P = 4X1 + 2X2Subject to X1 + 2X2 < 6 ---------- (1) (machine time)2X1 + 2X2 < 8 ---------- (2) (labor)Where X1, X2 > 0 2. Solve the following linear program graphically:Maximize P = 4X1 + 1X2Subject to 2X1 + 4X2 < 24 ---------- (1) (resource A)6X1 + 3X2 < 36 ---------- (2) (resource B)Xl < 5 ----------- (3) (resource C)2X2 < 10 ----------- (4) (resource D)where X1, X2 > 0arrow_forward
- The call center of a small manufacturer receives calls randomly at an average rate of 9 customers per hour. The arriving calls are answered by a single agent randomly with an average service rate of 12 customers per hour. Answer the following questions assuming that the system can be modeled as an M/M/1 queue. average waiting time in queue (in minutes): minimum integer service rate (number of customers served per hour) such that the average waiting time in queue is less than 7 minutes:arrow_forwardQ2. Suppose you have been appointed the County Executive in charge of finance in your County. You have allocated funding to two projects, Project A and Project B. By coincidence, Project B happens to be located in your Sub- County. Given below are seventy allocations to various activities in both projects (in Kshs Billions). Funding for Project A 96 21 80 38 20 60 21 50 100 15 81 06 55 40 70 70 10 30 30 35 66 53 50 60 80 35 80 55 50 49 51 60 25 90 90 50 95 50 80 65 60 55 20 30 110 65 50 65 60 80 64 50 66 35 40 60 65 50 51 81 36 90 51 80 50 55 80 30 60 96 Funding for Project B 20 66 59 21 101 108 31 65 34 20 35 80 63 36 95 89 61 48 44 25 50 81 68 59 50 15 21 29 54 50 45 55 80 65 40 29 81 20 104 65 51 60 10 45 60 35 96 55 24…arrow_forwardUse the following information for questions 3-6. The columns indicate the number of trains running. Total railroad profits are the total profits to the railroad from running the specified number of trains. Total lost farmer profits are total profits the farmer loses from a specified number of trains running. Trains 1 2 3 Total Railroad Profit $100 $200 $300 Total Lost Profit for Farmer $40 $130 $250 What is the socially optimal number of trains? A. 0 B. 1 C. 2 D. 3arrow_forward
- A sales Director who lives in a city a is required to fly to a regional‘s office and cities BCD in E. The weather graph shows the one-way airfares between any two cities. Use the brunt force method to find the optimal solution. arrow_forwardA mortgage company owns the following 10 mortgages. Investors will purchase packages of mortgages worth at least $1 million. What is the maximum number of such packages that can be created from this set of mortgages? Mortgage 1 2 3 4 5 6 7 8 9 10 Amount (in $1000s) $900 $860 $780 $525 $240 $185 $165 $164 $135 $125 Create a spreadsheet model for this problem and use Solver’s evolutionary algorithm to solve it. What is the optimal solution?arrow_forwardThe dependencies between the 10 activities listed in the table above are as follows:• The project starts with two activities—A, and B—which can be done concurrently.• When activity A is finished, activity C can start• When activity B is finished, activities D and E can start• When both activities C and D are finished, activity F can start• When activity E is finished, activity G can start• When activity F is finished, activity H can start• When both activities G and H are finished, activity I can start• When activity G is finished, activity J can start• The project is complete when activities I and J are finished Questions1. Organize the information above in an activity precedence table showing the activity, precedent and duration (calculated using the PERT weighted average formula and round to the nearest integer).2. Draw an AON network diagram and calculate its early start, early finish, late start and late finish times, floats (Free and total) for each activity. Make sure you…arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
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