Part 5. Questions 8,9. [ Use Video-1 under Scheduling heading. ]

[Note: The order of jobs in a schedule is 1^st,2^nd,3^rd, for A,B,C, respectively.]

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 each machine are given in the table below. Assume time on machine #1 is represented with (1) and on machine #2 with (2).

Job	Machine#1 Time	Machine#2 Time
A	2	1
B	3	2
C	1	3

Question 8. Which Gantt chart is correct for the schedule (A,B,C)?

Gantt Chart A	Job	T1	T2	1	2	3	4	5	6	7	8	9	10	11	12
	A	2	1	(1)	(1)	(2)
	B	3	2			(1)	(1)	(1)	(2)	(2)
	C	1	3						(1)		(2)	(2)	(2)
Gantt Chart B	Job	T1	T2	1	2	3	4	5	6	7	8	9	10	11	12
	A	2	1	(1)	(1)	(2)
	B	3	2			(1)	(1)	(1)	(2)	(2)
	C	1	3						(1)	(2)	(2)	(2)
Gantt Chart C	Job	T1	T2	1	2	3	4	5	6	7	8	9	10	11	12
	A	2	1	(1)	(1)	(2)
	B	3	2			(1)	(1)	(1)		(2)	(2)
	C	1	3						(1)			(2)	(2)	(2)
Gantt Chart D	Job	T1	T2	1	2	3	4	5	6	7	8	9	10	11	12
	A	2	1	(1)	(1)	(2)
	B	3	2			(1)	(1)	(1)		(2)	(2)
	C	1	3						(1)	(2)	(2)	(2)
E	E. None of the above

. . .

Question 9. How many of the statements are correct for the schedule (A,B,C)?

(A) 0 (B) 1 (C) 2 (D) 3 (E) 4

Statement 1. The total processing time of the schedule is 10

Statement 2. The total queue time of job C is 6

Statement 3. The total flow time of job B is 7

Statement 4. The total idle time of machine 2 is 4

. . .