Excursions In Modern Mathematics, 9th Edition
Excursions In Modern Mathematics, 9th Edition
9th Edition
ISBN: 9780134494142
Author: Tannenbaum
Publisher: PEARSON
bartleby

Videos

Textbook Question
Book Icon
Chapter 8, Problem 63E

You have N = 2 processors to process M independent tasks (i.e., there are no precedence relations at all) with processing 1, 2, 3, …, M. Find the optimal schedule, and give the optimal completion time Opt in terms of M. (Hint: Consider four separate cases based on the remainder when N is divided by 4.)

Blurred answer
Students 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
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?
RVW (Restored Volkswagens) buys 15 used VW's at each of two car auctions each week held at different locations. It then transports the cars to repair shops it contracts with. When they are restored to RVW's specifications, RVW sells 10 each to three different used car lots. There are various costs associated with the average purchase and transportation prices from each auction to each repair shop. Also there are transportation costs from the repair shops to the used car lots. RVW is concerned with minimizing its total cost given the costs in the table below. a. Given the costs below, draw a network representation for this problem. Used Car Lots L2 Repair Shops si 550 600 S2 500 LI L3 500 Auction 1 sI 250 300 Auction 2 450 S2 350 650 450 b. Formulate this problem as a transshipment linear programming model. Report the optimal solution using excel solver. с.

Chapter 8 Solutions

Excursions In Modern Mathematics, 9th Edition

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
Background pattern image
Math
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
Recommended textbooks for you
Text book image
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Text book image
Calculus For The Life Sciences
Calculus
ISBN:9780321964038
Author:GREENWELL, Raymond N., RITCHEY, Nathan P., Lial, Margaret L.
Publisher:Pearson Addison Wesley,
Text book image
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Text book image
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Text book image
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
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