Professional Documents
Culture Documents
HA-4
HA-4
HA-4
2) There are six jobs, each of which must go through machines A and B in the
order AB. Processing Times in minutes are given in the table below. Find the
sequence that minimizes the total elapsed time required to complete jobs and
also find idle time for machines A & B.
Processing Time
Job
Machine-A Machine-B
1 8 10
2 12 7
3 7 11
4 10 6
5 11 12
6 9 8
3) There are five jobs, each of which must go through machines A, B and C in
the order ABC. Processing Times in minutes are given in the table below. Find
the sequence that minimizes the total elapsed time required to complete jobs
and also find idle time for machines A, B and C.
Processing Time
Job
Machine-A Machine-B Machine-C
1 6 6 7
2 9 3 8
3 4 2 6
4 5 4 9
5 3 5 8
4) There are eight jobs, each of which must go through machines A, B and C
in the order ABC. Processing Times in minutes are given in the table below.
Find the sequence that minimizes the total elapsed time required to complete
jobs and also find idle time for machines A, B & C.
Processing Time
Job
Machine-A Machine-B Machine-C
A 4 6 8
B 8 4 7
C 5 7 9
D 9 1 7
E 3 4 9
F 4 2 8
G 9 5 9
H 6 2 7