Question

In: Statistics and Probability

Given the following project: Develop a time limited resource profile chart assuming unlimited resource availability. That...

Given the following project:

  1. Develop a time limited resource profile chart assuming unlimited resource availability. That is, determine the resource requirement on a weekly basis if the project is to be completed in the minimum time.
  2. Develop a resource-constrained schedule using the sequential heuristic.

Activity

Predecessor

Duration

(week)

Required No.

of Workers

1

-

3

2

2

-

2

1

3

2

3

2

4

2,5

4

2

5

1

4

1

6

3,4,1

3

1

7

3

4

2

8

5

3

1

Assume the followings:

  • The original relationships of the network cannot be violated.
  • Scheduling priority for each activity is determined via the following rules
  • least total slack
  • early start time
  • smallest duration
  • maximum resource level
  • once an activity is scheduled it continues without interruption

The available resource is three units

Solutions

Expert Solution

1)

Time-limited resource profile

2)

In the original schedule, we see that resource requirement in period 3, 8, and 9 exceeds the available resources (3). Therefore, activities C and G are rescheduled.

Resulting resource-constrained schedule is as follows:

-------------------------------------

DEAR STUDENT,

IF YOU HAVE ANY QUERY ASK ME IN THE COMMENT BOX,I AM HERE TO HELPS YOU.PLEASE GIVE ME POSITIVE RATINGS

*****************THANK YOU***************


Related Solutions

NPV profile of a project. Given the following cash flow of Project​ L-2, draw the NPV...
NPV profile of a project. Given the following cash flow of Project​ L-2, draw the NPV profile. Hint​: Be sure to use a discount rate of zero for one intercept ​(y​-axis) and solve for the IRR for the other intercept ​(x​-axis). Year 0   -$250,000 Year 1   $49,000 Year 2   $80,000 Year 3   $114,000 Year 4   $139,000 What is the NPV of Project​ L-2 where zero is the discount​ rate? What is the IRR of Project​ L-2? Which of the graphs...
You are given the following cash flows for the project: Time 0 Time 1 Time 2...
You are given the following cash flows for the project: Time 0 Time 1 Time 2 Time 3 Time 4 -115,000 30,000 50,000 50,000 20,000 If the If the required rate of return is 13%, (1) what is the payback period, (2) what is the NPV, (3) what is the IRR, and (4) what is the Profitability Index (PI). Should we accept the project?
Develop a python program to create a quiz with limited time and attempts!!! Add comments and...
Develop a python program to create a quiz with limited time and attempts!!! Add comments and screenshot of running the program quiz could be of anything like , what's the sum of 2&2. There should be number of attempts(limited) suppose if the answer is wrong.
Develop a chart that includes the structure and function of the following: • Skin • Keratinocytes...
Develop a chart that includes the structure and function of the following: • Skin • Keratinocytes • Melanocytes • Langerhans cells • Merkel • Cells • Dermis • Basement membrane zone • Sebaceous gland • Eccrine gland • Apocrine gland • Nails • Hair
Answer the following questions, in regards to a organizational chart. This should be limited to senior...
Answer the following questions, in regards to a organizational chart. This should be limited to senior management groups. 1. What specific types of data were collected? 2. What did you learn about the management structure in terms of relationships and authority? 3. What did you learn about the development of an organizational chart? 4. What types of data sources were used to prepare responses to these questions?
Deadlocks. The Banker's algorithm is used for deadlock avoidance. Consider the state of resource availability and allocation defined by the following matrices.
Deadlocks. The Banker's algorithm is used for deadlock avoidance. Consider the state of resource availability and allocation defined by the following matrices.(1) Assuming that the total amounts for resources R1, R2, and R3 are 10, 2, and 10, should a new request to the Banker's algorithm by process P3 to acquire one additional resource from R1 and one additional resource from R3 be approved or denied? Explain why or why not(2) Assuming that the total amounts for resources R1, R2,...
You are offered to invest in a project with the following cash flow profile. What is...
You are offered to invest in a project with the following cash flow profile. What is the future worth (i.e., at t = 10) of this investment to you if your MARR is 7%? t 0 1 2 3 4 5 6 7 8 9 10 $ in million -10 0 0 0 0 5 5 5 5 5 7.5 A. $20.1 million B. $18.6 million C. $16.1 million D. $14.6 million My answer is B but I just want...
Develop code in a Scala Maven project to monitor a folder in HDFS in real time...
Develop code in a Scala Maven project to monitor a folder in HDFS in real time such that any new file in the folder will be processed. For each RDD in the stream, the following subtasks are performed concurrently: (a) Count the word frequency and save the output in HDFS.Note, for each word, make sure space (" "), comma (","), semicolon (";"), colon (":"), period ("."), apostrophe (“’”), quotation marks (“””), exclamation (“!”), question mark (“?”), and brackets ("[", “{”,...
3) For the following situation, assuming that the capitalization rate will remain constant, develop an estimate...
3) For the following situation, assuming that the capitalization rate will remain constant, develop an estimate of the property's market value at the end of the projected holding period. Allen Benedict is thinking of buying an apartment complex that is offered for sale by the firm of Getz and Fowler. The price, $2.25 million, equals the property's market value. The following statement of income and expense is presented for Benedict's consideration: The St. George Apartments Prior Year's Operating Results, Presented...
Given an unsorted integer array A of size n, develop an pseudocode with time complexity as...
Given an unsorted integer array A of size n, develop an pseudocode with time complexity as low as possible to find two indexes i and j such that A[i] + A[j] = 100. Indexes i and j may or may not be the same value.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT