6. A shipping building construction project company consists of the following twelvejobs whose precedence relations are identified with their node numbers:Jobs (i-) :13 23 24 3-5 4-6 48 5-6 67-8-1-3 2-3 2-4 3-5 4-6 4-88 9Durations (in| days)10 18 5 10 12 18 10 8 4 10 10 5b.Find critical path and duration of the project.C.Find EST EFT LST and LFTd.Determine Total floats.

Answered: Image /qna-images/answer/99287ff0-c971-4c21-b731-83dd4bbebd29.jpg

Answered: 6. A shipping building construction…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Tigers Sports Club has to select four separate coeddoubles teams to participate in an interclub table tennis tournament.The preselection results in the selection of a group of fourmen- Raul, Jack, Gray, and Ajay- and four women- Barbara,Dona, Stella, and Jackie. Now, the task ahead lies in pair ing thesemen and women in the best fashion. The following table showsa matrix that has been designed for this purpose, indicating howeach of the men complements the game of each of the women.A higher score indicates a higher degree of compatibility in thegames of the two individuals concerned. Find the best pairs.
(1) Find an optimal assignment of trucks to routes to minimize the total cost (using the Hungarian Method). B C 6 12 15 10 11 7 16 9 Truck / Route 1 2 3 4 Step la: Row subtraction (show your steps, e.g., see cell 1A) Truck / Route B 1 2 3 4 A 10 11 9 14 Step 1b: Column subtraction. Truck / Route 1 2 3 4 A 10-6=4 = = = = = B = с = C Step 2: Testing for optimal solution (show your lines covering the zero entries). What is the minimum number of lines required to cover all zeros? D 8 14 10 13 D = = D =
Homework Problem 2(Possible Answer 17) 5 X 12 P 3 Q 5 4 10 R 6 S 10 N Find Maximum flow to Node Z from X.
x # GT E 4. Firewall Project XT. Using the "complexity weighting" scheme shown in Table 5.3 and the function point complexity weight table shown below, estimate the total function point count. Assume historical data suggest five function points equal one person a month and six people can work on the project. I Complexity Weight Table Number of inputs 10 Rated complexity low Number of outputs 20 Rated complexity average Number of inquiries 10 Rated complexity average Number of files 30 Rated complexity high Number of interfaces 50 Rated complexity high a. What is the estimated project duration? Add a caption... Status (51 excluded)
Ross Hopkins, president of Hopkins Hospitality, has developed the tasks, durations, and predecessor relationships in the following table for building new motels. Draw the AON net- work and answer the questions that follow. Time Estimates (in weeks) Immediate Activity Predecessor(s) Optimistic (a) Most Likely (m) Pessimistic (b) 4 8. 10 A 8 24 C A 8 12 16 4 6 10 B 2 4 5 F E, C 6 8 20 G E, C 2 3 4 F F 6 6 D, G, H 4 12 K I, J 3 A. (5 points) Draw AON diagram of the project, including activity durations. B. (4 points) Based on the calculation of estimated times, what is the critical path? C. (4 points) What is the estimated time of the critical path? D. (7 points) What is the activity variance along the critical path? What is the probability of completion of the project before week 38?
21. The following table provides the information necessary to construct a project network and project crash data: Activity (i, j) Activity Predecessor Activity Time (weeks) Normal Crash Activity Cost Normal Crash a (1,2) --- 16 8 $2000 $4400 b (1,3) --- 14 9 1000 1800 c (2,4) a 8 6 500 700 d (2,5) a 5 4 600 1300 e (3,5) b 4 2 1500 3000 f (3,6) b 6 4 800 1600 g (4,6) c 10 7 3000 4500 h (5,6) d, e 15 10 5000 8000 a. Construct the project network b. Manually crash the network to 28 weeks Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.
2. A small restaurant is creating a schedule for its wait staff to meet its expected weekly demand. The staff requirements have been determined to be: day monday tuesday wednesday thursday friday saturday sunday 1 staff 3. 3. The restaurant would like its staff to have two consecutive days off, with a preference given to Saturday and Sunday, or one of those two days if the pair is not possible. (a) Create a schedule to meet the staff requirements. How many wait staff are needed? (b) The restaurant believes regular maintenance of the kitchen is important. The kitchen staff would like 1 extra worker whenever they perform main- tenance. On which days of the week should maintenance be scheduled? (c) The restaurant wants to create a 'kid's day' (young children eat for free) to attract customers on days with low demand. Given your staff schedule, which day is best to implement this promotion.
Minimize Subject to z = 3x + y 3y + 5x > 30 6y + 4x 40 y + x 8 X 0 Y > 0 Solve this using the graphical method. Be sure to clearly show all steps: • Sketch the feasible region ● Determine the corner points Determine the minimum of the objective function ● Upload a picture showing your work here: Choose File No file chosen
Time Immediate Time Immediate Activity (weeks) Predecessor(s) Activity (weeks) Predecessor(s) A 7 4 7 B 3 11 C, E 1 7 D.F Dave's earliest start (ES) and earliest finish (EF) are: Activity ES EF 7 B 10 7 E 11 G 22 20 Dave's latest start (LS) and latest finish (LF) are: Activity LS LF H 15 G 11 F 9 E 7 D 14 A The slack times are: Activity Slack A D E F G H The activities on the critical path are The total project completion time for Dave = weeks.
Please no written by hand solution
At a local university, the Student Commission on Programming and Entertainment (SCOPE) is preparing to host its first rock concert of the school year. To successfully produce this rock concert, SCOPE has listed the requisite activities and related information in the following table (duration estimates measured in days). Immediate Most Activity Predecessor(s) Optimistic Probable Pessimistic A: Negotiate contract with - 10 11 12 selected musicians B: Reserve site - 8 10 12 C: Manage travel logistics A 2 7 9 for music group D: Screen & hire B 4 5 6 security personnel E: Arrange advertising C 7 7 7 & ticketing F: Hire parking staff A, D 8 9 16 G: Arrange concession sales E 6 7 11
15 X 10 6 15.5 1 (Max Flow Problem) 2 12 3 5 4.5 5 4 14.5 6 5 15.5 4.5 N Find the maximum flow from Node X to Node Z.

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

Purchasing and Supply Chain Management

Operations Management

ISBN:

9781285869681

Author:

Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson

Publisher:

Cengage Learning

Production and Operations Analysis, Seventh Editi…

Operations Management

ISBN:

9781478623069

Author:

Steven Nahmias, Tava Lennon Olsen

Publisher:

Waveland Press, Inc.

SEE MORE TEXTBOOKS