Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)

3rd Edition

ISBN: 9780134689555

Author: Edgar Goodaire, Michael Parmenter

Publisher: PEARSON

See similar textbooks

Videos

Textbook Question

Chapter 11.5, Problem 2E

[BB] The construction of a certain part in an automobile engine involves four activities: pouring the mold, calibration, polishing, and inspection. The mold is poured first; calibration must occur before inspection. Pouring the mold takes 8 units of time, calibration takes 3 units, polishing takes 6 units for an uncalibrated product and 8 units for a calibrated one, and inspection takes 2 units of time for a polished product and 3 units for an unpolished one.

What type of scheduling problem is this (type I or I I )? Why? Represent the paths to completion of this job by drawing the appropriate directed network.
What is the shortest time required for this job? Describe the critical path.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 11.5, Problem 1E

Chapter 11.5, Problem 3E

Chapter 11 Solutions

Discrete Mathematics with Graph Theory (Classic Version) (3rd Edition) (Pearson Modern Classics for Advanced Mathematics Series)

Ch. 11.1 - Prob. 1TFQ Ch. 11.1 - Prob. 2TFQ Ch. 11.1 - Prob. 3TFQ Ch. 11.1 - In a graph G with two odd vertices, 1 and 2 , the...Ch. 11.1 - If a graph G has six odd vertices, to solve the...Ch. 11.1 - Prob. 6TFQ Ch. 11.1 - Prob. 7TFQ Ch. 11.1 - In the weighted graph the Chinese Postman Problem...Ch. 11.1 - Prob. 9TFQ Ch. 11.1 - In the unweighted graph n, n odd, the Chinese...

