1st part of question is answered by somebody Need part 2 als

1st part of question is answered by somebody. Need part 2 also, which I have added.

1. Given the network plan that follows, compute the early, late, and slack times. What is the project duration? Using any approach you wish (e.g., trial and error), develop a loading chart for resources, Electrical Engineers (EE), and re-source, Mechanical Engineers (ME). Assume only one of each resource exists. Given your resource schedule, compute the early, late, and slack times for your project. Which activities are now critical? What is the project duration now? Could something like this happen in real projects? (I have this answer)

Part 2 - Create a network schedule using the information provided in the exercise, apply resources, and adjust the schedule to eliminate over commitment of resources. Need this answer. Thx Jeff

Solution

you are not attached the exercise information table so i will explain way to solve the network schedule.

schedule is a time table showing when job is done.there are many ways to schedule according to the requirement.

1.shortest processing time: it is use whenever we want to reduce the slack time minimise the cost.

2. earliest due date: this process used whenever we want least slack time.

3.first come first served: this type mainly in the queing problems

actually resource scheduling under the type of transportation model

allocating the machine to the resouce