Excursions in Modern Mathematics
9th Edition
ISBN: 9780134469119
Author: Tannenbaum
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 8, Problem 55E
Schedule the Apartments Unlimited project given in
Table 8-4
| Tasks | Label (P-time) | precedent tasks |
| Bathrooms (clean) | B(2) | P |
| Carpets (shampoo) | C(1) | S, W |
| Filters (replace) | F(0.5) | |
| General cleaning | G(2) | B, F, K |
| Kitchen (clean) | K(3) | P |
| Lights (replace bulbs) | L(0.5) | |
| Paint | P(6) | L |
| Smoke Detectors (battery) | S(0.5) | G |
| Windows (wash) | W(1) | G |
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Use the Nearest Neighbor Algorithm starting at vertex A to estimate the optimal Hamiltonian circuit.
The Hamiltonian circuit which gives an estimate to the optimal solution is.
The estimate for the optimal solution given by the Hamiltonian circuit is.
IMMAGE ATTACHED
Use the Nearest Neighbor Algorithm starting at vertex A to estimate the optimal Hamiltonian circuit.
1. The Hamiltonian circuit which gives an estimate to the optimal solution is .
2. The estimate for the optimal solution given by the Hamiltonian circuit is
IMAGE BELOW
1) What is Maximin Distance Algorithm? Describe the use of it with a math example?
Chapter 8 Solutions
Excursions in Modern Mathematics
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
- An account on server A is more expensive than an account on server B. However, server A is faster. To see if it’soptimal to go with the faster but more expensive server, a manager needs to know how much faster it is. A certaincomputer algorithm is executed 30 times on server A and 20 times on server B with the following results:T-Value = -3.12 P-Value = 0.002 DF = 48Is server A really faster? How strong is the evidence? Formulate the suitable hypothesis and alternative and conclude at5% level of significance.arrow_forwardwe are going to use linear programming to develop a simple machinelearning algorithm to help us classify data points. Training data and Test data.Each of the 20 data points in the training data consists of 2 sensor readings x1, x2 whichare real numbers corresponding to the readout of two sensors during an event and a classi- cation y which is either 0 or 1, 0 indicates the event corresponding to the sensor data wasdetermined to not be a gravitational wave and a 1 indicates the event was determined tobe a gravitational wave. Thus, a typical line in the le looks something like:0.0 78.1 60.6Which indicates the 2 sensors had readings 78.1, 60.6 respectively, and the 0.0 indicatesno gravitational wave was observed. The test data consists again of sensor readings xi but with no classi cation y provided.Your job is to use the training data to develop a model that can take in sensor data andpredict the classi cation (again, 0 or 1). You will then run your model on the 20 points inthe test…arrow_forward1)Answer using either the standard or 2-phase simplex algorithm. 2)give the initial tableau and each further tableau produced during the execution of the algorithm . 3)if it has an optimal solution give solution if not state whyarrow_forward
- Use the Repeated Nearest Neighbor Algorithm to find an approximation for the optimal Hamiltonian circuit. 1. The Hamiltonian circuit given by the Nearest Neighbor Algorithm starting at vertex A is . The sum of it's edges is . 2. The Hamiltonian circuit given by the Nearest Neighbor Algorithm starting at vertex B is . The sum of it's edges is . 3. The Hamiltonian circuit given by the Nearest Neighbor Algorithm starting at vertex C is . The sum of its edges is . 4. The Hamiltonian circuit given by the Nearest Neighbor Algorithm starting at vertex D is . The sum of it's edges is . 5. The Hamiltonian circuit giving the approximate optimal solution using the Repeated Nearest Neighbor Algorithm is . The approximate optimal solution is . IMAGE BELOWarrow_forwardfind the mximum possible order of S5arrow_forwardDraw a network showing the quantities obtained in the final iteration and the optimal value of z.arrow_forward
- Apply Brute force algorithm to find the minimum cost Hamiltonian circuit on the graph belowarrow_forwardPeople are classified as hypertensive if their systolic blood pressure (SBP) is higher than a specified level for their age group, according to the algorithm in the table below. Assume SBP is normally distributed with mean, and standard given in the table for age groups 1 – 14 and 15 – 44, respectively. Define a family as a group of two people in age group 1 – 14 and two people in age group 15 – 44. A family is classified as hypertensive if at least one adult and at least one child are hypertensive. i. What proportion of 1 – 14-year-olds are hypertensive? ii. What proportion of 15 – 44-year-olds are hypertensive?arrow_forwardA systems analyst tests a new algorithm designed to work faster than the currently-used algorithm. Each algorithm is applied to a group of 38 sample problems. The new algorithm completes the sample problems with a mean time of 22.07 hours. The current algorithm completes the sample problems with a mean time of 22.33 hours. Assume the population standard deviation for the new algorithm is 4.674 hours, while the current algorithm has a population standard deviation of 5.185 hours. Conduct a hypothesis test at the 0.05 level of significance of the claim that the new algorithm has a lower mean completion time than the current algorithm. Let ?1be the true mean completion time for the new algorithm and ?2 be the true mean completion time for the current algorithm. Pay attention to spaces between words. H0: Ha: z-Test Statistic (round to two decimal places) = p-value (round to four decimal places) = Conclusion (write "R" for reject H0, and "F" for fail to reject H0):arrow_forward
- Three components are connected to form a system asshown in the accompanying diagram. Because the componentsin the 2–3 subsystem are connected in parallel, thatsubsystem will function if at least one of the two individualcomponents functions. For the entire system to function,component 1 must function and so must the 2–3 subsystem. The experiment consists of determining the condition ofeach component [S (success) for a functioning componentand F (failure) for a nonfunctioning component].a. Which outcomes are contained in the event A thatexactly two out of the three components function?b. Which outcomes are contained in the event B that atleast two of the components function?c. Which outcomes are contained in the event C that thesystem functions?d. List outcomes in C9, A ø C, A ù C, B ø C, andB ù C.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_forwardDerive third order Runge-Kutta method.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
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
Orthogonality in Inner Product Spaces; Author: Study Force;https://www.youtube.com/watch?v=RzIx_rRo9m0;License: Standard YouTube License, CC-BY
Abstract Algebra: The definition of a Group; Author: Socratica;https://www.youtube.com/watch?v=QudbrUcVPxk;License: Standard Youtube License