2. Consider the following project network, where the number over each node is the time required for the corresponding activity. Consider the problem of finding the longest path (the largest total time) through this network from start to finish, since the longest path is the critical path. 0 START 5 3 B 3 1 + (C) 4 7 0 FINISH (a) For the dynamic programming formulation of this problem, how many stages are there, and what are the states for each stage? (b) Use dynamic programming to solve this problem. However, instead of using the usual tables, show your work graphically. In particular, fill in the values of the various f (Sn) under the corresponding nodes, and show the resulting optimal arc to traverse out of each node by drawing an arrowhead near the beginning of the arc. Then identify the optimal path (the longest path) by following these arrowheads from the Start node to the Finish node. If there is more than one optimal path, identify them all. (c) Use dynamic programming to solve this problem by constructing the usual tables for each stage.

2. Consider the following project network, where the number over each node is the time required for the corresponding activity. Consider the problem of finding the longest path (the largest total time) through this network from start to finish, since the longest path is the critical path. 0 START 5 3 B 3 1 + (C) 4 7 0 FINISH (a) For the dynamic programming formulation of this problem, how many stages are there, and what are the states for each stage? (b) Use dynamic programming to solve this problem. However, instead of using the usual tables, show your work graphically. In particular, fill in the values of the various f (Sn) under the corresponding nodes, and show the resulting optimal arc to traverse out of each node by drawing an arrowhead near the beginning of the arc. Then identify the optimal path (the longest path) by following these arrowheads from the Start node to the Finish node. If there is more than one optimal path, identify them all. (c) Use dynamic programming to solve this problem by constructing the usual tables for each stage.

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

If the estimated time of each wall/ceiling activity is two weeks, the estimated time of each flooring activity is one week, and the estimated time of each exterior activity is three weeks, what is the expected project completion time?
Asap please
2. Eowle Marketing Research has four project leaders available for the assignment of project leaders to clients that will minimize the total time to complete all projects. The estimated project completion times in days are as follows: PROJECT CLIENT LEADER 1 2 3 ADAM 10 15 9 BOB 9. 18 CARL 14 3 DAN 8 16 6 Formulate the complete LP model.
The university administration would like to add some additional parking locations. To make everyone happy, they would like each building to be within a 5 minute walk of one set of new parking spaces (the spaces will be added in blocks of 10 parking spaces). The university is considering six locations for the new parking spaces, but would like to minimize the overall cost of the project. In addition to the walking time requirement, the university would like to add at least 40 new parking spaces (at least 4 blocks of 10). To help with the decision, the management science department formulated the following linear programming model: Min 355x1 + 410x2 + 425x3+ 415x4 + 500x5 + 405x6 s.t. x1 + x2 + x5 + x6 2 1 (Residence Hall A constraint) x1 + x2 + x3 2 1{Residence Hall B constraint} X4 + x5 + x6 2 1(Science building constraint} x1 + x4 + x5 2 1(Music building constraint} x2 + x3 + x4 2 1 (Math building constraint) x3 + x4 + x5 2 1 (Business building constraint} x2 + x5 + x6 2 1(Auditorium…
M7-3 Assignment Use Microsoft Project software to solve this assignment problem. Submit your project file and provide your answers on the attached answer sheet template. Consider the following network with tasks duration in days: TPPM Assignment 7 - Page 13 (Note: Tack is a dummy task. It must be included in the relationships, but its duration is set duration Task Pastimet Lily Optimatic FedCat A 1000 2 • GOO 12 7 2 2500 D 12 800 9 800 24 12 2400 G 11 4 800 H " 5 1200 2 5000 25 17 9 4200 K 3000 L 2500 M 12 30 3000 N 1. Set the Project start on Monday 11/1/20 Thursday 11/26/20, Friday 11/27/20, 12/25/20, and 1/1/21 are holidays 2. Determine critical path and its duration. When the project will end date? 3. There is a possiblity that the starting task K may be delayed by 3 days. Will this impact the project completion date? If yes, when will be the new finish date? (After checking this out, please restore the project to its original schedule). 4. Assign the following resources to the…
A B C D F G H M N O P Raptor Consulting has three (3) projects to complete this year. They have four (4) project teams currently available. Each project team can at most do one project. Based on the mix of skills and experience on each of the teams, Raptor has developed the following estimates on time taken by each team (in days) to 2 complete each proiect. 3 4 5 6 7 8 9 10 Determine the optimal assignment of teams to projects in order minimize the total days taken to complete all the projects. 11 12 Please answer items A-E below 13 A. Formulate the problem as an assignment problem. Use worksheet tab "Q2 SS Model" to develop your formulation. 14 Use worksheet tab "Q2 SS Model" to develop your formulation 15 16 B. Solve the problem using Excel Solver. 17 Use worksheet tab "Q2 SS Model" Teams Project Team 1 Team 2 Project A 50 30 Project B 35 28 Project C 33 37 Ready Title Q1 E Accessibility: Investigate Team 3 Team 4 55 27 25 35 30 23 18 19 C. What is the optimal assignment of teams to…
For many years, the Triple Constraints Theory has been taught as an underpinning concept of project management. In recent times, however, the modern approach to project management recognizes more than just three constraints and includes additional constraints such as project risks, resources, and quality. However, the understanding and working of triple constraints theory remain relevant in practice and it continues to be taught in many business schools and universities around the world. Project managers are encouraged to understand the workings of the triple constraint of project management. Question: With the use of examples,explain the working of the triple constraints of project management and discuss why the understanding of the triple constraints of project management is useful to a project manager.
Illustrate the network diagram provided below, with the use of circle and arrows.
The network diagram of a project with four activities is presented below. Start A B C D The estimated optimistic, most likely, and pessimistic times of each task are given in the table below. The expected time and variance of acitivities A are also given in the table. The expected time and variance of activity C and D are irrelevant in this problem. So they can be ignored. optimistic 14 4 5 5 most likely B 18 10 7 10 End pessimistic 23 18 13 12 Expected time 18.167 XX mm variance 81/36 [Three decimal places for all answers) (1) What is the expected task time of activity B? (2) What is the variance of the task time for activity B (3) What is the expected length of path A-B? (2) What is the standard deviation of the length of path A-B? yy 22
Please do not give solution in image formate thanku. There are four critical paths in a network. A-B-C-D-E, A-F-E, A-B-H-J-K-E and A-S-T-E. Each activity in this network can be crashed by a maximum of 4 weeks. The crashing cost (per week), for the first week (crashing first time), for activity A is: $400, E is $415 and all other activities is : $100 (per week per activity). The crashing cost, second week and onwards(crashing second time), for activity A is $1000 per week, E is $1200 per week and for all other activities is $200 per activity per week. You have a maximum crashing budget of $2505. The maximum possible reduction in the project duration will be: a. 2 weeks b. 3 weeks c. 4 weeks d. 5 weeks e. 6 weeks
Solve the given problem by linear programming.
snip