i need 4 ,5 ,6 HESFNotations usedEarliestActivityEarliestStartFinishTimeTieDurationCalculations:End time of preceding activity is the start time of succeeding activityAdd duration of activity to start time to get end time of activityIn case of 2 or more activities preceding an activity take activity with the latest finish time tocalculate the start time of the activity.1515 H 2336 | 448D 1519 G 2525 I36119F1910The last activity ends on the 44th day so,The total time taken by a project is 44 days Activity 2: Identify the critical path for the following three scenarios of a project activities(tables given below) and their required times to be completed in addition to their predecessorsfor developing a Website":Activity DescriptionDuration (days) Preceding ActivitiesADetermine user neceds8вReview s/w and languagesPurchase software9.DDesign format and style9.EWrite programsAFReview outcome productwith user10Make revisionsD, FHSelect server siteEInstall on server and test11GJH, I1. Draw the path.2. Calculate the early finishing time (forwards calculations)3. Highlight the total time to complete the project (days or weeks)4. Calculate the late finishing time (backwards calculations)5. Caleulate the slack time of the non-critical path activities6. Identify the critical path (highlight critical path activities)

Given that a certain type of activities and their durations to complete the project in time. find…

Answered: 4. Calculate the late finishing time…

4. Calculate the late finishing time (backwards calculations) 5. Calculate the slack time of the non-critical path activities 5. Identify the critical path (highlight critical path activities)

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter8: Network Models

Section8.5: Minimum-cost Network Flow Problems

Problem 8P

See similar textbooks

Similar questions

