Find the shortest amount of time required to solve the following scheduling prob

Question

Find the shortest amount of time required to solve the following scheduling problem:
Job.     Time required.       Prerequisite
A.              2.                             none
B.              5.                              A
C.              3.                              A & B
D.              1.                               C
E.              7.                                B
F.              6.                                 E
G.             3.                                 F

Explanation / Answer

All the jobs have a pre-requisite except A, hence we need to schedule A first in the queue

A

Only job B can be done after the sucessful completion of A

B

Now we have two option either pick up Job E or Job C, let us pick Job C shortest job first algorithm

C

Followed by D,E,F,G

Time taken = 2 + 5 + 3 + 1 + 7 + 6 + 3 = 27 units of time

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.