Part 2. Questions 3-5 Consider the jobs scheduled on two machines in the order o

Question

Part 2. Questions 3-5 Consider the jobs scheduled on two machines in the order of (A,B,C) where each job is started as soon as possible. The processing times for each job on eaclh machine are given in the table below. Assume time on machine #1 is represented with "(I)', and on machine #2 with "(2)". Job Machine#1 Time Machine#2 Time Question 3. Which Gantt chart is correct for the schedule (A,B,C)? Gantt Chart A Job TI T2 1 2 34 5 6 7 8 9 10 11 12 A 2 (D (D(2) (DO(D(2)(2) Gantt Chart B Job TI T21 2 34 5 6 8 9 10 11 12 B3 (DOD(2)(2) Gantt Chart C Job TI T21 2 345 6789 10 11 12 Gantt Chart D Job TI T2 1 2 345 6789 10 11 12 A 2( ((2) B 3 2 E. None of the above

Explanation / Answer

Q3: option A, gantt chart A

Since we can start each job as soon as possible, as soon as machine 1 is free, we start next job on machine 1.

So, time 1,2 is used by machine jobA in machine 1, At time 3, job A machine 2 starts and also we can start job B machine 1. time 3,4,5 is job B machine 1, At time 6 we start job B machine 2, also job C machine 1. then as soon as machine 2 is free we start job C machine 2 and finish the schedule.

Q4) option C 10

as we can see in gantt chart A above, that Job C is finished at time 10, hence total time for schedule is 10.

Q5) Option B, CBA

According to johnson rule, we look for lowest time, which is 1 in job C machine1, and job A machine 2. SInce we use machine 1 first, hence JOb C goes to be 1st job, and Job A becomes last. The job B becomes 2nd job.

Hence CBA

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---