A company has various rules for how payments to suppliers are to be authorized.Some payments are in response to an approved purchase order. For approved purchase orders under $5,000, the accountingclerk can immediately issue a check againstthat purchase order and sign the check. Forapproved purchase orders between $5,000and $10,000, the accounting clerk can immediately issue a check but must additionallyobtain a second signature. Payments for approved purchase orders over $10,000 alwaysrequire the approval of the accounting manager to issue the check as well as the signature of two accounting clerks. Payments thatare not covered by a purchase order that areunder $5,000 must be approved by the accounting manager and a departmental manager who will absorb the cost of the paymentinto that department’s budget. Such checkscan be signed by a single accounting clerk.Payments that are not covered by a purchaseorder that are between $5,000 and $10,000must be approved by the accounting…
Correct answer will be upvoted else downvoted. Computer science. There are n issues numbered with integers from 1 to n. I-th issue has the intricacy ci=2i, label tagi and score si. In the wake of taking care of the issue I it's permitted to take care of issue j if and provided that IQ<|ci−cj| and tagi≠tagj. Subsequent to settling it your IQ changes and becomes IQ=|ci−cj| and you gain |si−sj| focuses. Any issue can be the first. You can tackle issues in any request and however many occasions as you need. At first your IQ=0. Track down the greatest number of focuses that can be procured. Input The main line contains a solitary integer t (1≤t≤100) — the number of experiments. The primary line of each experiment contains an integer n (1≤n≤5000) — the number of issues. The second line of each experiment contains n integers tag1,tag2,… ,tagn (1≤tagi≤n) — labels of the issues. The third line of each experiment contains n integers s1,s2,… ,sn (1≤si≤109) — scores…
Correct answer will be upvoted else downvoted. Computer science. saint or a beast is supposed to be living, if his or its wellbeing esteem is positive (more prominent than or equivalent to 1); and he or it is supposed to be dead, if his or its wellbeing esteem is non-positive (not exactly or equivalent to 0). To secure individuals in the country, the saint will battle with beasts until either the legend is dead or every one of the beasts are dead. In each battle, the legend can choose a subjective living beast and battle with it. Assume the I-th beast is chosen, and the wellbeing upsides of the legend and the I-th beast are x and y before the battle, separately. After the battle, the wellbeing upsides of the legend and the I-th beast become x−ai and y−A, separately. Note that the saint can battle a similar beast more than once. For the wellbeing of individuals in the nation, if it's not too much trouble, let them know whether the extraordinary legend can kill every one…
Correct answer will be upvoted else Multiple Downvoted. Computer science. All sections between two houses will be shut, in case there are no instructors in the two of them. Any remaining sections will remain open. It ought to be feasible to go between any two houses utilizing the underground sections that are open. Educators ought not reside in houses, straightforwardly associated by an entry. Kindly assist the coordinators with picking the houses where educators will reside to fulfill the security necessities or establish that it is unimaginable. Input The originally input line contains a solitary integer t — the number of experiments (1≤t≤105). Each experiment begins with two integers n and m (2≤n≤3⋅105, 0≤m≤3⋅105) — the number of houses and the number of sections. Then, at that point, m lines follow, every one of them contains two integers u and v (1≤u,v≤n, u≠v), depicting a section between the houses u and v. It is ensured that there are no two sections…
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. You are given a variety of n integers a1, a2, ..., an, and a set b of k unmistakable integers from 1 to n. In one activity, you might pick two integers I and x (1≤i≤n, x can be any integer) and allocate ai:=x. This activity should be possible provided that I doesn't have a place with the set b. Compute the base number of tasks you ought to perform so the cluster an is expanding (that is, a1<a2<a3<⋯<an), or report that it is inconceivable. Input The principal line contains two integers n and k (1≤n≤5⋅105, 0≤k≤n) — the size of the exhibit an and the set b, individually. The subsequent line contains n integers a1, a2, ..., an (1≤ai≤109). Then, at that point, if k≠0, the third line follows, containing k integers b1, b2, ..., bk (1≤b1<b2<⋯<bk≤n). On the off chance that k=0, this line is skipped. Output In case it is difficult to make the exhibit…
An electronics mega store is getting opened in "India". Under the same cap of Indian Mega store other two mega stores for North and South are getting opened. Under cap of North Store, two more sub-stores are getting opened. In this manner, total of 15 stores are opened which each having their own regions to cater to. At a particular time a store can handle at the most two sub stores. A particular store makes an earning of "X" amount for a given month. Ultimately at the end of month, all sub store submit their collected amount to their managing store. An model is needed to add more store, and print their monthly revenue. What do you think will be good data structure and how. What other facility can you provide to it. Implement the given model. using c language
Electronic Spreadsheet Applications Compare What-If Analysis using Trial and Error and Goal Seek to the given scenario: Let's say a student is enrolled in an online class at a learning institution for a semester. His overall average grade stands at 43% in the course (Term Grade is 45%, Midterm Grade is 65%, Class Participation is 62% and Final Exam is 0%). Unfortunately, he missed his Final Exam and was given 0%. However, he has the opportunity to redo his Final Exam and needs at least an overall average of 60% to pass the course. How can you use Trial and Error and Goal Seek to find out what is the lowest grade he needs on the Final Exam to pass the class? Which method worked best for you and why?
Correct answer will be upvoted else downvoted. Computer science. You are permitted to alter the marks through the accompanying activity: Pick two particular integers I and j among 1 and n. Trade the marks of focuses I and j, lastly Draw the section between focuses I and j. A grouping of tasks is legitimate if in the wake of applying every one of the activities in the succession all together, the k-th point winds up having the name k for all k among 1 and n comprehensive, and the drawn sections don't meet each other inside. Officially, assuming two of the portions cross, they should do as such at a typical endpoint of the two sections. Specifically, all drawn portions should be unmistakable. Track down any legitimate arrangement of activities, or say that none exist. Input The main line contains an integer n (3≤n≤2000) — the number of focuses. The I-th of the accompanying n lines contains three integers xi, yi, man-made intelligence (−106≤xi,yi≤106,…
Correct answer will be upvoted else downvoted. Computer science. There are n issues numbered with integers from 1 to n. I-th issue has the intricacy ci=2i, label tagi and score si. In the wake of taking care of the issue I it's permitted to take care of issue j if and provided that IQ<|ci−cj| and tagi≠tagj. In the wake of tackling it your IQ changes and becomes IQ=|ci−cj| and you gain |si−sj| focuses. Any issue can be the first. You can take care of issues in any request and however many occasions as you need. At first your IQ=0. Track down the most extreme number of focuses that can be acquired. Input The principal line contains a solitary integer t (1≤t≤100) — the number of experiments. The principal line of each experiment contains an integer n (1≤n≤5000) — the number of issues. The second line of each experiment contains n integers tag1,tag2,… ,tagn (1≤tagi≤n) — labels of the issues. The third line of each experiment contains n integers s1,s2,… ,sn…
A university has four undergraduate class levels and a graduate school. There are 7majors, although not all students have chosen a major. There are 1,200 studentsattending the university. The administration would like to know how many studentsare in each level, and how many students have each major. They also would like toknow how many of each class level have declared each major. Develop a solution tooutput the needed information. solve in c
To conduct an exam, an instructor first notifies the students of the exam date and the material to be covered. She then prepares the exam paper(with sample solutions), gets it copied to produce enough copies for the class, and hands it out to students on the designated time and location.The students write their answers to exam questions and hand in their papers to the instructor. The instructor then gives the exam papers to theTAs (Test Assistant), along with sample solutions to each question, and gets them to mark it. She then records all marks and returns the papersto the students. Draw a sequence diagram that represents this process. Make sure to show when is each actor participating in the process. Also,show the operation that is carried out during each interaction, and what its arguments are.
You are alone at home and have to prepare a bread sandwich for yourself. The following preparation activities and time taken are given in the table below: Determine the following:a. Find the earliest time and latest time for all activitiesb. While purchasing sauce, you met a friend and spoke to him for 6 minutes. Did this cause anydelay in the preparation?