# Consider the following 3 projects with different ready times (TA ¼ 12, TB ¼ 20, and TC ¼ 0), before.

• August 02, 2021/

Consider the following 3 projects with different ready times
(TA ¼ 12, TB ¼ 20, and TC ¼ 0), before which the corresponding project cannot
be started.

Don't use plagiarized sources. Get Your Custom Essay on
Consider the following 3 projects with different ready times (TA ¼ 12, TB ¼ 20, and TC ¼ 0), before.
Just from \$13/Page

There is a single resource employed by all activities of all
projects whose availability is 10 units per period. Schedule the activities of
these projects to minimize the overall makespan using the SPT priority rule and
break any ties arbitrarily. To limit the computational effort, when scheduling
the activities, generate the EAS 6 times and make the assignments and then
stop.

Q78;

Consider the following two projects with AOA type
representation. The durations are indicated on each arc together with the
renewable resource requirement given in brackets. The renewable resource
availability is 4 units.

(a) Let the objective be the minimization of the throughput
time ¼ max C1 max,C2 max

. Find the individual project durations. Use the Shortest Operation First
(SOF) as the priority rule, breaking the ties with the First Come First Serve
(FCFS) priority rule. Apply parallel schedule generation scheme. (b) Using the
objective function of part (a), employ the minimum slack (MSLK) as the priority
rule. Break the ties using the FCFS priority rule. Compare the solution with
that of part (a). (c) Solve the   under the same conditions to minimize the
average tardiness. Which priority rule would you employ? The due dates for
projects I and II are given as 18 and 24 periods, respectively. (d) Evaluate
the average tardiness values for the schedules in parts (a) and (b) and compare
them with the one you obtained in part (c).