Ch. 11.1 - Solve the Chinese Postman Problem for each of the...Ch. 11.1 - Prob. 2E Ch. 11.1 - 3. [BB] Solve the Chinese Postman Problem for the...Ch. 11.1 - In a graph G with two odd vertices, 1 and 2 , the...Ch. 11.1 - Solve the Chinese Postman Problem for each of the...Ch. 11.1 - Prob. 6E Ch. 11.1 - Prob. 7E Ch. 11.1 - Solve the Chinese Postman Problem for the weighted...Ch. 11.1 - Prob. 9E Ch. 11.1 - Prob. 10E Ch. 11.1 - Prob. 11E Ch. 11.1 - Prob. 12E Ch. 11.2 - Prob. 1TFQ Ch. 11.2 - Prob. 2TFQ Ch. 11.2 - Prob. 3TFQ Ch. 11.2 - Prob. 4TFQ Ch. 11.2 - Prob. 5TFQ Ch. 11.2 - Prob. 6TFQ Ch. 11.2 - Prob. 7TFQ Ch. 11.2 - Prob. 8TFQ Ch. 11.2 - Prob. 9TFQ Ch. 11.2 - Prob. 10TFQ Ch. 11.2 - Prob. 1E Ch. 11.2 - Prob. 2E Ch. 11.2 - Prob. 3E Ch. 11.2 - Prob. 4E Ch. 11.2 - Prob. 5E Ch. 11.2 - Prob. 6E Ch. 11.2 - Prob. 7E Ch. 11.2 - Prob. 8E Ch. 11.2 - Prob. 9E Ch. 11.2 - Prove Theorem 11.2.4: A digraph is Eulerian if and...Ch. 11.2 - Prob. 11E Ch. 11.2 - Prob. 12E Ch. 11.2 - 13. Label the vertices of each pair of digraphs in...Ch. 11.2 - 14. Consider the digraphs , shown. (a) Find the...Ch. 11.2 - The answers to exercises marked [BB] can be found...Ch. 11.2 - In each of the following cases, find a permutation...Ch. 11.2 - Prob. 17E Ch. 11.2 - Prob. 18E Ch. 11.2 - [BB] if a graph G is connected and some...Ch. 11.2 - Prob. 20E Ch. 11.2 - Prob. 21E Ch. 11.2 - Prob. 22E Ch. 11.2 - Prob. 23E Ch. 11.2 - [BB] Apply the original form of Dijkstras...Ch. 11.2 - Prob. 25E Ch. 11.2 - Prob. 26E Ch. 11.2 - Prob. 27E Ch. 11.2 - Prob. 28E Ch. 11.2 - [BB] The Bellman-Ford algorithm can be terminated...Ch. 11.2 - Prob. 30E Ch. 11.2 - Prob. 31E Ch. 11.2 - Prob. 32E Ch. 11.2 - Prob. 33E Ch. 11.3 - Prob. 1TFQ Ch. 11.3 - Prob. 2TFQ Ch. 11.3 - Prob. 3TFQ Ch. 11.3 - Prob. 4TFQ Ch. 11.3 - Prob. 5TFQ Ch. 11.3 - Prob. 6TFQ Ch. 11.3 - Prob. 7TFQ Ch. 11.3 - Prob. 8TFQ Ch. 11.3 - Prob. 9TFQ Ch. 11.3 - Prob. 1E Ch. 11.3 - Prob. 2E Ch. 11.3 - Prob. 3E Ch. 11.3 - Prob. 4E Ch. 11.3 - Prob. 5E Ch. 11.4 - Prob. 1TFQ Ch. 11.4 - Prob. 2TFQ Ch. 11.4 - Prob. 3TFQ Ch. 11.4 - Prob. 4TFQ Ch. 11.4 - Prob. 5TFQ Ch. 11.4 - Prob. 6TFQ Ch. 11.4 - Prob. 7TFQ Ch. 11.4 - Prob. 8TFQ Ch. 11.4 - Prob. 9TFQ Ch. 11.4 - Prob. 10TFQ Ch. 11.4 - Prob. 1E Ch. 11.4 - Prob. 2E Ch. 11.4 - Prob. 3E Ch. 11.4 - Prob. 4E Ch. 11.4 - Prob. 5E Ch. 11.4 - Prob. 6E Ch. 11.4 - Prob. 7E Ch. 11.4 - Prob. 8E Ch. 11.4 - Prob. 9E Ch. 11.4 - Prob. 10E Ch. 11.4 - Prob. 11E Ch. 11.4 - Prob. 12E Ch. 11.5 - Prob. 1TFQ Ch. 11.5 - Prob. 2TFQ Ch. 11.5 - Prob. 3TFQ Ch. 11.5 - Prob. 4TFQ Ch. 11.5 - Prob. 5TFQ Ch. 11.5 - Prob. 6TFQ Ch. 11.5 - Prob. 7TFQ Ch. 11.5 - Prob. 8TFQ Ch. 11.5 - Prob. 9TFQ Ch. 11.5 - 10. In a type scheduling problem, a vertex that...Ch. 11.5 - Prob. 1E Ch. 11.5 - [BB] The construction of a certain part in an...Ch. 11.5 - Prob. 3E Ch. 11.5 - Prob. 4E Ch. 11.5 - Prob. 5E Ch. 11.5 - 6.(a) Find two different orientations on the edges...Ch. 11.5 - Prob. 7E Ch. 11.5 - 8. Repeat Exercise 7 if, in addition to all the...Ch. 11.5 - Repeat Exercise 7 if A takes 6 months to complete...Ch. 11.5 - Prob. 10E Ch. 11.5 - Prob. 11E Ch. 11.5 - Prob. 12E Ch. 11.5 - Prob. 13E Ch. 11.5 - Prob. 14E Ch. 11.5 - Prob. 15E Ch. 11.5 - Prob. 16E Ch. 11.5 - 17. The computer systems manager in mathematics...Ch. 11 - Solve the Chinese Postman Problem for the two...Ch. 11 - Prob. 2RE Ch. 11 - 3. Solve the Chinese Postman Problem for the...Ch. 11 - Prob. 4RE Ch. 11 - Prob. 5RE Ch. 11 - Prob. 6RE Ch. 11 - Prob. 7RE Ch. 11 - Prob. 8RE Ch. 11 - Prob. 9RE Ch. 11 - 11. Let and assume that the complete graph has...Ch. 11 - Prob. 11RE Ch. 11 - Prob. 12RE Ch. 11 - Prob. 13RE Ch. 11 - Prob. 14RE Ch. 11 - Use a version of Dijkstras algorithm to find a...Ch. 11 - Prob. 16RE Ch. 11 - Prob. 17RE Ch. 11 - Prob. 18RE Ch. 11 - Prob. 19RE Ch. 11 - 20. The following chart lists a number of tasks...Ch. 11 - Prob. 21RE

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.

Solution Summary: The author explains the difference between type 1 and type 2 scheduling problems. The graph above can be directly observed to give an important passage.

Videos

Want to see the full answer?

Chapter 11 Solutions