Question

Part 5.   Questions 8,9. [ Use Video-1 under Scheduling heading. ] [Note: The order of jobs...

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

[Note: The order of jobs in a schedule is 1st,2nd,3rd, 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

. . .

Homework Answers

Answer #1

Question – 8:

Answer is: Gantt Chart A

Explanation:

As the sequence is A, then B and then C:

Machine 1 will start with A and will process for 2 time period

Then Job A will be processed in Machine 2 for 1 time period

Now as after t-2, Machine 1 is free, B can start from then for 3 time period

And so on.

Hence.

Question – 9:

From the gantt chart A provided in que-8:

Statement 1 is true as the total time is 10

Statement 2 is true, as total queue time is 6 (5 to start and then 1 to wait for Job B to finish from Machine 2)

Statement 3 is true as total flow time is 7 (from the starting of Job A, till the end of Job B)

Statement 4 is also true. (Machine 2 is idle for time 1, 2, 4, 5, and 7.

Answer is: (E) 4

********

IF YOU HAVE ANY DOUBT, KINDLY COMMENT. I WOULD LOVE TO HELP YOU!!!

IF YOU LIKE THE ANSWER, PLEASE GIVE AN UP-VOTE OR THUMB UP. THIS WILL ENCOURAGE ME TO ANSWER MORE!!

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Part 3. Questions 3,4,5. [ Use Video-2 under Scheduling heading. ] [Note: The order of jobs...
Part 3. Questions 3,4,5. [ Use Video-2 under Scheduling heading. ] [Note: The order of jobs in a schedule ABCDE is 1st,2nd,3rd,4th,5th, respectively.] Five jobs arrived to be processed with the processing times and due dates. Present Date= 300 Work Order A B C D E Processing Times (Days) 14 5 40 12 7 Due Date 167 163 195 191 161 . . . Question 3. The FIFO schedule is “ABCDE” (where job “A” is the first job) and the...
Part 4.   Questions 6,7. [ Use Video-1 under Scheduling heading. ] [Note: The order of jobs...
Part 4.   Questions 6,7. [ Use Video-1 under Scheduling heading. ] [Note: The order of jobs in a schedule is 1st,2nd,3rd,4th,5th, for A,B,C,D,E, respectively.] The jobs A,B,C,D,E, arrived in that order to be processed on two machines. Job A B C D E Time on Machine 1 45 53 63 31 75 Time on Machine 2 42 65 61 53 77 Question 6. Which is the Johnson’s Rule schedule?      (A) ‘ACEBD’     (B) ‘DCABE’     (C) ‘DBECA’     (D) ‘DABEC’   (E) none...
[Note: The order of jobs in a schedule is 1st,2nd,3rd,4th,5th, for A,B,C,D,E, respectively.] The jobs A,B,C,D,E,...
[Note: The order of jobs in a schedule is 1st,2nd,3rd,4th,5th, for A,B,C,D,E, respectively.] The jobs A,B,C,D,E, arrived in that order to be processed on two machines. Job A B C D E Time on Machine 1 40 48 58 26 70 Time on Machine 2 37 60 56 48 72 Question 6. Which is the Johnson’s Rule schedule?      (A) ‘DBECA’     (B) ‘ACEBD’     (C) ‘DCABE’     (D) ‘DABEC’   (E) none of the above Question 7. Consider the FIFO schedule of (A,B,C,D,E)....
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    (a)     Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling for these jobs. [3 Marks] Answer (a) 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16...
Three jobs are to be assigned to three machines. Cost for each job-machine combination appears in...
Three jobs are to be assigned to three machines. Cost for each job-machine combination appears in the table below. Perform the assignment method. What is the optimal assignment? Machine A Machine B Machine C Job 1 11 14 6 Job 2 8 10 11 Job 3 9 12 7
Use Johnson's rule to determine the optimal sequencing for the five jobs to be processed on...
Use Johnson's rule to determine the optimal sequencing for the five jobs to be processed on two machines in a fixed order (Machine 1 before Machine 2). The processing times are given in the table below. Job Machine 1 Machine 2 L 10 2 M 5 4 N 7 5 O 3 6 P 1 7 ** Please show excel steps so i can see if I did this right** thanks What is the optimal sequence? What is the total...
Question from my Operations Management course. Please solve it ASAP. Make a Gantt chart for the...
Question from my Operations Management course. Please solve it ASAP. Make a Gantt chart for the data table given below: Processing Time (Hours) Job Work Center 1 Work Center 2 A 3 3 B 2 3 C 4 6 D 1 4 Note (for helping you): Table for Job A has this sequence for Gantt Chart: 1st 2nd 3rd 4th D C A B
If the following jobs are sequenced according to the SLACK rule then job A would be...
If the following jobs are sequenced according to the SLACK rule then job A would be completed on day (assume zero for today's date) Job - Processing Time (days) - Due Date A 8 12 B 6 15 C 11 17 D 7 10 E 3 8 Select one: A. 7. B. 15. C. 8. D. 12.
Program P1 1) integer A, B; 2) input (A); 3) while (A > 0) 4) {...
Program P1 1) integer A, B; 2) input (A); 3) while (A > 0) 4) { 5) B = 1; 6) if (A < 10) 7) B = 0; 8) if (A < 20 or A > 25) 9) B = A * B; 10) else 11) B = A + B; 12) output (A, B); 13) input (A); 14) } 15) output (“Program ends.”); 16) end; T = {t1=<1>, t2=<33>, t3=<‐1>} or T = {t1=, t2=, t3=} 6. If...
Consider the following set of jobs to be scheduled for execution on a single CPU system....
Consider the following set of jobs to be scheduled for execution on a single CPU system. Job Arrival Time Burst (msec) Priority A 0 6 3 (Silver) B 1 2 1 (Diamond) C 3 5 3 (Silver) D 5 3 4 (Bronze) E 7 2 2 (Gold)    (a)     Draw a Gantt chart showing First-Come-First-Served (FCFS) scheduling , Premtive PRIORITY Sheduling, Highest Response ratio Next (HRRN) and Round Robin(quantum=4). I need this in half hour